Sciweavers

INFOCOM
1991
IEEE
13 years 8 months ago
On Multicast Path Finding Algorithms
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
Ching-Hua Chow
IPPS
1998
IEEE
13 years 8 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
ICDCS
1999
IEEE
13 years 8 months ago
Efficient Collective Communication in Distributed Heterogeneous Systems
The Information Power Grid (IPG) is emerging as an infrastructure that will enable distributed applications
Prashanth B. Bhat, Cauligi S. Raghavendra, Viktor ...
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
13 years 9 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
VTC
2006
IEEE
112views Communications» more  VTC 2006»
13 years 10 months ago
Adaptive Resource Allocation Based on Channel Information in Multihop OFDM Systems
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
ChiSung Bae, Dong-Ho Cho
VTC
2008
IEEE
127views Communications» more  VTC 2008»
13 years 11 months ago
Performance Evaluation of Joint FEC and ARQ Optimization Heuristic Algorithms under Gilbert-Elliot Wireless Channel
— In this paper, we evaluate the performance of adaptive algorithms for selecting the number of redundant packets by jointly considering the forward error correction (FEC) and au...
Azfar Moid, Abraham O. Fapojuwo
ICDE
2003
IEEE
73views Database» more  ICDE 2003»
14 years 5 months ago
Scalable Application-Aware Data Freshening
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
Donald Carney, Sangdon Lee, Stanley B. Zdonik