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

Authors:
Yunfa Li;Hai Jin;Zongfen Han;Chao Xie;Deqing Zou;Hao Wu
Affiliations:
Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
Year:
2005

Citing 7
Cited 0

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
Eidolon: real-time performance evaluation approach for distributed programs based on capacity of communication links

CIS'04 Proceedings of the First international conference on Computational and Information Science
A fast algorithm for reliability-oriented task assignment in a distributed system

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel approach, based on the execution state of distributed programs, is proposed in this paper, called Aeneas. It is for the real-time performance analysis of distributed programs with reliability-constrains. In Aeneas, there are two important factors, the available data files and the transmission paths of each available data file. 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 transmission path, then get the aggregate transmission time, calculate the fastest and the slowest response time of distributed programs with reliability-constrains. A representative case is analyzed, and the results show that it is an efficient way to evaluate the real-time performance of distributed programs with reliability-constrains.