Sciweavers

48 search results - page 9 / 10
» A Hardware Relaxation Paradigm for Solving NP-Hard Problems
Sort
View
TON
2010
93views more  TON 2010»
13 years 4 days ago
Design and field experimentation of an energy-efficient architecture for DTN throwboxes
Disruption tolerant networks rely on intermittent contacts between mobile nodes to deliver packets using a storecarry-and-forward paradigm. We earlier proposed the use of throwbox ...
Nilanjan Banerjee, Mark D. Corner, Brian Neil Levi...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
13 years 11 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
ICCD
2007
IEEE
183views Hardware» more  ICCD 2007»
14 years 2 months ago
Constraint satisfaction in incremental placement with application to performance optimization under power constraints
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
Huan Ren, Shantanu Dutt
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 5 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Fully decentralized emulation of best-effort and processor sharing queues
Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this pro...
Rade Stanojevic, Robert Shorten