449 Hits in 4.4 sec

Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform

Michał Czapiński, Stuart Barnes
2011 Journal of Parallel and Distributed Computing  
In this paper, two approaches to parallel GPU evaluation of Permutation Flowshop Scheduling Problem, with makespan and total flowtime criteria, are proposed.  ...  These methods can be employed in most population-based algorithms, e.g. genetic algorithms, Ant Colony Optimisation, Particle Swarm Optimisation, and Tabu Search.  ...  • Two efficient GPU (CUDA) implementations of Tabu Search for Flowshop are proposed. • Two approaches to parallel evaluation for any population-based algorithm are proposed.  ... 
doi:10.1016/j.jpdc.2011.02.006 fatcat:dbuuj7wqjfcn5kzuoyg6d6mham

Performance Evaluation of Heuristics for Scheduling Pipelined Multiprocessor Tasks [chapter]

M. Fikret Ercan, Ceyda Oguz, Yu-Fai Fung
2001 Lecture Notes in Computer Science  
This paper presents the evaluation of the solution quality of heuristic algorithms developed for scheduling multiprocessor tasks in a class of multiprocessor architecture designed for real-time operations  ...  MIMD parallelism and multiprogramming support are the two main characteristics of multiprocessor architecture considered.  ...  In this paper, we study simulated annealing and tabu search algorithms and evaluate their performances.  ... 
doi:10.1007/3-540-45545-0_16 fatcat:y77xyzsygfdmdlwr5dkhwr62vi

A Survey of Static Scheduling Algorithm for Distributed Computing System

Khushboo Singh, Mahfooz Alam, Sushil Kumar
2015 International Journal of Computer Applications  
The static scheduling algorithms are widely used to evaluate the performance of distributed computing system.  ...  Scheduling algorithms are classified into two broad categories i.e., static scheduling algorithms and dynamic scheduling algorithms.  ...  Prof. of CSE Institute of Technology & Management, Aligarh for his constant support. Author is also very special thankful to his friend (Mr. Mahfooz Alam).  ... 
doi:10.5120/ijca2015906828 fatcat:kta7shcu5nbejc73tiju4iw2we

A performance study of multiprocessor task scheduling algorithms

Shiyuan Jin, Guy Schiavone, Damla Turgut
2007 Journal of Supercomputing  
In our study, we consider nine scheduling algorithms which are frequently used to the best of our knowledge: min-min, chaining, A * , genetic algorithms, simulated annealing, tabu search, HLFET, ISH, and  ...  Multiprocessor task scheduling is an important and computationally difficult problem.  ...  [28] apply the tabu search algorithm to the static task scheduling problem in a heterogeneous multiprocessor environment under precedence constraints.  ... 
doi:10.1007/s11227-007-0139-z fatcat:kh2aagyfvncabn5lhz6fxdyq7i

Preface: Multiprocessor Scheduling, Theory and Applications [chapter]

Eugene Levner
2007 Multiprocessor Scheduling, Theory and Applications  
This volume contains four major parts that cover the following directions: the state of the art in theory and algorithms for classical and non-standard scheduling problems; new exact optimization algorithms  ...  Chapter 1 is a tutorial on theory of cyclic scheduling. It is included for those readers who are unfamiliar with this area of scheduling theory.  ...  An effective multiobjective immune algorithm is designed for searching the Pareto-optimal frontier.  ... 
doi:10.5772/5211 fatcat:i4hco3bepjeo3i2eps3g46miga

A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors

Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi
2020 Proceedings of the 2020 Federated Conference on Computer Science and Information Systems  
In this paper, we propose a reactive search-based algorithm for solving the problem of scheduling multiprocessor tasks on two dedicated processors.  ...  The method is also reinforced with a drop and rebuild operator that is applied for diversifying the search process.  ...  Thesen [11] designed a tabu search for tackling general multiprocessor scheduling problems. The method combines tabu strategy and local search operator.  ... 
doi:10.15439/2020f134 dblp:conf/fedcsis/AiderBH20 fatcat:ont3kfiqindz3f7sv3hcjypkqy

GPU-Based Multi-start Local Search Algorithms [chapter]

Thé Van Luong, Nouredine Melab, El-Ghazali Talbi
2011 Lecture Notes in Computer Science  
In this paper, the focus is on the multi-start model for local search algorithms on GPU. We address its re-design, implementation and associated issues related to the GPU execution context.  ...  Local search algorithms are powerful heuristics which allow to significantly reduce the computation time cost of the solution exploration space.  ...  Multi-start Local Search Algorithms Based on the Iteration-level In [2, 3] , we have proposed the design and the implementation of the parallel evaluation of the neighborhood (iteration-level) model for  ... 
doi:10.1007/978-3-642-25566-3_24 fatcat:rvl6xe7qvbduxd7ofz7bemi3zi

Particle Swarm Optimization and Other Metaheuristic Methods in Hybrid Flow Shop Scheduling Problem [chapter]

