Sciweavers

397 search results - page 11 / 80
» Lifting of divisible designs
Sort
View
RTAS
2007
IEEE
14 years 3 months ago
Real-Time Divisible Load Scheduling for Cluster Computing
Cluster computing has emerged as a new paradigm for solving large-scale problems. To enhance QoS and provide performance guarantees in cluster computing environments, various real...
Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Godda...
VTC
2008
IEEE
107views Communications» more  VTC 2008»
14 years 3 months ago
Channel Code Division Multiple Access and its Multilevel Structured LDPC Based Instantiation
— In this paper, we introduce and outline the concept of Channel Code Division Multiple Access (CCDMA) using a design example based on the recently proposed Multilevel Structured...
Nicholas Bonello, Rong Zhang, Sheng Chen, Lajos Ha...
GLVLSI
2005
IEEE
104views VLSI» more  GLVLSI 2005»
14 years 2 months ago
Wave-pipelined 2-slot time division multiplexed (WP/2-TDM) routing
The ever-increasing number of transistors on a chip has resulted in very large scale integration (VLSI) systems whose performance and manufacturing costs are driven by on-chip wir...
Ajay Joshi, Jeffrey A. Davis
AAAI
2012
11 years 11 months ago
On Maxsum Fair Cake Divisions
We consider the problem of selecting fair divisions of a heterogeneous divisible good among a set of agents. Recent work (Cohler et al., AAAI 2011) focused on designing algorithms...
Steven J. Brams, Michal Feldman, John K. Lai, Jami...
ICPADS
2007
IEEE
14 years 3 months ago
Scheduling multiple divisible loads on a linear processor network
Min, Veeravalli, and Barlas have recently proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one...
Matthieu Gallet, Yves Robert, Frédér...