Fairness in shared invocation servicing

Authors:
Ronald A. Olsson;Gregory D. Benson;Tingjian Ge;Aaron W. Keen
Affiliations:
Department of Computer Science, University of California, Davis, CA 95616-8562, USA;Department of Computer Science, University of San Francisco, San Francisco, CA 94117, USA;Department of Computer Science, University of California, Davis, CA 95616-8562, USA;Department of Computer Science, California Polytechnic State University, San Luis Obispo, CA 93407, USA
Venue:
Computer Languages, Systems and Structures
Year:
2002

Citing 9
Cited 1

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
An overview of the SR language and implementation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Transformations for optimizing interprocess communication and synchronization mechanisms

International Journal of Parallel Programming
Communicating sequential processes

Communications of the ACM
Programming in Limbo

COMPCON '97 Proceedings of the 42nd IEEE International Computer Conference
JR: Flexible Distributed Programming in an Extended Java

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Portable multithreading: the signal stack trick for user-space thread creation

ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Inter-entry selection control mechanisms: Implementation and evaluation

Computer Languages
Inter-entry selection: Non-determinism and explicit control mechanisms

Computer Languages

JR: Flexible distributed programming in an extended Java

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

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 tradeoffs.