MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  y

Download:
Download as a PDF | Download as a PS
by Ronald A. Olsson, Gregory D. Benson, Tingjian Ge, Aaron W. Keen
http://www.cs.ucdavis.edu/~olsson/pubs/2002/cl_fairness.ps
Add To MetaCart

Abstract:

Invocation servicing is an important aspect of many concurrent programming languages. Some invocation handling mechanisms allow for multiway servicing by multiple processes. This paper addresses fairness with respect to choosing which invocation to service and fairness with respect to choosing which process to perform the servicing. It examines how these fairness issues have been resolved in the SR concurrent programming language. This paper presents a new approach that eliminates several key restrictions. The new approach has been implemented in JR, an extended Java that includes SR-like synchronization mechanisms. This paper discusses design and implementation issues and tradeos.

Citations

2704 Communicating Sequential Processes – Hoare - 1985
720 Generative communication in Linda – Gelernter - 1985
115 Concurrent Programming: Principles and Practice – Andrews - 1991
78 An overview of the SR language and implementation – Andrews, Olsson, et al. - 1988
28 The Concurrent C Programming Language – Gehani, Roome - 1989
24 Concurrent Programming: the Java Programming Language – Hartley - 1998
22 The SR Programming Language: Concurrency in Practice. The Benjamin/Cummings Publishing Co – Andrews, Olsson - 1993
14 Portable multithreading - the signal stack trick for user-space thread creation – Engelschall - 2000
13 Communicating java threads – Hilderink, Broenink, et al. - 1997
11 JR: Flexible distributed programming in an extended Java – Keen, Ge, et al. - 2004
7 Transformations for optimizing interprocess communication and synchronization mechanisms – McNamee, Olsson - 1990
6 Strom et al. Hermes: A Language for Distributed Computing – E - 1991
4 Programming in Limbo – Dorward, Pike - 1997
4 Distributed languages design: Constructs for controlling preferences – Elrad, Maymir-Ducharme - 1986
4 A comparison of concurrent programming and cooperative multithreading. Concurrency and Computation: Practice and Experience – Keen, Ishihara, et al. - 2003
3 Programming in Occam – Burns - 1988
3 Inter-Entry Selection: Non-Determinism and Explicit Control Mechanisms – Olsson, McNamee - 1992
3 An attribute grammar approach to compiler optimization of intramodule interprocess communication. Submitted for publication. (An earlier version appears as CSE-8911 – McNamee, Olsson - 1989
2 Satisfying emergency communication requirements with dynamic preference control – Elrad, Maymir-Ducharme
2 Inter-entry selection control mechanisms: Implementation and evaluation – McNamee, Crow - 1996
1 Gnu Pth. http:// www.gnu. org/ software/pth – Engelschall - 2001
1 Release Notes for Version 2.2 – Townsend - 1993