Sciweavers

292 search results - page 22 / 59
» Adaptive scheduling with parallelism feedback
Sort
View
ICS
2007
Tsinghua U.
14 years 4 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
COORDINATION
2006
Springer
14 years 1 months ago
Evolution On-the-Fly with Paradigm
The coordination language Paradigm allows for a flexible and orthogonal modeling of interprocess relationships at the architectural level. It is shown how dynamic system adaptation...
Luuk Groenewegen, Erik P. de Vink
ICPP
1999
IEEE
14 years 2 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
CGO
2003
IEEE
14 years 3 months ago
Improving Quasi-Dynamic Schedules through Region Slip
Modern processors perform dynamic scheduling to achieve better utilization of execution resources. A schedule created at run-time is often better than one created at compile-time ...
Francesco Spadini, Brian Fahs, Sanjay J. Patel, St...
GCA
2008
13 years 11 months ago
A Grid Resource Broker with Dynamic Loading Prediction Scheduling Algorithm in Grid Computing Environment
In a Grid Computing environment, there are various important issues, including information security, resource management, routing, fault tolerance, and so on. Among these issues, ...
Yi-Lun Pan, Chang-Hsing Wu, Weicheng Huang