Abstract
Data partitioning and scheduling is one the important issues in minimizing the processing time for parallel and distributed computing system. We consider a single-level tree architecture of the system and the case of affine communication model, for a general m processor system with n rounds of load distribution. For this case, there exists an optimal activation order, optimal number of processors.
Original language | English |
---|---|
Pages (from-to) | 500-510 |
Number of pages | 11 |
Journal | Applied Soft Computing Journal |
Volume | 24 |
DOIs | |
Publication status | Published - 2014 Nov |
Keywords
- Data partitioning
- Divisible loads
- Genetic algorithm
- Parallel computing
- Scheduling
ASJC Scopus subject areas
- Software