Allocation Time-Based Processor Allocation Scheme for 2D Mesh Architecture
نویسندگان
چکیده
Received March 26, 1999; revised July 5, 1999; accepted September 8, 1999. Communicated by Chyi-Nan Chen. *This research was supported in part by the Office of Naval Research under grants N00014-95-1-0514 and N0001496-1-0897, and in part by the Department of Defense/Air Force Office of Scientific Research under grant F49620-961-0472 JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 16, 301-311 (2000)
منابع مشابه
Efficient Processor Allocation Scheme with Task Embedding for Partitionable Mesh Architectures
For partitionable Mesh architectures, a modified QT (Quad Tree)-based processor allocation scheme (MQT) with two new task embedding heuristics is proposed. Existing processor allocation strategies assume any incoming request is also represented as a mesh. This paper introduces flexibility with which the requested task can be a linear array, a ring, or a mesh and still be allocated into a partit...
متن کاملDynamic Scheduling and Allocation in Two-Dimensional Mesh-Connected Multicomputers for Real-Time Tasks∗
Among several multiprocessor topologies, twodimensional (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 realtime environment. In this paper, we propose an on-line scheduling and allocation scheme for real-time ta...
متن کاملAn Eecient Dynamic Load Balancing Algorithm for Adaptive Mesh Reenement
In numerical algorithms based on adaptive mesh re nement, the computational workload changes during the execution of the algorithms. In mapping such algorithms on to distributed memory architectures, dynamic load balancing is necessary to balance the workload among the processors in order to obtain high performance. In this paper, we propose a dynamic processor allocation algorithm for a mesh a...
متن کاملProcessor Management Techniques for Mesh-Connected Multiprocessors
This paper investigates various processor management techniques for improving the performance of mesh-connected multiprocessors. Three diierent techniques are analyzed. First, we use the smallest job rst (SJF) policy to improve the spatial parallelism in a mesh. Next, a policy called multitasking and multi-programming (M 2) is introduced. The M 2 scheme allows multiprogramming of jobs on variou...
متن کاملAn E cient Processor Allocation Scheme for Mesh ConnectedParallel
Several processor allocation schemes are proposed in the literature for mesh connected parallel computers. All these schemes aim at improving the system performance by reducing internal fragmentation or by enhancing the submesh recognition ability. In this paper , we propose an approach of system partitioning to reduce external fragmentation and thereby improve the system performance. The targe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998