The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1984 vol.33)
pp: 895-905
D.L. Tuomenoksa , Integrated Systems Laboratory, AT&T Information Systems
ABSTRACT
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.
INDEX TERMS
scheduling, Distributed processing, memory management, multimicroprocessor systems, multiple-SIMD machines, parallel processing, PASM, performance evaluation, reconfigurable computer systems
CITATION
D.L. Tuomenoksa, H.J. Siegel, "Task Preloading Schemes for Reconfigurable Parallel Processing Systems", IEEE Transactions on Computers, vol.33, no. 10, pp. 895-905, October 1984, doi:10.1109/TC.1984.1676350
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool