Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems
IEEE Transactions on Software Engineering
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control
IEEE Transactions on Computers
Good Processor Management = Fast Allocation + Efficient Scheduling
ICPP '97 Proceedings of the international Conference on Parallel Processing
Efficient Processor Allocation Scheme for Multi Dimensional Interconnection Networks
ICPP '97 Proceedings of the international Conference on Parallel Processing
Largest-job-first-scan-all scheduling policy for 2D mesh-connected systems
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Finding Maximal Submeshes in Faulty 2D Mesh in the Presence of Failed Nodes
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
An efficient submesh allocation scheme for 3D torus multicomputer systems
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
| Hi-index | 0.00 |
Abstract: Efficient allocation of proper size submeshes to incoming tasks in two-dimensional (2D) mesh-connected processors is very important for achieving the desired high performance. It also needs to guarantee the recognition of the free submeshes with minimum overhead. In this paper we present an efficient task allocation scheme for 2D meshes. By employing a new approach for searching the array, our scheme can find the available submesh without the scanning of the entire 2D array unlike earlier designs. As a result, our scheme can significantly reduce the task allocation time. Comprehensive computer simulation reveals that the average allocation time and waiting delay are much smaller than earlier schemes irrespective of the size of meshes. The hardware overhead is comparable to other schemes.