206 search results - page 34 / 42 » Better Bounds for Online Scheduling |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
RSP
1999
IEEE
13 years 11 months ago
1999
IEEE
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are stil...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
MSS
2007
IEEE
14 years 1 months ago
2007
IEEE
The volume of online data content has shown an un precedented growth in recent years. Fueling this growth are new federal regulations which warrant longer data re tention and ...
ISPA
2007
Springer
2007
Springer
A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers
14 years 1 months ago
The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contigu...