Sciweavers

1095 search results - page 135 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ICCAD
2002
IEEE
100views Hardware» more  ICCAD 2002»
15 years 6 months ago
Multi-objective circuit partitioning for cutsize and path-based delay minimization
– In this paper we present multi-objective hMetis partitioning for simultaneous cutsize and circuit delay minimization. We change the partitioning process itself by introducing a...
Cristinel Ababei, Navaratnasothie Selvakkumaran, K...
EMSOFT
2008
Springer
14 years 11 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
POPL
2007
ACM
15 years 10 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
OPODIS
2004
14 years 11 months ago
A Hierarchy-Based Fault-Local Stabilizing Algorithm for Tracking in Sensor Networks
In this paper, we introduce the concept of hierarchy-based fault-local stabilization and a novel self-healing/fault-containment technique and apply them in Stalk. Stalk is an algo...
Murat Demirbas, Anish Arora, Tina Nolte, Nancy A. ...
FUIN
2008
98views more  FUIN 2008»
14 years 10 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný