Sciweavers

189 search results - page 10 / 38
» Scheduling Issues in Optimistic Parallelization
Sort
View
MST
2000
57views more  MST 2000»
14 years 9 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
CGO
2003
IEEE
15 years 2 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
14 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
CCGRID
2006
IEEE
15 years 3 months ago
How the JSDL can Exploit the Parallelism?
The description of the jobs is a very important issue for the scheduling and management of Grid jobs. Since there are a lot of different languages for describing Grid jobs, the GG...
Ivan Rodero, Francesc Guim, Julita Corbalán...
HPCA
2007
IEEE
15 years 10 months ago
A Scalable, Non-blocking Approach to Transactional Memory
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, pr...
Hassan Chafi, Jared Casper, Brian D. Carlstrom, Au...