Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences

Authors:
Cho-Chin Lin;Hao-Yun Yin
Affiliations:
Department of Electronic Engineering, National Ilan University, Yilan, Taiwan 260;Department of Electronic Engineering, National Ilan University, Yilan, Taiwan 260
Venue:
Information Processing Letters
Year:
2007

Citing 7
Cited 0

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Adaptive communication algorithms for distributed heterogeneous systems

Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
LLM: A Low Latency Messaging Infrastructure for Linux Clusters

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Exploting communication Latency Hiding for Parallel Network

Proceedings of the 1994 International Conference on Parallel and Distributed Systems
A Framework for Mapping with Resource Co-Allocation in Heterogeneous Computing Systems

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Strategies for Achieving High Performance Incremental Computing on a Network Environment

AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Bounds on the Client-Server Incremental Computing

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper studies the performance of network-based incremental computing under various message sequences. We show the bounds on the time needed to compute the tasks requested by multiple clients. Our simulation result shows that the expected performance of random message sequences is close to the optimal performance.