Given a parallel program represented by a task graph, the objective of a scheduling algorithm is to minimize the overall execution time of the program by properly assigning the nodes of the graph to the processors. This multiprocessor scheduling problem is NP-complete even with simplifying assumptio
Using parallelization and hardware concurrency to improve the performance of a genetic algorithm
β Scribed by Vijay Tirumalai; Kenneth G. Ricks; Keith A. Woodbury
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 711 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1532-0626
- DOI
- 10.1002/cpe.1113
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Two strategies are widely used in parallel MRI to reconstruct subsampled multicoil image data. SENSE and related methods employ explicit receiver coil spatial response estimates to reconstruct an image. In contrast, coilβbyβcoil methods such as GRAPPA leverage correlations among the acq
## Abstract The aim of this work is to compare the performances of two wellβknown methods, Minimum Principle and Genetic Algorithm, in the optimization of the methyl methacrylate polymerization process in solution. In order to select a kinetic model for this process, the published kinetic models we
## Abstract Various techniques that improve performance on SMP clusters have been studied. Most of them use special hardware and nonstandard protocols, tending to raise their total cost and to spoil flexibility. We propose the CPU\_NIC method, which improves parallel performance on smallβway SMP PC