Sciweavers

628 search results - page 19 / 126
» Scheduling Algorithm with Potential Behaviors
Sort
View
CN
2006
99views more  CN 2006»
13 years 7 months ago
High-performance switching based on buffered crossbar fabrics
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
Lotfi Mhamdi, Mounir Hamdi, Christopher Kachris, S...
MFCS
2009
Springer
14 years 2 months ago
On the Structure of Optimal Greedy Computation (for Job Scheduling)
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...
Periklis A. Papakonstantinou
JPDC
2006
156views more  JPDC 2006»
13 years 7 months ago
Grid harvest service: A performance system of grid computing
Conventional performance evaluation mechanisms focus on dedicated systems. Grid computing infrastructure, on the other hand, is a shared collaborative environment constructed on v...
Ming Wu, Xian-He Sun
EDBT
2008
ACM
135views Database» more  EDBT 2008»
14 years 7 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
IEEEPACT
1998
IEEE
13 years 12 months ago
Adaptive Scheduling of Computations and Communications on Distributed Memory Systems
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
Mayez A. Al-Mouhamed, Homam Najjari