40 search results - page 3 / 8 » From bounded to unbounded concurrency objects and back |
FCS
2008
13 years 6 months ago
2008
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
CONCURRENCY
1998
13 years 5 months ago
1998
We consider the problem of converting C pointers to the less flexible concept of references. Our main application is converting scientific applications from C to Java. We provid...
PLDI
1990
ACM
13 years 9 months ago
1990
ACM
Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a h...
RTCSA
2000
IEEE
13 years 8 months ago
2000
IEEE
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
DC
2008
13 years 5 months ago
2008
This paper introduces solo-valency, a variation on the valency proof technique originated by Fischer, Lynch, and Paterson. The new technique focuses on critical events that influe...