A
Albert Y. Zomaya
Researcher at University of Sydney
Publications - 1020
Citations - 30827
Albert Y. Zomaya is an academic researcher from University of Sydney. The author has contributed to research in topics: Cloud computing & Scheduling (computing). The author has an hindex of 75, co-authored 946 publications receiving 24637 citations. Previous affiliations of Albert Y. Zomaya include University of Alabama & University of Sheffield.
Papers
More filters
Proceedings ArticleDOI
On the dynamic initialization of parallel computers
TL;DR: This work is to present parallel algorithms for the initialization problem on a number of network topologies, including complete binary trees, meshes of trees, pyramids, linear arrays, rings, meshes, tori, higher-dimensional meshes and tori and hypercubes, butterflies and linear arrays with a global bus.
Journal ArticleDOI
Online Inter-Datacenter Service Migrations
Nikos Tziritas,Samee U. Khan,Thanasis Loukopoulos,Spyros Lalis,Cheng-Zhong Xu,Keqin Li,Albert Y. Zomaya +6 more
TL;DR: This paper proposes an online algorithm that minimizes the inter-datacenter network, taking into account the network load of migrating a service between two datacenters, as well as the fact that the client request pattern may change “quickly”, before such a migration is amortized.
Proceedings ArticleDOI
An Interoperability Framework for Sensor and UMTS Networks
TL;DR: A new framework for moving data from a sink to the user at a low cost and power, using the universal mobile telecommunication system (UMTS), which is standard for the third generation mobile system (3G).
Proceedings ArticleDOI
A Memetic Algorithm for Dynamic Shortest Path Routing on Mobile Ad-hoc Networks
TL;DR: This paper presents a memetic algorithm for dynamic shortest path routing problems in a mobile network that outperformed state-of-the-art algorithms in the literature as it outperformed these algorithms on all instances of dynamic routing during evaluation.
Journal ArticleDOI
Capturing an intruder in product networks
TL;DR: This paper proposes a novel method for deriving intrusion capturing algorithms based on the abstract idea of spanning search trees and utilizes this method forderiving capturing algorithms for Cartesian product graphs.