Andere Kunden interessierten sich auch für
![Cost Aware Genetic Optimization for Task Allocation in Cloud IaaS]( "Cost Aware Genetic Optimization for Task Allocation in Cloud IaaS")
Cost Aware Genetic Optimization for Task Allocation in Cloud IaaS24,99 €![Fingerprint Identification using Neural Network and Genetic Algorithm]( "Fingerprint Identification using Neural Network and Genetic Algorithm")
Fingerprint Identification using Neural Network and Genetic Algorithm36,99 €![Adaptive Task Selection using Threshold Techniques in Sensor Networks]( "Adaptive Task Selection using Threshold Techniques in Sensor Networks")
Adaptive Task Selection using Threshold Techniques in Sensor Networks51,99 €![BMPGA: A Bi-objective Multi-population Genetic Algorithm]( "BMPGA: A Bi-objective Multi-population Genetic Algorithm")
BMPGA: A Bi-objective Multi-population Genetic Algorithm51,99 €![Designing Pipeline FFT Processors using 3DIC Technology]( "Designing Pipeline FFT Processors using 3DIC Technology")
Designing Pipeline FFT Processors using 3DIC Technology38,99 €![CTA - An algorithm for time critical task assignment problems]( "CTA - An algorithm for time critical task assignment problems")
CTA - An algorithm for time critical task assignment problems30,99 €![An Approach to Solve MMKP: Using Genetic Algorithm]( "An Approach to Solve MMKP: Using Genetic Algorithm")
An Approach to Solve MMKP: Using Genetic Algorithm32,99 €
This book presents an automated task scheduling
technique to address this parallel programming
complexity. Our proposed technique is based on GA. By
incorporating tasks dependency into scheduling list
and encoding task scheduling list as a chromosome, GA
can quickly remove the invalid mappings and evolve to
the high quality solutions. This technique takes
advantage of task-level and application-level
parallelism to maximize system performance for a
given NPs architecture. The simulation results show
that this proposed technique can generate high
quality mapping comparing to other heuristics by
mapping some sample network applications. This work
will also enable researchers and engineers to
systematically evaluate and quantitatively understand
the NPs system issues including application
partitioning, architecture organizing, workload
mapping and run-time operating
technique to address this parallel programming
complexity. Our proposed technique is based on GA. By
incorporating tasks dependency into scheduling list
and encoding task scheduling list as a chromosome, GA
can quickly remove the invalid mappings and evolve to
the high quality solutions. This technique takes
advantage of task-level and application-level
parallelism to maximize system performance for a
given NPs architecture. The simulation results show
that this proposed technique can generate high
quality mapping comparing to other heuristics by
mapping some sample network applications. This work
will also enable researchers and engineers to
systematically evaluate and quantitatively understand
the NPs system issues including application
partitioning, architecture organizing, workload
mapping and run-time operating