Sciweavers

500 search results - page 96 / 100
» Process Scheduling for the Parallel Desktop
Sort
View
FOCS
2007
IEEE
14 years 27 days ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
EMSOFT
2008
Springer
13 years 10 months ago
Energy efficient streaming applications with guaranteed throughput on MPSoCs
In this paper we present a design space exploration flow to achieve energy efficiency for streaming applications on MPSoCs while meeting the specified throughput constraints. The ...
Jun Zhu, Ingo Sander, Axel Jantsch
ATAL
2010
Springer
13 years 10 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
IJHPCA
2006
77views more  IJHPCA 2006»
13 years 9 months ago
An Interoperability Approach to System Software, Tools, and Libraries for Clusters
Systems software for clusters typically derives from a multiplicity of sources: the kernel itself, software associated with a particular distribution, site-specific purchased or o...
Ewing L. Lusk, Narayan Desai, Rick Bradshaw, Andre...
CORR
2007
Springer
154views Education» more  CORR 2007»
13 years 9 months ago
Application of a design space exploration tool to enhance interleaver generation
This paper presents a methodology to efficiently explore the design space of communication adapters. In most digital signal processing (DSP) applications, the overall performance ...
Cyrille Chavet, Philippe Coussy, Pascal Urard, Eri...