A Self-adaptive Greedy Scheduling Scheme for a Multi-Objective Optimization on Identical Parallel Machines

A self-adaptive greedy scheduling scheme is presented to solve a Multi-Objective Optimization on Identical Parallel Machines. The primary objective is to minimize the makespan, while the secondary objective makes the schedule more stable. Actual experiments revealed that the scheme obtained the optimal primary and secondary objectives for most cases. Moreover, schedules produced by the scheme were more robust, with smaller makespans. Additionally, it has been applied to parallelize one major component of EMAN, one of the most popular software packages for cryo-electron microscopy single particle reconstruction. Besides, it can also be used in practice to parallelize other similar applications.

[1]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[2]  Yuyao Liang,et al.  IMIRS: a high-resolution 3D reconstruction package integrated with a relational image database. , 2002, Journal of structural biology.

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  A Leith,et al.  SPIDER and WEB: processing and visualization of images in 3D electron microscopy and related fields. , 1996, Journal of structural biology.

[5]  Z. Zhou,et al.  3.88 Å structure of cytoplasmic polyhedrosis virus by cryo-electron microscopy , 2008, Nature.

[6]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[7]  R. F. Freund,et al.  Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[8]  G. Herman,et al.  Disentangling conformational states of macromolecules in 3D-EM through likelihood optimization , 2007, Nature Methods.

[9]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  J. Frank.  Three-Dimensional Electron Microscopy of Macromolecular Assemblies , 2006 .

[11]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[12]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[13]  Chao Yang,et al.  The parallelization of SPIDER on distributed-memory computers using MPI. , 2007, Journal of structural biology.

[14]  W Chiu,et al.  EMAN: semiautomated software for high-resolution single-particle reconstructions. , 1999, Journal of structural biology.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[17]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: practical and theoretical results , 1987 .