Task preloading schemes for reconfigurable parallel processing systems

Journal Article · Mon Oct 01 00:00:00 EDT 1984 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1984.1676350· OSTI ID:5108675

Tuomenoksa, D L; Siegel, H J

One class of reconfigurable parallel processing systems is based on the use of a large number of processing elements where each processing element consists of a processor and a primary memory. To efficiently employ the processing elements, it is desirable to overlap the operation of the secondary storage with computations being performed by the processors. Due to the dynamically reconfigurable architecture of such systems, the processors which will execute a new task may not be selected until they are ready to run the task. That is, a task must be preloaded prior to the final selection of the processors on which it will execute. Two schemes which allow for the secondary storage to preload input data and programs into the primary memories so that processor utilization can be increased and system response time decreased are presented. PASM is used as an example system for comparing the performance of the schemes by simulation studies. Results show that both methods are effective techniques. These schemes can be applied to reconfigurable parallel processing systems which use a centralized scheduling policy.

• Research Organization: ATandT Information Systems, Lincroft, NJ
• OSTI ID: 5108675
• Journal Information: IEEE Trans. Comput.; (United States), Vol. C-33:10
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
SUPERCOMPUTERS
DATA PROCESSING
PARALLEL PROCESSING
ARCHITECTURE
COMPUTER CODES
COMPUTERIZED SIMULATION
MEMORY DEVICES
PERFORMANCE
SCHEDULES
COMPUTERS
DIGITAL COMPUTERS
PROCESSING
PROGRAMMING
SIMULATION
990200* - Mathematics & Computers