By Topic

Assignment of ADT modules to processors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Welch, L.R. ; Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA

The utilization of reusable software components can help to reduce the complexity of developing and maintaining parallel programs, but can lead to inefficiencies. The potential inefficiencies are addressed by providing a model of parallel execution (asynchronous remote procedure call, or ARPC) that not only speeds up programs, but also encourages the development of layered software by increasing parallelism in correspondence to increases in layering. The paper presents an efficient algorithm for assigning the reusable modules of a program to the processing elements of a parallel computer that supports ARPC. The objectives of the assignment algorithm are to permit maximum inter-module parallelism with the fewest possible PEs, and to prevent deadlock. The algorithm differs from previous solutions to the assignment problem in that the modules to be assigned are generic abstract data type modules, not procedures, tasks, or processes

Published in:

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Date of Conference:

23-26 Mar 1992