M. Fikret
2009 Particle Swarm Optimization  
system design for parallel computers, traffic control in restricted areas, manufacturing and many others (see for instance (  ...  Hence, many heuristic algorithms are presented in literature to tackle multiprocessor task scheduling problem. Jin et al. (2008) present a performance study of such algorithms.  ...  The system is a multiprocessor architecture designed mainly for machine vision applications.  ... 
doi:10.5772/6746 fatcat:7fjpfhpqojgddgomj5mvnx7hai

Ant colony optimization for mapping and scheduling in heterogeneous multiprocessor systems

Antonino Tumeo, Christian Pilato, Fabrizio Ferrandi, Donatella Sciuto, Pier Luca Lanzi
2008 2008 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation  
We show that this algorithm provides better and more robust solutions in less time than the Simulated Annealing and the Tabu Search algorithms, extended to support the combined scheduling and mapping problems  ...  We propose an implementation of the algorithm that gradually constructs feasible solution instances and searches around them rather than exploring a structure that already considers all the possible solutions  ...  PROBLEM DEFINITION Task mapping and scheduling are two important phases in the design of multiprocessor heterogeneous embedded systems.  ... 
doi:10.1109/icsamos.2008.4664857 dblp:conf/samos/TumeoPFSL08 fatcat:hwrkklmgq5bpnirmanh4kmq4qi

A heuristic method for data allocation and task scheduling on heterogeneous multiprocessor systems under memory constraints [article]

Junwen Ding, Liangcai Song, Siyuan Li, Chen Wu, Ronghua He, Zhouxing Su, Zhipeng Lü
2022 arXiv   pre-print
To solve this problem, we propose a tabu search algorithm (TS) which combines several distinguished features such as a greedy initial solution construction method and a mixed neighborhood evaluation strategy  ...  However, for some workflows, such as the task schedule in a digital signal processor may run out of memory by exposing too much parallelism.  ...  ALGORITHM DESCRIPTION The proposed tabu search algorithm consists of a greedy initial solution construction procedure, the neighbourhood structure, the mixed evaluation strategy, and a tabu search procedure  ... 
arXiv:2206.05268v1 fatcat:v7p3ewsi7zhubambxmygxxqvuu

Hybridized TABU-BFO Algorithmin Grid Scheduling

Devi Priya, Joshua Samuel Raj, V. Vasudeven
2013 International Journal of Computer Applications  
Task Scheduling is an important issue in Grid Environment of multiprocessors system. The problem of scheduling a set of dependent and independent Task in a distributed system is considered.  ...  Bacterial Foraging Optimization Algorithm is a well-known optimization algorithm for Task scheduling.  ...  Tabu search is a "higher level" heuristic procedure for solving optimization problems, designed to guide other methods to escape the trap of local optimality [7] .  ... 
doi:10.5120/10514-5484 fatcat:4ike5w67m5b6pdrn6k47ak66yy

Mathematical models and an elephant herding optimization for multiprocessor-task flexible flow shop scheduling problems in the manufacturing resource planning (MRPII) system

Habib Reza Gholami, Esmaeil Mehdizadeh, Bahman Naderi
2018 Scientia Iranica. International Journal of Science and Technology  
To numerically evaluate the proposed algorithm, it is compared with three available algorithms in the literature.  ...  Although there are several papers considering hybrid flow-shop scheduling problem with multiprocessor tasks, but none propose a mathematical model for this problem.  ...  [16] and Oğuz and Ercan [17] investigated HFS-MT where the subset of machines required for processing of a job at a stage is selective and develop a tabu search and a genetic algorithm, respectively  ... 
doi:10.24200/sci.2018.5552.1343 fatcat:vbo7ezcbknh25gqo4u6reez3wi

Toward Efficient Design Space Exploration for Fault-tolerant Multiprocessor Systems

Bo Yuan, Huanhuan Chen, Xin Yao
2019 IEEE Transactions on Evolutionary Computation  
local search operators are designed for both task hardening and task mapping, reducing the number of fitness evaluations required.  ...  The design space exploration (DSE) of fault-tolerant multiprocessor systems is very complex, as it contains three interacting NP-hard problems: 1) task hardening; 2) task mapping; and 3) task scheduling  ...  algorithm (CCEA); and 3) as a complement to the global search, problem-specific local search operators are designed for both task hardening and task mapping to reduce the number of fitness evaluations  ... 
doi:10.1109/tevc.2019.2912726 fatcat:p7nwjvdeajdidpk35t4d3nphu4

Solving the Resource Constrained Project Scheduling Problem using the parallel Tabu Search designed for the CUDA platform

Libor Bukata, Přemysl Šůcha, Zdeněk Hanzálek
2015 Journal of Parallel and Distributed Computing  
For example, a resource evaluation algorithm is selected by a heuristic and an effective Tabu List was designed.  ...  In the paper, a parallel Tabu Search algorithm for the Resource Constrained Project Scheduling Problem is proposed.  ...  Our proposed Parallel Tabu Search algorithm for the CUDA platform is described in detail in Sections 4, 5, and 6.  ... 
doi:10.1016/j.jpdc.2014.11.005 fatcat:lm2wb4jlyrg4bm2gtfhwwxsxyy

Overlapped Subarray Segmentation: An Efficient Test Method for Cellular Arrays

Earl E. Swartzlander, Miroslaw Malek
1993 VLSI design (Print)  
The high coverage of the proposed technique makes it attractive for testing current VLSI and future WSI arrays.  ...  The ability to detect arbitrary faults involving any cells within a designer selected distance (i.e., the diameter of the subset that is exhaustively tested) is unique to this testing approach.  ...  Surveys and Reviews on Parallel Computing.  ... 
doi:10.1155/1993/76586 fatcat:zswn5ilxsjeibldh5u6b2t2jx4
« Previous Showing results 1 — 15 out of 449 results