Sciweavers

5055 search results - page 698 / 1011
» Relative Timing
Sort
View
INFOCOM
2000
IEEE
15 years 11 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
187
Voted
INFOCOM
2000
IEEE
15 years 11 months ago
Networks with Advance Reservations: The Routing Perspective
— This paper provides an initial look at how support for advance reservations affects the complexity of the path selection process in networks. Advance reservations are likely to...
Roch Guérin, Ariel Orda
IPPS
2000
IEEE
15 years 11 months ago
Predicting Performance on SMPs. A Case Study: The SGI Power Challenge
We study the issue of performance prediction on the SGIPower Challenge, a typical SMP. On such a platform, the cost of memory accesses depends on their locality and on contention ...
Nancy M. Amato, Jack Perdue, Mark M. Mathis, Andre...
IPPS
2000
IEEE
15 years 11 months ago
Job Scheduling that Minimizes Network Contention due to both Communication and I/O
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
Jens Mache, Virginia Mary Lo, Sharad Garg
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
15 years 11 months ago
Dynamic Routing and Wavelength Assignment Using First Policy Iteration
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
Esa Hyytiä, Jorma T. Virtamo