published_or_final_version / abstract / toc / Computer Science and Information Systems / Master / Master of Philosophy

Bibliography: leaves 211-234. / xiv, 234 p. : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / The general problem of scheduling is investigated, with focus on jobs consisting of both independent and dependent programs. Using the constraint of restricted placement of programs, presents a scheduling system that produces heuristically good execution schedules in the absence of complete global system state information. / Thesis (Ph.D.)--University of Adelaide, Dept. of Computer Science, 1999

Thesis (Ph.D.) -- University of Adelaide, Dept. of Computer Science, 1999. / Bibliography: leaves 211-234.

Thesis (Ph. D.)--Northeastern University, 2008. / Title from title page (viewed March 17, 2009). College of Computer and Information Science. Includes bibliographical references (p. 134-140).

Bibliography: leaves 211-234. The general problem of scheduling is investigated, with focus on jobs consisting of both independent and dependent programs. Using the constraint of restricted placement of programs, presents a scheduling system that produces heuristically good execution schedules in the absence of complete global system state information.

Parallel computing on heterogeneous workstation clusters has proved to be a very efficient use of available resources, increasing their overall utilization. However, for it to be a viable alternative to expensive, dedicated parallel machines, a number of key issues need to be resolved. One of the major challenges of heterogeneous computing is coping with the inherent heterogeneity of the system, with the availability of workstations from different vendors of varying processing speeds and capabilities. The existence of multiple jobs and users further complicates the task. The time taken for a parallel job is constrained by the time taken by the slowest or the most heavily loaded workstation. Therefore, load sharing of parallel computations is imperative in ensuring good overall utilization of the system. Since load sharing is essentially independent of the particular parallel job being run, the development of program independent, automatic, scheduling and load sharing strategies have become vital to the efficient use of the heterogeneous cluster. This thesis discusses various prior approaches to load sharing, examines a new strategy developed for heterogeneous workstations, and evaluates its performance. / Graduation date: 1996

published_or_final_version / Electrical and Electronic Engineering / Master / Master of Philosophy

Thesis (D Phil.(Information Technology))--University of Pretoria, 2008. / Abstract in English. Includes bibliographical references.

Indiana University-Purdue University Indianapolis (IUPUI) / In today's internet world with such a high traffic, it becomes inevitable to have multiple servers representing a single logical server to share enormous load. A very common network configuration consists of multiple servers behind a load balancer. The load balancer determines which server would service a clients request or incoming load from the client. Such a hardware is expensive, runs a fixed policy or algorithm and is a single point of failure. In this paper, we will implement and analyze an alternative load balancing architecture using OpenFlow. This architecture acquires flexibility in policy, costs less and has the potential to be more robust. This paper also discusses potential usage of OpenFlow based load balancing for media gateway selection in SIP-PSTN networks to improve VoIP performance.