Sciweavers

10106 search results - page 104 / 2022
» Algorithm Selection and Scheduling
Sort
View
109
Voted
DAC
1994
ACM
15 years 4 months ago
Performance Analysis and Optimization of Schedules for Conditional and Loop-Intensive Specifications
This paper presents a new method,based on Markov chain analysis, to evaluate the performance of schedules of behavioral specifications. The proposed performance measure is the expe...
Subhrajit Bhattacharya, Sujit Dey, Franc Brglez
112
Voted
CORR
2011
Springer
184views Education» more  CORR 2011»
14 years 4 months ago
Resource CoAllocation for Scheduling Tasks with Dependencies, in Grid
Scheduling applications on wide-area distributed systems is useful for obtaining quick and reliable results in an efficient manner. Optimized scheduling algorithms are fundamental...
Diana Moise, Eliza Moise, Florin Pop, Valentin Cri...
118
Voted
ICETET
2009
IEEE
15 years 7 months ago
Best Fit Void Filling Algorithm in Optical Burst Switching Networks
: Optical Burst Switching is a promising technology in Optical Network. Scheduling of data burst in data channels in an optimal way is one of a key problem in Optical Burst Switche...
M. Nandi, Ashok K. Turuk, D. K. Puthal, S. Dutta
69
Voted
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
15 years 4 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri
122
Voted
TCOM
2008
74views more  TCOM 2008»
15 years 14 days ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany