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
Journal ArticleDOI
Scalable hardware-algorithms for binary prefix sums
Rong Lin,Koji Nakano,Stephan Olariu,Maria Cristina Pinotti,James L. Schwing,Albert Y. Zomaya +5 more
TL;DR: This work addresses the problem of designing efficient and scalable hardware-algorithms for computing the sum and prefix sums of a w/sup k/-bit, (k/spl ges/2), sequence using as basic building blocks linear arrays of at most w/Sup 2/ shift switches.
Journal ArticleDOI
A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks
TL;DR: This work describes the first algorithm for solving the pagenumber problem that can be applied on arbitrary graphs and is particularly interested in graphs that correspond to some well-known interconnection networks (such as hypercubes and meshes).
Proceedings ArticleDOI
MPHC: Preserving Privacy for Workflow Execution in Hybrid Clouds
TL;DR: This study presents an algorithm that preserves privacy in scheduling of workflows, whilst still considering customers' deadlines and cost, and evaluated the efficiency of the approach using real workflows running on a private HTCondor-based hybrid cloud.
Journal ArticleDOI
Efficient clustering for parallel tasks execution in distributed systems
Albert Y. Zomaya,Gerard Chan +1 more
TL;DR: The proposed approach shows great promise to solve the clustering problem for a wide range of clustering instances and is shown to show the feasibility of using genetic algorithms for task clustering to solved the scheduling problem.
Journal ArticleDOI
A time-optimal solution for the path cover problem on cographs
TL;DR: In this paper, it was shown that the problem of finding and reporting the smallest number of vertex-disjoint paths that cover the vertices of a graph can be solved time and work-optimally for cographs.