ACM Home Page
Please provide us with feedback. Feedback
Supporting dynamic parallel object arrays
Full text PdfPdf (634 KB)
Source Java Grande Conference archive
Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande table of contents
Palo Alto, California, United States
Pages: 21 - 28  
Year of Publication: 2001
ISBN:1-58113-359-6
Authors
Orion S. Lawlor  Univ. of Illinois at Urbana-Champaign, 1304 W. Springfield, 3315 DCL, Urbana, IL
Laxmikant V. Kalé  Univ. of Illinois at Urbana-Champaign, 1304 W. Springfield, 3315 DCL, Urbana, IL
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/376656.376804
What is a DOI?

ABSTRACT

We present efficient support for generalized arrays of parallel data driven objects. The “array elements” are scattered across a parallel machine. Each array element is an object that can be thought of as a virtual processor. The individual elements are addressed by their “index”, which can be an arbitrary object rather than a simple integer. For example, it can be a series of numbers, supporting multidimensional sparse arrays; a bit vector, supporting collections of quadtree nodes; or a string. Messages can be sent to any individual array element from any processor, and the elements can participate in reductions and broadcasts. Individual elements can be created or deleted dynamically at any time. Most importantly, the elements can migrate from processor to processor at any time. The paper discusses support for message delivery and collective operations in face of such dynamic behavior. The migration capabilities of array elements have proven extremely useful, for example, in implementing flexible load balancing strategies and for exploiting workstation clusters adaptively.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L.V. Kal6 and S. Krishnan. "Charm++: Parallel Programming with Message-Driven Objects", Gregory V. Wilson and Paul Lu, editors, Parallel Programming using C++, pages 175-213. MIT Press, 1996
 
2
 
3
S. Krishnan and L.V. Kalr. "A parallel array abstraction for data-driven objects", Proc. Parallel Object-Oriented Methods and Applications Conference, February 1996
 
4
L.V. Kal6 and others. Charm++ Programmer's Manual, http : //charm. cs. uiuc. edu/, 2000
 
5
L. V. Kalr, S. Kumar, J. DeSouza. An Adaptive Job Scheduler for Timeshared Parallel Machines, PPL Technical Report 00-02, University of Illinois at Urbana- Champaign, Sept. 2000
 
6
M. Bhandarkar, L.V. Kal6, E. Sturler, J. Hoeflinger. Object-Based Adaptive Load Balancing for MPI Programs, PPL Technical report 00-03, University of Illinois at Urbana-Champaign, Sept. 2000
 
7
 
8
F. Bodin, P. Beckman, D. Gannon, and others. "Distributed pC++: Basic Ideas for an Object Parallel Language", Scientific Programming, Volume 2/Number 3 Fall 1993
9
 
10
H. Bal, R. Bhoedjang, R. Hofman, and others. Orca: a Portable User-Level Shared Object System, Technical Report IR-408, Vrije Universiteit, Amsterdam, June 1996
 
11
 
12
 
13
S. Atlas, S. Banerjee, J. C. Cummings, and others (presented by J. Reynders). "POOMA: A high performance distributed simulation environment for scientific applications," Supercomputing 1995, Nov. 1995
 
14
M. Lemke, D. Quinlan. "P++, a Parallel C++ Array Class Library for Architecture-Independent Development of Structured Grid Applications", ACM SIGPLAN Workshop 1992. pp 21-23
15


Collaborative Colleagues:
Orion S. Lawlor: colleagues
Laxmikant V. Kalé: colleagues