Filters








987 Hits in 8.1 sec

Scheduling of parallel programs on configurable multiprocessors by genetic algorithms

Klaudia Dussa-Zieger, Markus Schwehm
1998 International Journal of Approximate Reasoning  
The scheduling of programs on parallel hardware is investigated in order to minimize the response time of the resulting system.  ...  The comparison is based on a large set of problem instances and includes regular task graphs with varying structure and scalable size, which had to be mapped onto a configurable parallel hardware consisting  ...  The goal of the DSPL programming environment is to automate system design and implementation of application programs on dedicated configurable parallel systems. We thank our students T. Walter and M.  ... 
doi:10.1016/s0888-613x(98)10001-4 fatcat:upm3eryny5gshazx3wgt4ydb6i

Task Scheduling in Parallel Systems using Genetic Algorithm

Rachhpal Singh
2014 International Journal of Computer Applications  
In this paper, genetic algorithm based on the principles of evolution to obtain an optimal solution for task scheduling is developed.  ...  The common problem of multiprocessor scheduling can be defined as allocating a task graph in a multiprocessor system so that schedule length can be improved.  ...  R., Gallard R.H, "Solving the parallel task scheduling problem by means of genetic algorithm", National Agency to Promote Science and Technology.  ... 
doi:10.5120/18999-0470 fatcat:jlajegwvh5glngv34yl5z7uf3q

A dual encoding-based meta-heuristic algorithm for solving a constrained hybrid flow shop scheduling problem

Antonio Costa, Fulvio Antonio Cappadonna, Sergio Fichera
2013 Computers & industrial engineering  
In the first phase the proposed ME algorithm evolves similarly to a genetic algorithm equipped with a regular permutation encoding.  ...  A mixed integer linear programming model of the problem in hand has been developed with the aim to validate the performance concerning the proposed optimization technique, based on a two-phase metaheuristics  ...  A parallel greedy algorithm approach to the hybrid flow shop with multiprocessor task scheduling problem recently has been carried out by Kaharaman Kaharaman, Engin, Kaya, and Elif Öztürk (2010) .  ... 
doi:10.1016/j.cie.2013.01.004 fatcat:dnwmzxg3qfhwhlramvlx5k7g6m

Low-cost fault tolerance in evolvable multiprocessor systems: a graceful degradation approach

Shervin Vakili, Sied Mehdi Fakhraie, Siamak Mohammadi, Ali Ahmadi
2009 Journal of Zhejiang University: Science A  
The evolvable multiprocessor (EvoMP), as a novel multiprocessor system-on-chip (MPSoC) machine with evolvable task decomposition and scheduling, claims a major feature of low-cost and efficient fault tolerance  ...  In this method, when a processor becomes faulty, it will be eliminated of contribution in program execution in remaining run-time.  ...  Genetic algorithm (GA) is the most popular evolutionary algorithm (EA) inspired by genetic evolution of living organisms.  ... 
doi:10.1631/jzus.a0820803 fatcat:giji7ayg3vfqvku25k7epvrome

Dynamic Task Scheduling Methods in Heterogeneous Systems: A Survey

D. I.GeorgeAmalarethinam, A. Maria Josphin
2015 International Journal of Computer Applications  
Previous studies reveal that many researchers have designed efficient scheduling algorithms with different parameters on multiprocessor systems.  ...  Heterogeneous systems create unlimited opportunities and challenges in the fields of parallel processing, design of algorithms, and partitioning and mapping of parallel tasks.  ...  BNP Scheduling Algorithms Navneet Singh [25] proposed an algorithm called BNP Scheduling, which introduced a parallel program represented by an edge-directed acyclic graph (DAG) to a set of homogenous  ... 
doi:10.5120/19318-0859 fatcat:qxnjvseeajcyfiyzdq4xxtonw4

SCAS-IS: Knowledge Extraction and Reuse in Multiprocessor Task Scheduling Based on Cellular Automata

Murillo G. Carneiro, Gina M.B. Oliveira
2012 2012 Brazilian Symposium on Neural Networks  
Parallel program graphs found in literature and others randomly generated were used to test the new model.  ...  Static Task Scheduling Problem (STSP) in multiprocessors is a NP-Complete problem. Cellular Automata (CA) have been recently proposed to solve STSP.  ...  Multiprocessor task scheduling is the process to allocate a set of independent computational tasks in a parallel application into processing nodes of the architecture.  ... 
doi:10.1109/sbrn.2012.46 dblp:conf/sbrn/CarneiroO12 fatcat:md5g6hx3w5d7rl2gds3sd2ezzy

Performance investigations of genetic algorithms on graphics cards

Johannes Hofmann, Steffen Limmer, Dietmar Fey
2013 Swarm and Evolutionary Computation  
Genetic algorithms are one of the most adaptable optimization algorithms.  ...  Our findings also suggest that, starting with the Fermi architecture, all parts of a genetic algorithm should be carried out on the graphics card instead of only part of it.  ...  access by scheduling different blocks.  ... 
doi:10.1016/j.swevo.2013.04.003 fatcat:5ctviohh6nd5bd5p347bbe2f5e

Fast Scheduling and Partitioning Algorithm in the Multi-processor System with Redundant Communication Resources [chapter]

Eryk Laskowski
2002 Lecture Notes in Computer Science  
It is based on list scheduling and utilizes a fast section clustering heuristic for graph partitioning. The experimental results are compared with results of a genetic graph partitioning algorithm.  ...  Parallel program scheduling in such a kind of environment incorporates graph partitioning problem. The paper presents a scheduling algorithm for look-ahead reconfigurable multi-processor systems.  ...  This algorithm uses the same modified ETF heuristic in the first phase. The second phase, which consists of scheduled program graph partitioning by a genetic algorithm, has been presented in [3] .  ... 
doi:10.1007/3-540-48086-2_11 fatcat:fjjhwakuh5ellkpqzorl5nzbau

A hybrid evolutionary approach for heterogeneous multiprocessor scheduling

C. K. Goh, E. J. Teoh, K. C. Tan
2008 Soft Computing - A Fusion of Foundations, Methodologies and Applications  
Preliminary results from simulations demonstrate the effectiveness of the proposed algorithm in finding useful schedule sets based on the set of new benchmark problems.  ...  This article investigates the assignment of tasks with interdependencies in a heterogeneous multiprocessor environment; specific to this problem, task execution time varies depending on the nature of the  ...  Previous works on task scheduling with dependencies usually use a graph representation for either the tasks of the parallel program and the computer model, or both.  ... 
doi:10.1007/s00500-008-0356-2 fatcat:ylfnrib3drbprkipsvedrwwa3q

Data Flow Modelling for Effective Protection of Electronic Health Records (EHRs) in Cloud
english

V.M.Prabha karan, Prof.S.Bala murugan, S.Char anyaa
2015 International Journal of Innovative Research in Computer and Communication Engineering  
Finally we illustrate how a prototype of MyPHRMachines supports the use case of a real world patient.  ...  Personal Health Records (PHRs) should remain the long-term property of patients data.  ...  Researched on proposing an Incremental Genetic Algorithm Approach to for multiprocessor Scheduling.  ... 
doi:10.15680/ijircce.2015.0301025 fatcat:hzfqzzmujjc5posikcxerqb3kq

Multiprocessor scheduling with evolving cellular automata based on ant colony optimization

Toktam Ghafarian, Hossein Deldari, Mohammad-R. Akbarzadeh -T.
2009 2009 14th International CSI Computer Conference  
Multiprocessor Scheduling Problem The precedence task graph is one of the most popular parallel application models.  ...  Cellular automata (CA) can be used for multiprocessor scheduling, but one of the difficulties in using CA is the exponentially increasing number of rules with increasing number of processor and neighborhood  ...  This framework is used to find optimal response time of scheduling parallel tasks in the homogeneous multiprocessor system.  ... 
doi:10.1109/csicc.2009.5349618 fatcat:m3jaodnqcvfozdfwmclifnmgwa

Selected Papers from ReConFig 2008

Lionel Torres, Cesar Torres
2009 International Journal of Reconfigurable Computing  
Ishebebi et al. presents an automated design approach for multiprocessor systems on FPGAs which customizes architectures for parallel programs by simultaneously solving the problems of task mapping, resource  ...  Four papers are within the broad area of automated design and multiprocessors systems on chips. The paper by H.  ...  Ishebebi et al. presents an automated design approach for multiprocessor systems on FPGAs which customizes architectures for parallel programs by simultaneously solving the problems of task mapping, resource  ... 
doi:10.1155/2009/869329 fatcat:zqfusxerbfehlaaycfy47dofly

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  ...  The results obtained by these different techniques are analyzed for different number of jobs and machine configurations.  ...  In general, high performance parallel computing requires two techniques: program partitioning and task scheduling.  ... 
doi:10.1007/3-540-45545-0_16 fatcat:y77xyzsygfdmdlwr5dkhwr62vi

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

Michał Czapiński, Stuart Barnes
2011 Journal of Parallel and Distributed Computing  
The introduction of NVidia's powerful Tesla GPU hardware and Compute Unified Device Architecture (CUDA) platform enable many-core parallel programming.  ...  In this paper, two approaches to parallel GPU evaluation of Permutation Flowshop Scheduling Problem, with makespan and total flowtime criteria, are proposed.  ...  Parallel Genetic Algorithm by Bożejko and Wodecki [2] , Parallel Scatter Search by Bożejko and Wodecki [3] and by Bożejko [1] , and Parallel Simulated Annealing with Genetic Enhancement by Czapiński  ... 
doi:10.1016/j.jpdc.2011.02.006 fatcat:dbuuj7wqjfcn5kzuoyg6d6mham

Parallel Genetic Algorithm for a Flow-Shop Problem with Multiprocessor Tasks [chapter]

C. Oguz, Yu-Fai Fung, M. Fikret Ercan, X. T. Qi
2003 Lecture Notes in Computer Science  
The performance of the parallel genetic algorithm under various conditions and parameters are studied and presented.  ...  A parallel genetic algorithm using multithreaded programming technique is developed to obtain a quick but good solution to the problem.  ...  The work described in this paper was partially supported by a grant from The Hong Kong Polytechnic University (Project no. G-S551).  ... 
doi:10.1007/3-540-44863-2_54 fatcat:s7jdr4prprdx5kkulfskz723mu
« Previous Showing results 1 — 15 out of 987 results