Library: Computer Science

Comprehensive global garbage detection (GGD) in object-oriented distributed systems, i.e., GGD intrinsically able to detect distributed cycles of garbage, has mostly been addressed via graph tracing algorithms. Graph tracing algorithms must account for every live object in the system before any resource can actually be reclaimed which compromises both their scalability and robustness in a distributed environment. Alternative non-comprehensive approaches trade-off comprehensiveness for scalability and robustness under the assumptions that distributed cycles of garbage are rare and that al...

In this dissertation, a new spare capacity planning methodology is proposed utilizing path restoration. The approach is based on forcing working flows/traffic which are on paths that are disjoint to share spare backup capacity. The algorithm for determining the spare capacity assignment is based on genetic algorithms and is capable of incorporating non-linear variables such as non-linear cost function and QoS variables into the objective and constraints. The proposed methodology applies to a wider range of fault scenarios than most of the current literature. It can tolerate link-failures, n...

As distributed applications become more sophisticated, their implementation becomes more and more difficult. It is therefore important to study how to facilitate the implementation of efficient distributed applications. This thesis reviews the different classes of distributed languages and presents a new approach to develop efficient distributed programs using the Ada language. This approach is compared in detail with existing distributed programming languages, existing approaches to distributed Ada programs, and the Distributed Annex of the new revision of Ada language.