Eidolon: real-time performance evaluation approach for distributed programs based on capacity of communication links

Authors:
Yunfa Li;Hai Jin;Zongfen Han;Chao Xie;Minna Wu
Affiliations:
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China
Venue:
CIS'04 Proceedings of the First international conference on Computational and Information Science
Year:
2004

Citing 6
Cited 2

Distributed program reliability analysis

IEEE Transactions on Software Engineering
Distributed operating systems

Distributed operating systems
Efficient algorithms for reliability analysis of distributed computing systems

Information Sciences: an International Journal
Establishing A Real-time Distributed Benchmark

WPDRTS '96 Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems
One approach for generalization of real-time distributed systems benchmarking

WPDRTS '96 Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems
A fast algorithm for reliability-oriented task assignment in a distributed system

Computer Communications

Aeneas: Real-Time Performance Evaluation Approach for Distributed Programs with Reliability-Constrains

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
Aeneas: real-time performance evaluation approach for distributed programs with reliability-constrains

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an approach for the real-time performance analysis of distributed programs, called Eidolon. The approach is based on the capacity of communication links. In Eidolon, some algorithms are designed to find all the transmission paths of each data file needed while the program executes, count the transmission time for each the transmission path, then get the minimum and the maximum transmission time by analyzing all the transmission paths of each data file, and at last, calculate the fastest and the slowest response time of distributed programs. A case study is given at the end of this paper to justify the validity of this approach.