The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Di antara beberapa topologi berbilang pemproses, topologi mesh dua dimensi (2D) telah menjadi popular kerana kesederhanaan dan kecekapannya. Walaupun beberapa penjadualan dan skim peruntukan pemproses untuk jejaring 2D telah dicadangkan dalam literatur, sedikit kajian telah dilakukan bertujuan untuk persekitaran masa nyata. Dalam kertas kerja ini, kami mencadangkan penjadualan dalam talian dan skim peruntukan untuk tugas masa nyata yang memerlukan penggunaan eksklusif submeshes dalam sistem mesh 2D. Dengan memanipulasi maklumat mengenai submesh yang diperuntukkan atau ditempah secara berkesan, skim yang dicadangkan boleh mengenal pasti masa terawal yang tersedia bagi submesh percuma untuk tugasan yang baru tiba. Kami menggunakan pendekatan preemption terhad untuk mengurangkan kerumitan carian untuk jadual yang boleh dilaksanakan. Simulasi komputer mendedahkan bahawa skim yang dicadangkan membenarkan daya pemprosesan yang tinggi dengan mengurangkan bilangan tugas yang ditolak.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Seong-Moo YOO, Hee Yong YOUN, Hyunseung CHOO, "Dynamic Scheduling and Allocation in Two-Dimensional Mesh-Connected Multicomputers for Real-Time Tasks" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 5, pp. 613-622, May 2001, doi: .
Abstract: Among several multiprocessor topologies, two-dimensional (2D) mesh topology has become popular due to its simplicity and efficiency. Even though a number of scheduling and processor allocation schemes for 2D meshes have been proposed in the literature, little study has been done aimed for real-time environment. In this paper, we propose an on-line scheduling and allocation scheme for real-time tasks that require the exclusive use of submeshes in 2D mesh system. By effectively manipulating the information on allocated or reserved submeshes, the proposed scheme can quickly identify the earliest available time of a free submesh for a newly arrived task. We employ a limited preemption approach to reduce the complexity of the search for a feasible schedule. Computer simulation reveals that the proposed scheme allows high throughput by decreasing the number of tasks rejected.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_5_613/_p
Salinan
@ARTICLE{e84-d_5_613,
author={Seong-Moo YOO, Hee Yong YOUN, Hyunseung CHOO, },
journal={IEICE TRANSACTIONS on Information},
title={Dynamic Scheduling and Allocation in Two-Dimensional Mesh-Connected Multicomputers for Real-Time Tasks},
year={2001},
volume={E84-D},
number={5},
pages={613-622},
abstract={Among several multiprocessor topologies, two-dimensional (2D) mesh topology has become popular due to its simplicity and efficiency. Even though a number of scheduling and processor allocation schemes for 2D meshes have been proposed in the literature, little study has been done aimed for real-time environment. In this paper, we propose an on-line scheduling and allocation scheme for real-time tasks that require the exclusive use of submeshes in 2D mesh system. By effectively manipulating the information on allocated or reserved submeshes, the proposed scheme can quickly identify the earliest available time of a free submesh for a newly arrived task. We employ a limited preemption approach to reduce the complexity of the search for a feasible schedule. Computer simulation reveals that the proposed scheme allows high throughput by decreasing the number of tasks rejected.},
keywords={},
doi={},
ISSN={},
month={May},}
Salinan
TY - JOUR
TI - Dynamic Scheduling and Allocation in Two-Dimensional Mesh-Connected Multicomputers for Real-Time Tasks
T2 - IEICE TRANSACTIONS on Information
SP - 613
EP - 622
AU - Seong-Moo YOO
AU - Hee Yong YOUN
AU - Hyunseung CHOO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2001
AB - Among several multiprocessor topologies, two-dimensional (2D) mesh topology has become popular due to its simplicity and efficiency. Even though a number of scheduling and processor allocation schemes for 2D meshes have been proposed in the literature, little study has been done aimed for real-time environment. In this paper, we propose an on-line scheduling and allocation scheme for real-time tasks that require the exclusive use of submeshes in 2D mesh system. By effectively manipulating the information on allocated or reserved submeshes, the proposed scheme can quickly identify the earliest available time of a free submesh for a newly arrived task. We employ a limited preemption approach to reduce the complexity of the search for a feasible schedule. Computer simulation reveals that the proposed scheme allows high throughput by decreasing the number of tasks rejected.
ER -