New mechanisms for invocation handling in concurrent programming languages11This research is supported in part by the National Science Foundation under Grant CCR-9527295

Authors:
M Chung;R.A Olsson
Affiliations:
Department of Computer Science, University of California, Davis, Davis, CA 95616-8562, USA;Department of Computer Science, University of California, Davis, Davis, CA 95616-8562, USA
Venue:
Computer Languages
Year:
1998

Citing 16
Cited 1

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
UNIX Ada programming

UNIX Ada programming
The multiway rendezvous

ACM Transactions on Programming Languages and Systems (TOPLAS)
A fair share scheduler

Communications of the ACM
A review of Ada tasking

A review of Ada tasking
An overview of the SR language and implementation

ACM Transactions on Programming Languages and Systems (TOPLAS)
The concurrent C programming language

The concurrent C programming language
Linda in context

Communications of the ACM
Using SR for discrete event simulation: a study in concurrent programming:

Software—Practice & Experience
Concurrent programming: principles and practice

Concurrent programming: principles and practice
Orca: A Language for Parallel Programming of Distributed Systems

IEEE Transactions on Software Engineering
The SR programming language: concurrency in practice

The SR programming language: concurrency in practice
Lottery scheduling: flexible proportional-share resource management

OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Inter-entry selection control mechanisms: Implementation and evaluation

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

Computer Languages
An SR approach to multiway rendezvous

Computer Languages

Concurrent programming language support for invocation handling: design and implementation

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Invocation handling mechanism in many concurrent languages have significant limitations that make it difficult or costly to solve common programming situations encountered in program visualization, debugging, and scheduling scenarios. This paper discusses these limitations, introduces new language mechanisms aimed at remedying these limitations, and presents an implementation of the new mechanisms. The examples are given in SR; the new mechanisms and implementation are an extension of SR and its implementation. However, these new mechanisms are applicable to other concurrent languages. They can augment or replace current invocation handling mechanisms.