Search Results - (( parallel optimization based algorithm ) OR ( problem application scheduling algorithm ))
Search alternatives:
- application scheduling »
- parallel optimization »
- problem application »
-
1
Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures
Published 2020“…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
Get full text
Get full text
Thesis -
2
Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems
Published 2018“…Urban Transit Scheduling Problem (UTSP) considers the process of creating timely transit schedules that includes bus and drivers assignment based on the users' and operators’ requirements. …”
Get full text
Get full text
Thesis -
3
Load-Balancing Models for Scheduling Divisible Load on Large Scale Data Grids
Published 2009“…The third stage integrates the proposed DLT based models with GA algorithm to solve the time consuming problem. …”
Get full text
Get full text
Thesis -
4
Communication and computation rate-cheating problems in divisible load scheduling: revisited
Published 2015“…In the real applications, the processors may cheat the algorithm which means that the processors might not report their true computation or communication rates. …”
Get full text
Get full text
Conference or Workshop Item -
5
Multi-criteria divisible load scheduling in binary tree network
Published 2016“…A class of the scheduling methods which is defined based on the DLT is called the Divisible Load Scheduling (DLS). …”
Get full text
Get full text
Thesis -
6
Energy-aware task scheduling for streaming applications on NoC-based MPSoCs
Published 2024“…We propose a novel unified approach that integrates task-level software pipelining with Dynamic Voltage and Frequency Scaling (DVFS) to solve the problem. Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intraperiod dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. …”
Get full text
Get full text
Get full text
Article -
7
Process Planning Optimization In Reconfigurable Manufacturing Systems
Published 2008“…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
Get full text
Get full text
Thesis -
8
Performance Comparison of Parallel Bees Algorithm on Rosenbrock Function
Published 2012“…This thesis presents the parallel Bees Algorithm as a new approach for optimizing the last results for the Bees Algorithm. …”
Get full text
Get full text
Get full text
Thesis -
9
Parallel distributed computational microcontroller system for adaptive antenna downlink transmitter power optimization
Published 2023Subjects:Article -
10
Design and implemtation of a real-time adaptive learning algorithm controller for a 3-DOF parallel manipulator / Mustafa Jabbar Hayyawi
Published 2016“…Performance indices such as workspace, dexterity and stiffness, of the parallel manipulator are studied. The parallel manipulator is optimized based on the performance indices to obtain on the optimal design parameters for achieved maximum performance of the parallel manipulator. …”
Get full text
Get full text
Student Project -
11
A review of genetic algorithms and parallel genetic algorithms on Graphics Processing Unit (GPU)
Published 2013“…Genetic Algorithms (GAs) is proven to be effective in solving many optimization tasks. …”
Get full text
Conference or Workshop Item -
12
Voting algorithms for large scale fault-tolerant systems
Published 2011“…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
Get full text
Get full text
Thesis -
13
-
14
-
15
Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad
Published 2017“…Similarly, when data parallelism is introduced in the algorithm the performance of the algorithm improved further by 12% in latency and 17% in throughput when compared to PDWA algorithm. …”
Get full text
Get full text
Get full text
Thesis -
16
Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm
Published 2022“…In this thesis study, hybrid Genetic Algorithm and Bat Algorithm proposed to solve the task scheduling problem. …”
Get full text
Get full text
Get full text
Academic Exercise -
17
-
18
Investigation on the dynamic of computation of semi autonomous evolutionary computation for syntactic optimization of a set of programming codes
Published 2007“…They have to be optimized for parallel execution while some parts still do have sequential execution due to data dependencies, which makes the optimization problem two folds, parallel and serial. …”
Get full text
Get full text
Research Report -
19
Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid
Published 2012“…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text
Monograph -
20
An improved genetic algorithm for solving the multiprocessor scheduling problem
Published 2011“…Multiprocessor Scheduling Problem (MSP) is an NP-complete optimization problem. …”
Get full text
Get full text
Get full text
Get full text
Article