204 search results - page 32 / 41 » Provable algorithms for parallel generalized sweep schedulin... |
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
HPCN
1995
Springer
15 years 1 months ago
1995
Springer
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
PLDI
2005
ACM
15 years 3 months ago
2005
ACM
Modulo scheduling is an effective code generation technique that exploits the parallelism in program loops by overlapping iterations. One drawback of this optimization is that reg...
ASPLOS
1992
ACM
15 years 1 months ago
1992
ACM
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
PODC
2006
ACM
15 years 3 months ago
2006
ACM
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...