Article

Free access

Reducing cross domain call overhead using batched futures

Authors:

Barbara LiskovAuthors Info & Claims

OOPSLA '94: Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications

Pages 341 - 354

https://doi.org/10.1145/191080.191133

Published: 01 October 1994 Publication History

Abstract

In many systems such as operating systems and databases it is important to run client code in a separate protection domain so that it cannot interfere with correct operation of the system. Clients communicate with the server by making cross domain calls, but these are expensive, often costing substantially more than running the call itself. This paper describes a new mechanism called batched futures that transparently batches possibly interrelated client calls. Batching makes domain crossings happen less often, thus substantially reducing the cost. We describe how the mechanism is implemented for the Thor object-oriented database system, and presents performance results showing the benefit of the mechanism on various benchmarks.

References

[1]

Barrera, J., Invocation Chaining: Manipulating Lightweight Objects across Heavyweight Boundaries. In Fourth IEEE Workshop on Workstation Operating Systems, Oct. 1993, 19 I- 193.

[2]

Bershad, B., Anderson, T., Lazowska, E., and H. Levy, Lightweight Remote Procedure Call. In ACM Transactions on Computer Systems, Vol. 8, No. 1, Feb., 1990, 175-198.

Digital Library

[3]

Birrell, A.D. and B. J. Nelson, Implementing Remote Procedure Calls. In A CM Transactions on Computer Systems, Vol. 2, No. 1, Feb. 1984, 39-59.

Digital Library

[4]

Bogle, P., An Efficient Object-Database Interface using Batched Futures. Lab. for Computer Science Tech. Report TR-624, MIT LCS, Cambridge Ma., July 1994.

Digital Library

[5]

Carey, M. J., DeWitt, D. J., and J. E Naughton, The 007 Benchmark, In Proc. of the 1993 ACM Sigmod International Conference on Management of Data, ACM Sigmod Record, Vol. 22, No. 2, June 1993, 12-21.

Digital Library

[6]

Day, M., Client Cache Management in a Distributed Object Database. PhD. Thesis, MIT, Cambridge, Ma., forthcoming.

Digital Library

[7]

Day, M., Gruber, R., Liskov, B., and A. Myers, Abstraction Mechanisms in Theta. Prog. Method. Group Memo 81, Lab. for Computer Science, Cambridge Ma. forthcoming.

[8]

Gifford, D.K. and N. Glasser, Remote Pipes and procedures for efficient distributed communication. In A CM Transactions on Computer Systems, Vol. 6, No. 3, Aug. 1988, 258-283.

Digital Library

[9]

Halstead, R., Multilisp: A Language for Concurrent Symbolic Computation. In ACM Transactions on Programming Languages and Systems, Vol. 7, No. 4, Oct. 1985,501-538.

Digital Library

[10]

Herlihy, M.P. and B.L. Liskov, A value transmission method for abstract data types. In A CM Transactions on Programming Languages and Systems, Vol. 4, No. 4, Oct. 1982, 527-551.

Digital Library

[11]

Liedtke, J., Improving IPC By Kernel Design. In Proc. of the Fourteenth A CM Symposium on Operating Systems Principles, ACM Sigops Review, Vol. 27, No. 5, Dec. 1993, 175-187.

Digital Library

[12]

Liskov, B.L. and A. Snyder, Exception Handling in CLU. In IEEE Transactions on Software Engineering, Vol. SE-5, No. 6, Nov. 1979, 546-558.

Digital Library

[13]

B. Liskov, Day, M., and L. Shrira, Distributed Object Management in Thor. In Distributed Object Management, M. T. Ozsu, U. Dayal, and P. Valduriez, Eds., Morgan Kaufmann, 1992, 79-91.

[14]

Liskov, B.L., Communication in the Mercury System. In Proc. of the 21st Annual Hawaii Conference on System Sciences, IEEE, Jan. 1988, 178-187.

Digital Library

[15]

Liskov, B. L. and L. Shrira, Promises: Linguistic Support for Efficient Asynchronous Procedure Calls in Distributed Systems. In Proc. ACM Sigplan '88 Conference on Programming Languages Design and Implementation, ACM Sigplan Notices, Vol. 23, No. 7, June 1988, 260-267.

Digital Library

[16]

Stamos, J., Remote Evaluation, PhD. Thesis, Lab. for Computer Science Tech. Report TR-354, MIT LCS, Cambridge, Ma., Jan. 1986.

Digital Library

[17]

Wahbe, R., Lucco, S., Anderson, T., Graham, S., Efficient Software-Based Fault Isolation. In Proc. of the Fourteenth A CM Symposium on Operating Systems Principles, ACM Sigops Review, Vol. 27, No. 5, Dec. 1993, 203-216.

