800 search results - page 63 / 160 » Understanding Algorithm Performance on an Oversubscribed Sch... |
174
click to vote
APCSAC
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
147
click to vote
CASES
2001
ACM
15 years 9 months ago
2001
ACM
In this paper we describe a design exploration methodology for clustered VLIW architectures. The central idea of this work is a set of three techniques aimed at reducing the cost ...
187
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper investigates scheduling loosely coupled task-bundles in highly heterogeneous distributed systems. Two allocation quality metrics are used in pay-per-service distributed ...
170
click to vote
MM
2004
ACM
15 years 11 months ago
2004
ACM
This paper presents the design, implementation, and evaluation of a practical voltage scaling (PDVS) algorithm for mobile devices primarily running multimedia applications. PDVS s...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...