Abstract
We present a new run-time system, DOSA, that effciently implements a shared object space abstraction underneath a typed pro- gramming language. The key insight behind DOSA is that the ability to unambiguously distinguish pointers from data at run-time enables ef- ficient fine-grained sharing using VM support . Like earlier systems de- signed for fine-grained sharing, DOSA improves the performance of fine- grained applications by eliminating false sharing. In contrast to these earlier systems, DOSA’s VM-based approach and read aggregation en- able it to match a page-based system on coarse-grained applications. Furthermore, its architecture permits optimizations that are not possi- ble in conventional fine-grained or coarse-grained DSM systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Amza, A. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu,and W. Zwaenepoel. TreadMarks: Shared memory computing on networks of workstations. IEEE Computer, 29(2):18–28, Feb. 1996.
H. Bal, R. Bhoedjang, R. Hofman, C. Jacobs, K. Langendoen, T. Ruhl, and M. Kaashoek. Performance evaluation of the Orca shared object system. ACM Transactions on Computer Systems, 16(1), Feb. 1998.
D. I. Bevan. Distributed garbage collection using reference counting. In Parallel Arch. and Lang. Europe, pages 117–187, Eindhoven, The Netherlands, June 1987. Spring-Verlag Lecture Notes in Computer Science 259.
T. Brecht and H. Sandhu. The region trap library: Handling traps on applicationdefined regions of memory. In Proceedings of the 1999 USENIX Annual Tech. Conf., June 1999.
M. Carey, D. DeWitt, and J. Naughton. The OO7 benchmark. Technical report, University of Wisconsin-Madison, July 1994.
J. Carter, J. Bennett, and W. Zwaenepoel. Techniques for reducing consistencyrelated information in distributed shared memory systems. ACM Transactions on Computer Systems, 13(3):205–243, Aug. 1995.
R. Chandra, A. Gupta, and J. Hennessy. Cool: An object-based language for parallel programming. IEEE Computer, 27(8):14–26, Aug. 1994.
S. Dwarkadas, K. Gharachorloo, L. Kontothanassis, D. J. Scales, M. L. Scott, and R. Stets. Comparative evaluation of fine-and coarse-grain approaches for software distributed shared memory. In Proceedings of the Fifth International Symposium on High-Performance Computer Architecture, pages 260–269, Jan. 1999.
K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 15–26, May 1990.
A. Itzkovitz and A. Schuster. Multiview and millipage-fine-grain sharing in page-based DSMs. In Proceedings of the Third USENIX Symposium on Operating System Design and Implementation, Feb. 1999.
P. Keleher. The relative importance of concurrent writers and weak consistency models. In Proceedings of the 16th International Conference on Distributed Computing Systems, pages 91–98, May 1996.
M. C. Rinard and M. S. Lam. The design, implementation, and evaluation of Jade. ACM Transactions on Programming Languages and Systems, 20(3):483–545, May 1998.
D. Scales, K. Gharachorloo, and C. Thekkath. Shasta: A low overhead softwareonly approach for supporting fine-grain shared memory. In Proceedings of the 7th Symposium on Architectural Support for Programming Languages and Operating Systems, Oct. 1996.
D. J. Scales and M. S. Lam. The design and evaluation of a shared object system for distributed memory machines. In Proceedings of the First USENIX Symposium on Operating System Design and Implementation, pages 101–114, Nov. 1994.
J. Singh, W.-D. Weber, and A. Gupta. SPLASH: Stanford parallel applications for shared-memory. Computer Architecture News, 20(1):2–12, Mar. 1992.
R. Thomas. A data ow computer with improved asymptotic performance. Technical Report TR-265, MIT Laboratory for Computer Science, 1981.
P. Watson and I. Watson. An efficient garbage collection scheme for parallel computer architectures. In PARLE’87 Parallel Architectures and Languages Europe, number 259 in Lecture Notes in Computer Science, Eindhoven (the Netherlands), June 1987. Springer-Verlag.
S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. The SPLASH-2 programs: characterization and methodological considerations. In Proceedings of the 22nd Annual International Symposium on Computer Architecture, pages 24–36, June 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, Y.C., Yu, W., Cox, A.L., Wallach, D.S., Zwaenepoel, W. (2000). Run-Time Support for Distributed Sharing in Typed Languages. In: Dwarkadas, S. (eds) Languages, Compilers, and Run-Time Systems for Scalable Computers. LCR 2000. Lecture Notes in Computer Science, vol 1915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40889-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-40889-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41185-7
Online ISBN: 978-3-540-40889-5
eBook Packages: Springer Book Archive