Sciweavers

1095 search results - page 117 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ISCAS
2003
IEEE
104views Hardware» more  ISCAS 2003»
15 years 3 months ago
Real-time scheduling on scalable media stream delivery
Scalable streams provide a layered representation for transmitting media contents over a channel with packet losses and variable delay. In general, real-time streaming scalable me...
Kui Gao, Wen Gao, Simin He, Peng Gao, Yuan Zhang
CIKM
2009
Springer
15 years 4 months ago
Packing the most onto your cloud
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
Ashraf Aboulnaga, Ziyu Wang, Zi Ye Zhang
DCOSS
2006
Springer
15 years 1 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
GLVLSI
2009
IEEE
126views VLSI» more  GLVLSI 2009»
15 years 1 months ago
An efficient cut enumeration for depth-optimum technology mapping for LUT-based FPGAs
Recent technology mappers for LUT based FPGAs employ cut enumeration. Although many cuts are often needed to nd good network, enumerating all cuts with large size consumes run-tim...
Taiga Takata, Yusuke Matsunaga
FCCM
2009
IEEE
134views VLSI» more  FCCM 2009»
15 years 1 months ago
Efficient Mapping of Hardware Tasks on Reconfigurable Computers Using Libraries of Architecture Variants
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
Miaoqing Huang, Vikram K. Narayana, Tarek A. El-Gh...