36 search results - page 4 / 8 » Terascale I O Solutions |
100
click to vote
ICPP
1999
IEEE
1999
IEEE
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
15 years 2 months ago
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
ICS
2000
Tsinghua U.
15 years 1 months ago
2000
Tsinghua U.
Scheduling of processes onto processors of a parallel machine has always been an important and challenging area of research. The issue becomes even more crucial and di cult as we ...
ASPDAC
2000
ACM
15 years 2 months ago
2000
ACM
Multilevel Fiduccia-Mattheyses MLFM hypergraph partitioning 3, 22, 24 is a fundamental optimization in VLSI CAD physical design. The leading implementation, hMetis 23 , has sinc...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...