Distributed dynamic processor allocation for multicomputers

Rose, César A. F. De; Heiß, Hans-Ulrich; Linnert, Barry

doi:10.1016/j.parco.2006.11.010

Cited by 16 publications

(10 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The task of the PA [30] is processor allocation [6], [19], [29] that selects a set of PEs required for a given job. Efficient processor allocation should be characterized by: 1) High utilization: Processor allocation must provide maximal resource utilization, 2) Low Overhead: Allocation techniques must be fast and deliver low overhead, 3) Scalability: Algorithms must support systems with thousands of nodes without any bottleneck, 4) Recognition completeness: ability to find free subgrids for incoming jobs, if such a free subgrid exists.…”

Section: Introductionmentioning

confidence: 99%

Evaluation Scheme for NoC-based CMP with Integrated Processor Management System

Zydek¹,

Selvaraj²,

Koszalka³

et al. 2010

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

Evaluation Scheme for NoC-based CMP with Integrated Processor Management SystemWith the opportunities and benefits offered by Chip Multiprocessors (CMPs), there are many challenges that need to be addressed in order to exploit the full potential of CMPs. Such aspects as parallel programs, interconnection design, cache arrangement and on-chip cores allocation become a limiting factor. To ensure validity of approaches and research, we propose an evaluation system for CMPs with Network-on-Chip (NoC) and processor management system integrated on one die. The suggested experimentation system is described in details. The proposed system that is used for tests and results of the experiments are presented and discussed. As decision making criteria, we consider energy efficiency of Processor Allocator (PA) and NoC, as well as NoC traffic characteristic (load balance). In order to improve the system understanding, brief overview on most important NoC and PA architectures is also presented. Analyzed results reveal that CMP with a PA controlled by IFF allocation algorithm for mesh systems and torus-based NoC driven by DORLB routing with express-virtual-channel flow control achieved the best traffic balance and energy characteristic.

show abstract

Section: Introductionmentioning

confidence: 99%

Evaluation Scheme for NoC-based CMP with Integrated Processor Management System

Zydek¹,

Selvaraj²,

Koszalka³

et al. 2010

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

show abstract

“…The related studies include the plant allocation problem [15] for allocating a fixed number of products across plants to minimize the total cost; resource allocation in a presidential campaign, which consists of instrumental resource (advertising funds and candidate appearances) and ornamental resources (state-level organizational funds and personnel); processor allocation or job shop scheduling [9] for allocating time for work orders on different types of production equipment to minimize the delivery time; application of test resources [8] for optimizing in the process of missile test to improve test speed; personnel allocation problem [1] for allocating personnel among branches of a large-scale commercial bank; health care problem [5] for scheduling tasks and balancing nurses' workload in a home health care; and project management problems [7,16] for optimizing the manpower deployment and usage.…”

Section: Literature Reviewmentioning

confidence: 99%

Resource allocation embedded line balancing problem and ant colony optimization method

Yang

Wang

2011

Journal of the Chinese Institute of Industrial Engineers

View full text Add to dashboard Cite

This article introduces a resource allocation embedded assembly line balancing problem (RAELBP), whose solution construction involves operations of operator selection/assignment and task sequencing/ grouping. The mathematical model of the RAELBP is rigorously defined. In addition, an ant colony optimization (ACO) method, resource allocation first ACO method, is developed for the problem. An artificial ant selects and assigns an operator to each workstation first and then sequentially assigns assembly tasks to each workstation subject to precedence constraints. Alternatives and options relating to the objective function and heuristic value evaluations are provided. A data generator is developed to generate benchmarks for the problem. A software application, RAELBP Solver, implementing the proposed methods is developed for numerical tests. Numerical tests are conducted for different computation modes on three benchmarks of various sizes. Results indicate that the proposed method is capable of solving the problem and achievements in obtaining non-dominated solutions are varied in different modes.

show abstract

“…The characteristics of jobs and their arrival process are determined using synthetic workload models that were used in previous research efforts [6,7,11,15,17,19,23,24,27]. The main performance ( I.…”

Section: Simulationmentioning

confidence: 99%

“…Many processor allocation policies proposed in the literature for mesh-connected multicomputers use contiguous submesh allocation [1,3,7,19], where a parallel job is assigned a distinct contiguous submesh of processors for the duration of its execution [11,12,17]. This can result in high external processor fragmentation as free processors may not be allocated to a parallel job because they do not satisfy the contiguity constraint.…”

Section: Introductionmentioning

confidence: 99%

All shapes contiguous submesh allocation for 2D mesh multicomputers

Ababneh

Bani-Mohammad

Ould‐Khaoua

2010

International Journal of Parallel, Emergent and Distributed Sys

View full text Add to dashboard Cite

Although contiguous allocation is known to suffer from high processor fragmentation, it is a viable allocation approach as it isolates jobs from one another, which can improve system security. Most recent contiguous allocation schemes proposed for two-dimensional meshes switch the orientation of allocation requests when allocation fails for the initial request orientation. This transformation was found to reduce processor fragmentation and improve system performance. In this paper, we propose to generalise this restricted transformation by permitting all request shapes. Using simulations, we show that this generalisation when combined with giving priority to allocating peripheral submeshes can result in significant system performance gains.

show abstract

Distributed dynamic processor allocation for multicomputers

Cited by 16 publications

References 13 publications

Evaluation Scheme for NoC-based CMP with Integrated Processor Management System

Evaluation Scheme for NoC-based CMP with Integrated Processor Management System

Resource allocation embedded line balancing problem and ant colony optimization method

All shapes contiguous submesh allocation for 2D mesh multicomputers

Contact Info

Product

Resources

About