Sciweavers

3192 search results - page 312 / 639
» The minimum latency problem
Sort
View
ASPDAC
2006
ACM
143views Hardware» more  ASPDAC 2006»
16 years 19 days ago
CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
Yiyu Shi, Tong Jing, Lei He, Zhe Feng 0002, Xianlo...
ICPP
2005
IEEE
16 years 7 days ago
Design and Implementation of Overlay Multicast Protocol for Multimedia Streaming
In this paper, we propose a new protocol called Shared Tree Streaming (or STS in short) protocol that is designed for interactive multimedia streaming applications. STS is a decen...
Thilmee M. Baduge, Akihito Hiromori, Hirozumi Yama...
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
16 years 6 days ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
INFOCOM
2003
IEEE
15 years 12 months ago
Localized minimum-energy broadcasting in ad-hoc networks
— In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from...
Julien Cartigny, David Simplot, Ivan Stojmenovic
RTSS
2003
IEEE
15 years 12 months ago
Quick-release Fair Scheduling
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
James H. Anderson, Aaron Block, Anand Srinivasan