542 search results - page 23 / 109 » Optimal delay scheduling in networks with arbitrary constrai... |
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N Ã...
114
click to vote
SPAA
1999
ACM
15 years 1 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisï¬ed by some ar...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacriï¬ces. Delay suffer...
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...