Sciweavers

7065 search results - page 182 / 1413
» Iterative Scheduling Algorithms
Sort
View
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
16 years 20 days ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He
DATE
2006
IEEE
120views Hardware» more  DATE 2006»
16 years 6 days ago
System-level scheduling on instruction cell based reconfigurable systems
This paper presents a new operation chaining reconfigurable scheduling algorithm (CRS) based on list scheduling that maximizes instruction level parallelism available in distribut...
Ying Yi, Ioannis Nousias, Mark Milward, Sami Khawa...
177
Voted
JVA
2006
IEEE
16 years 4 days ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
ECAI
1994
Springer
15 years 10 months ago
Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...
W. P. M. Nuijten, Emile H. L. Aarts
201
Voted
ENC
2004
IEEE
15 years 10 months ago
Comparison of Scheduling Heuristics for Grid Resource Broker
In this paper, we consider parallel tasks scheduling problems for hierarchical decentralized systems that consist of homogeneous computational resources such as clusters, PCs and ...
Sergey Zhuk, Andrey Chernykh, Arutyun Avetisyan, S...