scholarly journals The Maximum Resource Bin Packing Problem

2005 ◽  
pp. 397-408 ◽  
Author(s):  
Joan Boyar ◽  
Leah Epstein ◽  
Lene M. Favrholdt ◽  
Jens S. Kohrt ◽  
Kim S. Larsen ◽  
...  
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
Bin Packing Problem ◽  
Maximum Resource Bin Packing

scholarly journals The maximum resource bin packing problem

2006 ◽  
Vol 362 (1-3) ◽  
pp. 127-139 ◽  
Author(s):  
Joan Boyar ◽  
Leah Epstein ◽  
Lene M. Favrholdt ◽  
Jens S. Kohrt ◽  
Kim S. Larsen ◽  
...  
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
Bin Packing Problem ◽  
Maximum Resource Bin Packing

An improved heuristic and an exact algorithm for the 2D strip and bin packing problem

2010 ◽  
Vol 10 (1/2/3) ◽  
pp. 217 ◽  
Author(s):  
Abdelghani Bekrar ◽  
Imed Kacem ◽  
Chengbin Chu ◽  
Cherif Sadfi
Keyword(s):  
Bin Packing ◽  
Exact Algorithm ◽  
Packing Problem ◽  
Bin Packing Problem

EVALUATION OF TASK ALLOCATION IN MESH-BASED MULTICOMPUTERS USING GENETIC, NEURAL, AND TRADITIONAL ALGORITHMS

1994 ◽  
Vol 03 (01) ◽  
pp. 47-60
Author(s):  
R.A. McCONNELL ◽  
B.L. MENEZES
Keyword(s):  
Task Allocation ◽  
Bin Packing ◽  
Packing Problem ◽  
Allocation Problem ◽  
Hopfield Network ◽  
Processor Allocation ◽  
Classical Level ◽  
Bin Packing Problem ◽  
Residual Space ◽  
Computer Tasks

This article compares three techniques for allocating tasks in a mesh-based multi-computer. Tasks are expressed as rectangles of a certain width and height corresponding to the topology of processors desired. The task allocation problem, is thus a variant of the bin-packing problem, with one major difference: in the bin-packing problem one seeks to minimize the height of the bin, while here we seek to maximize the utilization of processors in a multicomputer. The three techniques compared are a classical level-by-level algorithm, a connectionist simulated annealing variant of the Hopfield network, and a genetic algorithm. An extension to the dynamic processor allocation problem is modeled by fixing some rectangles in place and packing the request rectangles in the residual space on the mesh; this corresponds to a pre-existing condition, i.e., some tasks have already been allocated to the Processor Mesh. Implementation and experimental results are presented.

Sign in / Sign up

Export Citation Format

Share Document