109 search results - page 16 / 22 » Convex programming for scheduling unrelated parallel machine... |
101
click to vote
FSTTCS
2007
Springer
15 years 7 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
120
click to vote
ICS
2001
Tsinghua U.
15 years 5 months ago
2001
Tsinghua U.
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
ICPP
1999
IEEE
15 years 5 months ago
1999
IEEE
Most of today's multiprocessors have a DistributedShared Memory (DSM) organization, which enables scalability while retaining the convenience of the shared-memory programming...
123
click to vote
MICRO
1996
IEEE
15 years 5 months ago
1996
IEEE
Modern microprocessors offer more instruction-level parallelism than most programs and compilers can currently exploit. The resulting disparity between a machine's peak and a...
111
click to vote
FPCA
1995
15 years 4 months ago
1995
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...