|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
October 1984 (vol. 33 no. 10)
pp. 895-905
| ASCII Text | x | ||
| 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. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1984.1676350, author = {D.L. Tuomenoksa and H.J. Siegel}, title = {Task Preloading Schemes for Reconfigurable Parallel Processing Systems}, journal ={IEEE Transactions on Computers}, volume = {33}, number = {10}, issn = {0018-9340}, year = {1984}, pages = {895-905}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676350}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Task Preloading Schemes for Reconfigurable Parallel Processing Systems IS - 10 SN - 0018-9340 SP895 EP905 EPD - 895-905 A1 - D.L. Tuomenoksa, A1 - H.J. Siegel, PY - 1984 KW - scheduling KW - Distributed processing KW - memory management KW - multimicroprocessor systems KW - multiple-SIMD machines KW - parallel processing KW - PASM KW - performance evaluation KW - reconfigurable computer systems VL - 33 JA - IEEE Transactions on Computers ER - | |||
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, Oct. 1984, doi:10.1109/TC.1984.1676350
Usage of this product signifies your acceptance of the Terms of Use.

