Filters








51 Hits in 5.7 sec

The design and implementation of distributed Smalltalk

John K. Bennett
1987 SIGPLAN notices  
The implementation includes an incremental distributed garbage collector and support for remote debugging, access control, and object mobility.  ...  Distributed Smalltalk (DS) is an implementation of Smalltalk that allows objects on di erent m a c hines to send and respond to messages.  ...  Acknowledgements Alan Borning, Edward Lazowska, and Henry Levy provided extensive reviews of early versions of this paper.  ... 
doi:10.1145/38807.38836 fatcat:gsgbf7j7gzadzjhdrlosrt6hiy

The design and implementation of distributed Smalltalk

John K. Bennett
1987 Conference proceedings on Object-oriented programming systems, languages and applications - OOPSLA '87  
The implementation includes an incremental distributed garbage collector and support for remote debugging, access control, and object mobility.  ...  Distributed Smalltalk (DS) is an implementation of Smalltalk that allows objects on di erent m a c hines to send and respond to messages.  ...  Acknowledgements Alan Borning, Edward Lazowska, and Henry Levy provided extensive reviews of early versions of this paper.  ... 
doi:10.1145/38765.38836 dblp:conf/oopsla/Bennett87 fatcat:rtfqcedbizbovbniposdua3kfa

Experience with the Super Monaco optimizing compiler

Evan Tick, Bart C. Massey, James S. Larson
1996 The Journal of Logic Programming  
There are currently two intermediate code translators: one for SGI MIPS-based hosts, and another for Sequent 80386-based multiprocessors.  ...  This paper discusses the compiler design and our experience building it. A cost/benefit analysis of the compiler optimizations is given, with a comparison to similar systems.  ...  It incorporates the lessons learned in the first design [35, 36] and improves upon its predecessor with better memory utilization (via a 2-bit tag scheme, the use of 32-bit words, and garbage collection  ... 
doi:10.1016/s0743-1066(96)00051-9 fatcat:ulc74dfle5dgdheu5to46n6sze

Transactional Sapphire

Tomoharu Ugawa, Carl G. Ritson, Richard E. Jones
2018 ACM Transactions on Programming Languages and Systems  
We fully evaluate, for the irst time, and using realistic benchmarks, Sapphire's performance and suitability as a low latency collector.  ...  We describe our experience of implementing the Sapphire algorithm as the irst on-the-ly, parallel, replication copying, garbage collector for the Jikes RVM Java virtual machine.  ...  Transactional Sapphire: ACKNOWLEDGMENTS We are grateful to Rick Hudson and the Intel Corporation for providing us with a license to implement the Sapphire algorithm in Jikes RVM, and permitting others  ... 
doi:10.1145/3226225 fatcat:4owlkf4n35f3xlwebvt47ye3le

The Wisconsin Wind Tunnel project

Mark D. Hill, James R. Larus, David A. Wood
1994 SIGARCH Computer Architecture News  
on-line.  ...  This document lists contributors to the Wisconsin Wind Tunnel Project, gives a brief description of the project, and presents references and abstracts to its principal papers, including how to obtain them  ...  Using Generational Garbage Collection to Implement Cache-Conscious Data Placement. In Proceedings of the International Symposium on Memory Management, pages 37-48, October 1998.  ... 
doi:10.1145/192537.192543 fatcat:rvtgkgeonnba3cdbociaiglrdq

The power 775 architecture at scale

Ramakrishnan Rajamony, Mark W. Stephenson, William Evan Speight
2013 Proceedings of the 27th international ACM conference on International conference on supercomputing - ICS '13  
At the heart of the Power 775's performance is the "hub module", which is a high-radix router containing fortyseven copper and optical links with a switching capacity of over 1.1 Tbyte/second.  ...  The system recently attained world record performance numbers for three important, communication-heavy supercomputing benchmarks: RandomAccess, PTRANS, and FFT 1 .  ...  and garbage collect copies of the sent data.  ... 
doi:10.1145/2464996.2465435 dblp:conf/ics/RajamonySS13 fatcat:u5gsr4lsvva2dhlyx4vo7tzikq

The Tale of Java Performance

Osvaldo Pinali Doederlein
2003 Journal of Object Technology  
with superb pervious art in interpreters, Just In Time compilers, Garbage Collectors, and more general items such as threading or multiplatform frameworks.  ...  Right now I'm working on a 1,6GHz Pentium-IV with 640Mb: coincidentally, an exact order of magnitude better in both speed and space (if we're not too picky about hardware performance factors).  ...  Under Java's dynamic classloading, bytecode, native code and JIT metadata may need to be produced (or garbage-collected) at any time.  ... 
doi:10.5381/jot.2003.2.5.c3 fatcat:nwgd4zsa2feinepz622opcfq4e

Persistent Threads

Florian Matthes, Joachim W. Schmidt
1994 Very Large Data Bases Conference  
We also describe the integration of persistent threads into a polymorphically-typed database language and its supporting layered system architecture with particular emphasis on abstractly-defined thread  ...  Persistent threads are a database programming concept particularly well-suited for a.pplications that manage long-term, distributed or cooperative activities.  ...  Only then reliable support can be provided for concurrency, recovery, or garbage collection.  ... 
dblp:conf/vldb/MatthesS94 fatcat:lbqajabk6zc6xbqjmrmtz7si5e

A comprehensive bibliography of distributed shared memory

M. Rasit Eskicioglu
1996 ACM SIGOPS Operating Systems Review  
Shared memory is an attractive programming model for designing parallel and distributed applications.  ...  This bibliography identifies the results of research on DSM and related topics.  ...  J. and Le Sergent, T. LEMMA: A Distributed Shared Memory with Global and Local Garbage Collection. In Proc. of the Int'l Workshop on Memory Management (IWMM'95), pages 297-311, September 1995.  ... 
doi:10.1145/218646.218651 fatcat:ildcgoxumvheharepblsrqm5ui

High performance Web site design techniques

A. Iyengar, J. Challenger, D. Dias, P. Dantzig
2000 IEEE Internet Computing  
The authors present new techniques they developed for keeping cached dynamic data current and synchronizing caches with underlying databases.  ...  This article presents techniques for designing Web sites that need to handle large request volumes and provide high availability.  ...  Each uniprocessor had 512 Mbytes of memory and approximately 18 Gbytes of disk space. Each multiprocessor had one Gbyte of memory and approximately six Gbytes of disk space.  ... 
doi:10.1109/4236.832942 fatcat:rh7pjiooujgwdhlypkelae6f7q

The Invention of Concurrent Programming [chapter]

Per Brinch Hansen
2001 The Origin of Concurrent Programming  
Tom Kilburn and David Howarth pioneered the use of interrupts to simulate concurrent execution of several programs on the Atlas computer (Kilburn 1961) .  ...  The author summarizes the classic papers and puts them in historical perspective.  ...  I thank the Association for Computing Machinery, the Institute of Electrical and Electronics Engineers, and Springer-Verlag for permission to include parts of my earlier essays:  ... 
doi:10.1007/978-1-4757-3472-0_1 fatcat:ngxptj4ch5dqpnte5jnrtruqty

A brief history of just-in-time

John Aycock
2003 ACM Computing Surveys  
We examine the motivation behind JIT compilation and constraints imposed on JIT compilation systems, and present a classification scheme for such systems.  ...  Software systems have been using "just-in-time" compilation (JIT) techniques since the 1960s.  ...  With respect to JIT compilation, more complicated input structures take more time and space for the user to produce and the toolkit to consume [Engler 1996 ].  ... 
doi:10.1145/857076.857077 fatcat:ityvm2vunbaorehgh4ak5hig2u

A Critique of the CAP Theorem [article]

Martin Kleppmann
2015 arXiv   pre-print
These problems cast doubt on the utility of CAP as a tool for reasoning about trade-offs in practical systems.  ...  consistency guarantees and tolerance of network faults.  ...  Acknowledgements Many thanks to Niklas Ekström, Seth Gilbert and Henry Robinson for fruitful discussions around this topic.  ... 
arXiv:1509.05393v2 fatcat:ghdu6fd355h4tormyvbf5krqcq

A retrospective on the Dorado, a high-performance personal computer

Kenneth A. Pier
1983 Proceedings of the 10th annual international symposium on Computer architecture - ISCA '83  
the Dorado and then provides a retrospective view and critique of the Dorado project as a whole.  ...  The paper concludes with some speculations on what the project might have done differently and what might be done differently today instead of in the late 1970s.  ...  Each member of the team should be commended for high professional standards and a spirit of cooperation vital to completing a project of this difficulty with a minimal size staff.  ... 
doi:10.1145/800046.801663 dblp:conf/isca/Pier83 fatcat:dznfc3ulqvdgzgw6fyjhe76elq

CompCertTSO

Jaroslav Ševčík, Viktor Vafeiadis, Francesco Zappa Nardelli, Suresh Jagannathan, Peter Sewell
2013 Journal of the ACM  
But it is a relatively simple semantics (compared with C/C++11, for example) and one that can be implemented fairly directly on x86, and also on Sparc (and on Power in 'strong access ordering' mode), without  ...  In this paper, we consider the semantic design and verified compilation of a C-like programming language for concurrent shared-memory computation on x86 multiprocessors.  ...  ACKNOWLEDGMENT We thank Xavier Leroy for enlightening discussions and comments on drafts, and for making CompCert available, and the anonymous reviewers for their helpful remarks.  ... 
doi:10.1145/2487241.2487248 fatcat:xg3dizzc6barvjs2kuktpw2qai
« Previous Showing results 1 — 15 out of 51 results