Sciweavers

206 search results - page 23 / 42
» Parallel Job Scheduling with Overhead: A Benchmark Study
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
Efficient Runtime Thread Management for the Nano-Threads Programming Model
Abstract. The nano-threads programming model was proposed to effectively integrate multiprogramming on shared-memory multiprocessors, with the exploitation of fine-grain parallelis...
Dimitrios S. Nikolopoulos, Eleftherios D. Polychro...
MFCS
2004
Springer
14 years 29 days ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa
MICRO
1996
IEEE
81views Hardware» more  MICRO 1996»
13 years 11 months ago
Instruction Scheduling and Executable Editing
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...
Eric Schnarr, James R. Larus
ESWA
2008
162views more  ESWA 2008»
13 years 7 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
JSSPP
1995
Springer
13 years 11 months ago
The ANL/IBM SP Scheduling System
During the past ve years scientists discovered that modern UNIX workstations connected with ethernet and ber networks could provide enough computational performance to compete wit...
David A. Lifka