Aeneas: real-time performance evaluation approach for distributed programs with reliability-constrains

Authors:
Hai Jin;Yunfa Li;Zongfen Han;Hao Wu;Weizhong Qiang
Affiliations:
Cluster and Grid Computing Lab, Huazhong University of Science and Technology, Wuhan, China 430074;Cluster and Grid Computing Lab, Huazhong University of Science and Technology, Wuhan, China 430074;Cluster and Grid Computing Lab, Huazhong University of Science and Technology, Wuhan, China 430074;Cluster and Grid Computing Lab, Huazhong University of Science and Technology, Wuhan, China 430074;Cluster and Grid Computing Lab, Huazhong University of Science and Technology, Wuhan, China 430074
Venue:
Cluster Computing
Year:
2007

Citing 8
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
The distributed program reliability analysis on star topologies

Computers and Operations Research
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, called Aeneas, which is based on the execution state of distributed programs, is proposed in this paper. 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 expression of transmission time, calculate the fastest response time and the slowest response time of distributed programs with reliability-constrains. In order to justify the feasibility and the availability of this approach, a series of experiments have been done. The results show that it is feasible and efficient to evaluate the real-time performance for distributed software with reliability-constrains.