Sciweavers

156 search results - page 1 / 32
» Buffer minimization using max-coloring
Sort
View
ICALP
2011
Springer
12 years 8 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
ASPDAC
2006
ACM
176views Hardware» more  ASPDAC 2006»
13 years 8 months ago
Closed form solution for optimal buffer sizing using the Weierstrass elliptic function
Abstract-- This paper presents a fundamental result on buffer sizing. Given an interconnection wire with n buffers evenly spaced along the wire, we would like to size all buffers s...
Sebastian Vogel, Martin D. F. Wong
TC
2008
13 years 4 months ago
Adaptive Channel Buffers in On-Chip Interconnection Networks - A Power and Performance Analysis
On-chip interconnection networks (OCINs) have emerged as a modular and scalable solution for wire delay constraints in deep submicron VLSI design. OCIN research has shown that the ...
Avinash Karanth Kodi, Ashwini Sarathy, Ahmed Louri
ECCC
2010
80views more  ECCC 2010»
13 years 5 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
SODA
2004
ACM
95views Algorithms» more  SODA 2004»
13 years 6 months ago
Buffer minimization using max-coloring
Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varad...