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
여러 다중 프로세서 토폴로지 중에서 2차원(2D) 메시 토폴로지는 단순성과 효율성으로 인해 대중화되었습니다. 2D 메시에 대한 다수의 스케줄링 및 프로세서 할당 방식이 문헌에서 제안되었음에도 불구하고 실시간 환경을 목표로 한 연구는 거의 이루어지지 않았습니다. 본 논문에서는 XNUMX차원 메쉬 시스템에서 서브메쉬의 단독 사용이 필요한 실시간 작업을 위한 온라인 스케줄링 및 할당 방식을 제안한다. 제안된 방식은 할당되거나 예약된 서브메쉬에 대한 정보를 효과적으로 조작함으로써 새로 도착한 작업에 대해 사용 가능한 가장 빠른 여유 서브메쉬 시간을 신속하게 식별할 수 있습니다. 우리는 실행 가능한 일정에 대한 검색의 복잡성을 줄이기 위해 제한된 선점 접근 방식을 사용합니다. 컴퓨터 시뮬레이션에서는 제안된 방식이 거부된 작업 수를 줄여 높은 처리량을 허용한다는 것을 보여줍니다.
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.
부
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
부
@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},}
부
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 -