PHANTOM
2010pp. 305–314
Citations Over TimeTop 10% of 2010 papers
Abstract
For designers of large-scale parallel computers, it is greatly desired that performance of parallel applications can be predicted at the design phase. However, this is difficult because the execution time of parallel applications is determined by several factors, including sequential computation time in each process, communication time and their convolution. Despite previous efforts, it remains an open problem to estimate sequential computation time in each process accurately and efficiently for large-scale parallel applications on non-existing target machines.
Related Papers
- → The Urbanik generalized convolutions in the non-commutative probability and a forgotten method of constructing generalized convolution(2012)13 cited
- → On the non-closure under convolution for strong subexponential distributions(2022)5 cited
- → The conjectures of Embrechts and Goldie(2015)3 cited
- → Parallel Simulation on a Hypercube Parallel Processor(1989)
- → Balanced Group Convolution: An Improved Group Convolution Based on Approximability Estimates(2023)