A new parallel asynchronous cellular genetic algorithm for scheduling in grids

We propose a new parallel asynchronous cellular genetic algorithm for multi-core processors. The algorithm is applied to the scheduling of independent tasks in a grid. Finding such optimal schedules is in general an NP-hard problem, to which evolutionary algorithms can find near-optimal solutions. W...

Full description

Saved in:
Bibliographic Details
Main Authors: Pinel, Frederic, Dorronsoro, Bernabe, Bouvry, Pascal
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Concurrent computing
Genetic algorithms
Iterative algorithms
Multicore processing
Optimal scheduling
Parallel processing
Processor scheduling
Scheduling algorithm
Space exploration
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 8
container_issue
container_start_page 1
container_title
container_volume
creator Pinel, Frederic
Dorronsoro, Bernabe
Bouvry, Pascal
description We propose a new parallel asynchronous cellular genetic algorithm for multi-core processors. The algorithm is applied to the scheduling of independent tasks in a grid. Finding such optimal schedules is in general an NP-hard problem, to which evolutionary algorithms can find near-optimal solutions. We analyze the parallelism of the algorithm, as well as different recombination and new local search operators. The proposed algorithm improves previous schedules on benchmark problems. The parallelism of this algorithm suits it to bigger problem instances.
doi_str_mv 10.1109/IPDPSW.2010.5470698
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5470698</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5470698</ieee_id><sourcerecordid>5470698</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1358-2d66575937896a168a5b068893dcbf1d5b80d0596e15b3682d3d4763ee596c3e3</originalsourceid><addsrcrecordid>eNo1kMtKAzEYhSMiqHWeoJu8wNTcJ1mWemmhaEFFdyWT_DMTSWdK0kH69hasZ_NxvsVZHISmlMwoJeZ-tXnYvH3OGDkJKSqijL5At1QwIZTk7OsSFabS_52Ta1Tk_E1OEZIpIm7Qyxz38IP3NtkYIWKbj73r0tAPY8YOYhyjTbiFHg7BYRvbIYVDt8PNkHB2Hfgxhr7FocdtCj7foavGxgzFmRP08fT4vliW69fn1WK-LgPlUpfMKyUraXiljbJUaStrorQ23Lu6oV7WmngijQIqa64089yLSnGAk3Mc-ARN_3YDAGz3KexsOm7PF_BfcmpPtQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A new parallel asynchronous cellular genetic algorithm for scheduling in grids</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Pinel, Frederic ; Dorronsoro, Bernabe ; Bouvry, Pascal</creator><creatorcontrib>Pinel, Frederic ; Dorronsoro, Bernabe ; Bouvry, Pascal</creatorcontrib><description>We propose a new parallel asynchronous cellular genetic algorithm for multi-core processors. The algorithm is applied to the scheduling of independent tasks in a grid. Finding such optimal schedules is in general an NP-hard problem, to which evolutionary algorithms can find near-optimal solutions. We analyze the parallelism of the algorithm, as well as different recombination and new local search operators. The proposed algorithm improves previous schedules on benchmark problems. The parallelism of this algorithm suits it to bigger problem instances.</description><identifier>ISBN: 9781424465330</identifier><identifier>ISBN: 1424465338</identifier><identifier>EISBN: 142446532X</identifier><identifier>EISBN: 9781424465347</identifier><identifier>EISBN: 1424465346</identifier><identifier>EISBN: 9781424465323</identifier><identifier>DOI: 10.1109/IPDPSW.2010.5470698</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Concurrent computing ; Genetic algorithms ; Iterative algorithms ; Multicore processing ; Optimal scheduling ; Parallel processing ; Processor scheduling ; Scheduling algorithm ; Space exploration</subject><ispartof>2010 IEEE International Symposium on Parallel &amp; Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010, p.1-8</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5470698$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5470698$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Pinel, Frederic</creatorcontrib><creatorcontrib>Dorronsoro, Bernabe</creatorcontrib><creatorcontrib>Bouvry, Pascal</creatorcontrib><title>A new parallel asynchronous cellular genetic algorithm for scheduling in grids</title><title>2010 IEEE International Symposium on Parallel &amp; Distributed Processing, Workshops and Phd Forum (IPDPSW)</title><addtitle>IPDPSW</addtitle><description>We propose a new parallel asynchronous cellular genetic algorithm for multi-core processors. The algorithm is applied to the scheduling of independent tasks in a grid. Finding such optimal schedules is in general an NP-hard problem, to which evolutionary algorithms can find near-optimal solutions. We analyze the parallelism of the algorithm, as well as different recombination and new local search operators. The proposed algorithm improves previous schedules on benchmark problems. The parallelism of this algorithm suits it to bigger problem instances.</description><subject>Algorithm design and analysis</subject><subject>Concurrent computing</subject><subject>Genetic algorithms</subject><subject>Iterative algorithms</subject><subject>Multicore processing</subject><subject>Optimal scheduling</subject><subject>Parallel processing</subject><subject>Processor scheduling</subject><subject>Scheduling algorithm</subject><subject>Space exploration</subject><isbn>9781424465330</isbn><isbn>1424465338</isbn><isbn>142446532X</isbn><isbn>9781424465347</isbn><isbn>1424465346</isbn><isbn>9781424465323</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1kMtKAzEYhSMiqHWeoJu8wNTcJ1mWemmhaEFFdyWT_DMTSWdK0kH69hasZ_NxvsVZHISmlMwoJeZ-tXnYvH3OGDkJKSqijL5At1QwIZTk7OsSFabS_52Ta1Tk_E1OEZIpIm7Qyxz38IP3NtkYIWKbj73r0tAPY8YOYhyjTbiFHg7BYRvbIYVDt8PNkHB2Hfgxhr7FocdtCj7foavGxgzFmRP08fT4vliW69fn1WK-LgPlUpfMKyUraXiljbJUaStrorQ23Lu6oV7WmngijQIqa64089yLSnGAk3Mc-ARN_3YDAGz3KexsOm7PF_BfcmpPtQ</recordid><startdate>201004</startdate><enddate>201004</enddate><creator>Pinel, Frederic</creator><creator>Dorronsoro, Bernabe</creator><creator>Bouvry, Pascal</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201004</creationdate><title>A new parallel asynchronous cellular genetic algorithm for scheduling in grids</title><author>Pinel, Frederic ; Dorronsoro, Bernabe ; Bouvry, Pascal</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1358-2d66575937896a168a5b068893dcbf1d5b80d0596e15b3682d3d4763ee596c3e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithm design and analysis</topic><topic>Concurrent computing</topic><topic>Genetic algorithms</topic><topic>Iterative algorithms</topic><topic>Multicore processing</topic><topic>Optimal scheduling</topic><topic>Parallel processing</topic><topic>Processor scheduling</topic><topic>Scheduling algorithm</topic><topic>Space exploration</topic><toplevel>online_resources</toplevel><creatorcontrib>Pinel, Frederic</creatorcontrib><creatorcontrib>Dorronsoro, Bernabe</creatorcontrib><creatorcontrib>Bouvry, Pascal</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Pinel, Frederic</au><au>Dorronsoro, Bernabe</au><au>Bouvry, Pascal</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A new parallel asynchronous cellular genetic algorithm for scheduling in grids</atitle><btitle>2010 IEEE International Symposium on Parallel &amp; Distributed Processing, Workshops and Phd Forum (IPDPSW)</btitle><stitle>IPDPSW</stitle><date>2010-04</date><risdate>2010</risdate><spage>1</spage><epage>8</epage><pages>1-8</pages><isbn>9781424465330</isbn><isbn>1424465338</isbn><eisbn>142446532X</eisbn><eisbn>9781424465347</eisbn><eisbn>1424465346</eisbn><eisbn>9781424465323</eisbn><abstract>We propose a new parallel asynchronous cellular genetic algorithm for multi-core processors. The algorithm is applied to the scheduling of independent tasks in a grid. Finding such optimal schedules is in general an NP-hard problem, to which evolutionary algorithms can find near-optimal solutions. We analyze the parallelism of the algorithm, as well as different recombination and new local search operators. The proposed algorithm improves previous schedules on benchmark problems. The parallelism of this algorithm suits it to bigger problem instances.</abstract><pub>IEEE</pub><doi>10.1109/IPDPSW.2010.5470698</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781424465330
ispartof 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010, p.1-8
issn
language eng
recordid cdi_ieee_primary_5470698
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Algorithm design and analysis
Concurrent computing
Genetic algorithms
Iterative algorithms
Multicore processing
Optimal scheduling
Parallel processing
Processor scheduling
Scheduling algorithm
Space exploration
title A new parallel asynchronous cellular genetic algorithm for scheduling in grids
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T21%3A32%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20new%20parallel%20asynchronous%20cellular%20genetic%20algorithm%20for%20scheduling%20in%20grids&rft.btitle=2010%20IEEE%20International%20Symposium%20on%20Parallel%20&%20Distributed%20Processing,%20Workshops%20and%20Phd%20Forum%20(IPDPSW)&rft.au=Pinel,%20Frederic&rft.date=2010-04&rft.spage=1&rft.epage=8&rft.pages=1-8&rft.isbn=9781424465330&rft.isbn_list=1424465338&rft_id=info:doi/10.1109/IPDPSW.2010.5470698&rft.eisbn=142446532X&rft.eisbn_list=9781424465347&rft.eisbn_list=1424465346&rft.eisbn_list=9781424465323&rft_dat=%3Cieee_6IE%3E5470698%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i1358-2d66575937896a168a5b068893dcbf1d5b80d0596e15b3682d3d4763ee596c3e3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5470698&rfr_iscdi=true