Integrating Amdahl-like Laws and Divisible Load Theory
Abstract
A simple means of integrating the characteristics of networked processors under divisible loads into Amdahl’s Law is presented. Amdahl’s Law serves as an upper bound to these speedup results. Amdahl’s Law with divisible load processing characteristics included serves as an upper bound to speedup for any model taking into consideration more detailed peculiarities of real systems such as the overhead of task creation, synchronization, resource contention and memory issues.
Communicated by Andrew Adamatzky
References
- 1. , Distributed computation with communication delays, IEEE Transactions on Aerospace and Electronic Systems 24(6) (1988) 700–712. Crossref, ISI, Google Scholar
- 2. , Partitioning techniques for large-grained parallelsim, IEEE Transactions on Computers 37(12) (1988) 1627–1634. Crossref, ISI, Google Scholar
- 3. , Scheduling for Parallel Processing (Springer, 2009). Crossref, Google Scholar
- 4. , Parallel Algorithms (CRC Press, 2009). Google Scholar
- 5. , On the design of high-performance algorithms for aligning multiple protein sequences in mesh-based multiprocessor architectures, Journal of Parallel and Distributed Computing 67(9) (2007) 1007–1017. Crossref, ISI, Google Scholar
- 6. , Scheduling divisible MapReduce computations, Journal of Parallel and Distributed Computing 71(3) (March 2011) 450–459. Crossref, ISI, Google Scholar
- 7. , An analytical approach to optimizing parallel image registration, IEEE Transactions on Parallel and Distributed Systems 21(8) (August 2010) 1074–1088. Crossref, ISI, Google Scholar
- 8. , Signature searching in a networked collection of files, IEEE Transaction on Parallel and Distributed Systems 25(5) (May 2014) 1339–1348. Crossref, ISI, Google Scholar
- 9. , Simple performance bounds for multicore and parallel channel systems, Parallel Processing Letters 21(4) (December 2011) 439–459. Link, Google Scholar
- 10. , An analytical approach to the design of parallel block cipher encryption/decryption: A CPU/GPU case study, Proc. of PDP,
February 2011 , pp. 247–251. Google Scholar - 11. , Wireless sensor networks: Scheduling for measurement and data reporting, IEEE Transactions on Aerospace and Electronic Systems 42(1) (January 2006) 327–340. Crossref, ISI, Google Scholar
- 12. , Enhanced real-time divisible load scheduling with different processor available times, 14th International Conference on High Performance Computing (HiPC),
December 2007 . Google Scholar - 13. , Using divisible load theory to dimension optical transport networks computational grids, Proc. of Optical Fibre Communication Conference (OFC),
March 2005 . Google Scholar - 14. , Validity of the single processor approach to achieving large scale computing capabilities, Proc. of the AFIPS Conference,
1967 , 483–485. Google Scholar - 15. , Computer architecture and Amdahl’s law, Computer (2013) 38–46. Crossref, ISI, Google Scholar
- 16. , Reevaluating Amdahl’s law, Communications of the ACM 31(5) (May 1988) 532–533. Crossref, ISI, Google Scholar
- 17. , Amdahl’s law in the multicore era, Computer (July 2008) 33–38. Crossref, ISI, Google Scholar
- 18. , Retrospective on Amdahl’s law in the multicore era, Computer (June 2017) 12–14. Crossref, ISI, Google Scholar
- 19. , Amdahl’s law for predicting the future of multicores considered harmful, ACM SIGARCH Computer Architecture News 40(2) (May 2012), 9 pages. Crossref, Google Scholar
- 20. , Analytical modeling of energy efficiency in heterogeneous processors, Computers and Electrical Engineering 39 (2013) 2566–2578. Crossref, ISI, Google Scholar
- 21. , Beyond Amdahl’s law: An objective function that links multiprocessor performance gains to delay and energy, IEEE Transactions on Computers 61(8) (August 2012) 1110–1126. Crossref, ISI, Google Scholar
- 22. , Extending Amdahl’s law for the cloud computing era, Computer (February 2016) 14–22. Crossref, ISI, Google Scholar
- 23. T. Robertazzi, Networks and Grids (Springer, 2007). Second edition: T. Robertazzi and L. Shi, Networking and Computation (Springer, 2020). Google Scholar


