Sciweavers

608 search results - page 25 / 122
» Time Space Sharing Scheduling and Architectural Support
Sort
View
SIGCOMM
1996
ACM
13 years 11 months ago
Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
Pawan Goyal, Harrick M. Vin, Haichen Cheng
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 1 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
GRID
2004
Springer
14 years 1 months ago
Hybrid Preemptive Scheduling of MPI Applications on the Grids
— Time sharing between all the users of a Grid is a major issue in cluster and Grid integration. Classical Grid architecture involves a higher level scheduler which submits non o...
Aurelien Bouteiller, Hinde-Lilia Bouziane, Thomas ...
ECRTS
2004
IEEE
13 years 11 months ago
Multiprocessor Energy-Efficient Scheduling with Task Migration Considerations
This paper targets energy-efficient scheduling of tasks over multiple processors, where tasks share a common deadline. Distinct from many research results on heuristics-based ener...
Jian-Jia Chen, Heng-Ruey Hsu, Kai-Hsiang Chuang, C...
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
13 years 12 months ago
Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
Nicola Nicolici, Bashir M. Al-Hashimi