Abstract
AbstractIn 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.KeywordsData FileTransmission TimeCommunication LinkTransmission PathDistribute Computing SystemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call