Sciweavers

1095 search results - page 39 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
120
Voted
CLUSTER
2005
IEEE
15 years 9 months ago
Search-based Job Scheduling for Parallel Computer Workloads
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
Sangsuree Vasupongayya, Su-Hui Chiang, B. Massey
142
Voted
CCGRID
2008
IEEE
15 years 6 months ago
A Decentralized and Cooperative Workflow Scheduling Algorithm
In the current approaches to workflow scheduling, there is no cooperation between the distributed workflow brokers and as a result, the problem of conflicting schedules occur. To o...
Rajiv Ranjan, Mustafizur Rahman 0003, Rajkumar Buy...
142
Voted
CORR
2006
Springer
112views Education» more  CORR 2006»
15 years 4 months ago
Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items
Broadcasting is known to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks,...). It has been recently ob...
Julien Robert, Nicolas Schabanel
138
Voted
ICCAD
2006
IEEE
101views Hardware» more  ICCAD 2006»
16 years 26 days ago
Guaranteeing performance yield in high-level synthesis
Meeting timing constraint is one of the most important issues for modern design automation tools. This situation is exacerbated with the existence of process variation. Current hi...
Wei-Lun Hung, Xiaoxia Wu, Yuan Xie
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
15 years 10 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...