Abstraction and Modularity Mechanisms for Concurrent Computing

Abstraction and Modularity Mechanisms for Concurrent Computing (1993)

Cached

Download Links

by Gul Agha , Svend Frølund , Wooyoung Kim , Rajendra Panwar , Anna Patterson , Daniel Sturman

Venue:	IEEE Parallel and Distributed Technology: Systems and Applications
Citations:	67 - 22 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Abstraction and Modularity Mechanisms for Concurrent Computing	user correction - Legacy Corrections
AUTHOR NAME	Gul Agha	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science	user correction - Legacy Corrections
AUTHOR ADDR	1304 W. Springfield Avenue	user correction - Legacy Corrections
AUTHOR NAME	Svend Frølund	user correction - Legacy Corrections
AUTHOR NAME	Wooyoung Kim	user correction - Legacy Corrections
AUTHOR ADDR	Urbana, IL 61801, USA	user correction - Legacy Corrections
AUTHOR NAME	Rajendra Panwar	user correction - Legacy Corrections
AUTHOR NAME	Anna Patterson	user correction - Legacy Corrections
AUTHOR NAME	Daniel Sturman	user correction - Legacy Corrections
AUTHOR AFFIL	University of Illinois at Urbana-Champaign	user correction - Legacy Corrections
AUTHOR ADDR	Urbana, IL 61801, USA	user correction - Legacy Corrections
ABSTRACT	ion and Modularity Mechanisms for Concurrent Computing Gul Agha, Svend Frølund, WooYoung Kim, Rajendra Panwar, Anna Patterson, and Daniel Sturman Department of Computer Science 1304 W. Springfield Avenue University of Illinois at Urbana-Champaign Urbana, IL 61801, USA Email: !agha---frolund---wooyoung---raju---annap---sturman?@cs.uiuc.edu 1 Introduction The transition from sequential to parallel and distributed computing has been widely accepted as a major paradigm shift occurring in Computer Science. It has been observed that the sequential programming model is inadequate for parallel and distributed computing. At a conceptual level, one can compare the fundamental intuition between sequential and concurrent computing as follows: ffl The sequential programming model essentially defines a computation as a sequence of instructions which manipulate a global store. The standard abstraction mechanism for sequential programs is procedures. Procedures glue a sequence of instructions; they a...	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	IEEE Parallel and Distributed Technology: Systems and Applications	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	3--21	INFERENCE
VOLUME	1	INFERENCE
CITATIONS	13 found	ParsCit 1.0