Sciweavers

554 search results - page 83 / 111
» Approximability of OFDMA Scheduling
Sort
View
ISPAN
2005
IEEE
15 years 3 months ago
A Scalable Method for Predicting Network Performance in Heterogeneous Clusters
An important requirement for the effective scheduling of parallel applications on large heterogeneous clusters is a current view of system resource availability. Maintaining such ...
Dimitrios Katramatos, Steve J. Chapin
HPCC
2005
Springer
15 years 3 months ago
A Threshold-Based Matching Algorithm for Photonic Clos Network Switches
This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-spe...
Ding-Jyh Tsaur, Chi-Feng Tang, Chin-Chi Wu, Woei L...
SPAA
2003
ACM
15 years 2 months ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu
74
Voted
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 2 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
RTSS
2002
IEEE
15 years 2 months ago
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements
In addition to real-time requirements, the program code size is a critical design factor for real-time embedded systems. To take advantage of the code size vs. execution time trad...
Insik Shin, Insup Lee, Sang Lyul Min