Algon: a framework for supporting comparison of distributed algorithm performance

Renaud, Karen; Lo, Johnny Li-Chang; Bishop, Judith; Zyl, P. van; Worrall, Basil

doi:10.1109/empdp.2003.1183620

Cited by 2 publications

(3 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Algon concept and its associated design pattern was first proposed in [3]. It has since been successfully implemented, and a performance comparison tool has been developed [23]. In this paper we explain how the Algon framework operates, how the programmer can use it to interchange and compare algorithms, and how this concept can be extended so that the existing Java-RMI middleware can be dynamically replaced by CORBA.…”

Section: Introductionmentioning

confidence: 98%

Algon: From Interchangeable Distributed Algorithms to Interchangeable Middleware

Renaud

Bishop

et al. 2005

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

We present the design and implementation of a framework for interchangeable distributed algorithms. The algorithms are drawn from the set which includes mutual exclusion, deadlock detection and agreement protocols, and we have implemented several examples of the first tonsiswo of these. Algon cts of a library of algorithms, a framework for incorporating them into a new or existing system, and a tool for evaluating comparative performance. In this way, much of the complexity related to distributed systems can be isolated in its own component level and the programmer can choose from among different algorithms in the same class based on performance in a given application. Incorporating many algorithms in a single framework was made possible by the observation that algorithms in a given class, e.g. mutual exclusion, almost always expose the same methods. These methods interface with an Algon scheduler which maintains state and provides convenient hooks for the application to invoke the services of the algorithm. In this paper we describe the structure of Algon in detail, with a distributed deadlock detection algorithm as the case study. We then extend the notion of separation of concerns by creating an addition layer in Algon, underneath which the middleware that runs on each node can be interchanged, for example from Java-RMI to CORBA. Challenges in the re-tooling of the system, related to multiple inheritance, exceptions and the automatic generation of stubs and skeletons in our implementation language, Java, were overcome in novel ways. Algon has the potential to be a framework with a long life, as it can adapt to new middleware, such as .NET.

show abstract

Section: Introductionmentioning

confidence: 98%

Algon: From Interchangeable Distributed Algorithms to Interchangeable Middleware

Renaud

Bishop

et al. 2005

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Renaud, Bishop, Lo, van Zyl and Worrall (2003) reported on the works of Hsier and Sivakumar (2001) and Shousha, Petriu, Jalnapurkar and Ngo (1998) stating that the measurement of software performance by and for experts is a well known task. From various other previous works, Renaud, et al (2003) recalled that various metrics can be used to measure performance of algorithms in distributed systems, namely: response or waiting time, synch delay, number of messages exchanged, throughput, communication delay, node fairness, CPU cycle usage, and memory usage.…”

Section: Performance Latency and Throughputmentioning

confidence: 99%

“…The first four metrics were most suited to specifically measuring algorithm performance. The fifth metric is more dependent on network load than a specific algorithm, the sixth is difficult to quantify and the seventh and eighth produce measurement of debatable merit in judging algorithm efficacy (Renaud, et al, 2003).…”

Section: Framework For Performance Comparisonsmentioning

confidence: 99%

The Performance of Web-based 2-tier Middleware Systems

Dehinbo

2005

InSITE Conference

View full text Add to dashboard Cite

The overall aim of this study is to determine the performance of selected web-based dynamic middleware systems that are used for designing and implementing dynamic web application systems. This is necessary in a world where more applications are moving to the web, and slow performance of such applications can discourage users, thereby reducing profit, and reduce programmers' productivity and quality of applications due to slow testing and execution. Java Servlets, Java Server Pages (JSP), Microsoft Active Server Pages (ASP), and Personal Home Page (PHP) were used to perform some operations on the server, like retrieving all records from a database stored on the server. The time taken since the query is initiated from the browser, to the time the query result is displayed on the client browser were measured for each of the four middleware systems as an estimate for their performance. Records were increased in multiples of thousands to estimate scalability along with the performance. PHP proved to be more efficient and more scalable.

show abstract

Algon: a framework for supporting comparison of distributed algorithm performance

Abstract: Abstract

Cited by 2 publications

References 32 publications

Algon: From Interchangeable Distributed Algorithms to Interchangeable Middleware

Algon: From Interchangeable Distributed Algorithms to Interchangeable Middleware

The Performance of Web-based 2-tier Middleware Systems

Contact Info

Product

Resources

About