Digital Library

Cited By

Yan XJoa AWong BCassell BSzepesi TNaouach MLam DPierre GFerreira PShrira L(2018)SpecRPCProceedings of the 19th International Middleware Conference10.1145/3274808.3274829(266-278)Online publication date: 26-Nov-2018
https://dl.acm.org/doi/10.1145/3274808.3274829
Luo ZFragoso Santos JAlmeida Matos ARezk T(2016)Mashic compiler: Mashup sandboxing based on inter-frame communicationJournal of Computer Security10.3233/JCS-16054224:1(91-136)Online publication date: 1-Mar-2016
https://doi.org/10.3233/JCS-160542
Gibbons J(2016)Free delivery (functional pearl)ACM SIGPLAN Notices10.1145/3241625.297600551:12(45-50)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/3241625.2976005
Show More Cited By

Index Terms

Reducing cross domain call overhead using batched futures

Recommendations

Reducing cross domain call overhead using batched futures

In many systems such as operating systems and databases it is important to run client code in a separate protection domain so that it cannot interfere with correct operation of the system. Clients communicate with the server by making cross domain calls,...
Increasing Cross-Domain Call Batching Using Promises and Batched Control Structures
A Safe, Efficient Object Database Interface Using Batched Futures

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

OOPSLA '94: Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications

October 1994

476 pages

ISBN:0897916883

DOI:10.1145/191080

Chairmen:
Jeff McKenna
McKenna consulting group
,
J. Eliot B. Moss
Univ. of Massachusetts, Amherst
,
Editor:
Richard L. Wexelblat

ACM SIGPLAN Notices Volume 29, Issue 10
Oct. 1994
473 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/191081
Editor:
Richard L. Wexelblat
Issue’s Table of Contents

Copyright © 1994 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

OOPSLA94

Sponsor:

SIGPLAN

OOPSLA94: Conference on Object Oriented

October 23 - 28, 1994

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 268 of 1,244 submissions, 22%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
959
Total Downloads

Downloads (Last 12 months)66
Downloads (Last 6 weeks)12

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yan XJoa AWong BCassell BSzepesi TNaouach MLam DPierre GFerreira PShrira L(2018)SpecRPCProceedings of the 19th International Middleware Conference10.1145/3274808.3274829(266-278)Online publication date: 26-Nov-2018
https://dl.acm.org/doi/10.1145/3274808.3274829
Luo ZFragoso Santos JAlmeida Matos ARezk T(2016)Mashic compiler: Mashup sandboxing based on inter-frame communicationJournal of Computer Security10.3233/JCS-16054224:1(91-136)Online publication date: 1-Mar-2016
https://doi.org/10.3233/JCS-160542
Gibbons J(2016)Free delivery (functional pearl)ACM SIGPLAN Notices10.1145/3241625.297600551:12(45-50)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/3241625.2976005
Gibbons JMainland G(2016)Free delivery (functional pearl)Proceedings of the 9th International Symposium on Haskell10.1145/2976002.2976005(45-50)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/2976002.2976005
Sivaramakrishnan KQudeisat MZiarek LNagaraj KEugster P(2013)Efficient sessionsScience of Computer Programming10.1016/j.scico.2012.03.00478:2(147-167)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1016/j.scico.2012.03.004
Tamayo JAiken ABronson NSagiv M(2012)Understanding the behavior of database operations under program controlACM SIGPLAN Notices10.1145/2398857.238468847:10(983-996)Online publication date: 19-Oct-2012
https://dl.acm.org/doi/10.1145/2398857.2384688
Tamayo JAiken ABronson NSagiv MLeavens GDwyer M(2012)Understanding the behavior of database operations under program controlProceedings of the ACM international conference on Object oriented programming systems languages and applications10.1145/2384616.2384688(983-996)Online publication date: 19-Oct-2012
https://dl.acm.org/doi/10.1145/2384616.2384688
Raman AYorsh GVechev MYahav E(2011)SprintACM SIGPLAN Notices10.1145/2076021.204808846:10(259-274)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1145/2076021.2048088
Raman AYorsh GVechev MYahav ELopes CFisher K(2011)SprintProceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications10.1145/2048066.2048088(259-274)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1145/2048066.2048088
Cook WBarfield J(2006)Web Services versus Distributed ObjectsProceedings of the IEEE International Conference on Web Services10.1109/ICWS.2006.145(419-426)Online publication date: 18-Sep-2006
https://dl.acm.org/doi/10.1109/ICWS.2006.145
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents