An object-oriented approach to a parallel tabu search algorithm for the task scheduling problem

An object-oriented approach to a parallel tabu search algorithm for the task scheduling problem

This work presents a parallel object-oriented tabu search (TS) algorithm for static task scheduling. The scheduling problem and the TS method are separately modeled under an object-oriented approach. The TS parallelization follows a strategy based on multi-search threads and the algorithm is fully i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Silva, M.L., Porto, S.C.S.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Concurrent computing
Greedy algorithms
Java
Processor scheduling
Programming profession
Scheduling algorithm
Scholarships
Simulated annealing
Software algorithms
Software engineering
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 111
container_issue
container_start_page 105
container_title
container_volume
creator Silva, M.L.
Porto, S.C.S.
description This work presents a parallel object-oriented tabu search (TS) algorithm for static task scheduling. The scheduling problem and the TS method are separately modeled under an object-oriented approach. The TS parallelization follows a strategy based on multi-search threads and the algorithm is fully implemented using the Java language. Besides providing a new scheduling algorithm, this work contributes to demonstrate: the strength of object-orientation also in this field of applications; the adaptability of TS to asynchronous parallelization; the significance of diversification in TS algorithms; and the potential of the Java language in implementing highly portable object-oriented parallel software.
doi_str_mv 10.1109/SCCC.1999.810160
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_810160</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>810160</ieee_id><sourcerecordid>810160</sourcerecordid><originalsourceid>FETCH-LOGICAL-i89t-b215442209928cbbd4f29073c88fff586c92360cbc84f61f10a75bb3b0e81bdb3</originalsourceid><addsrcrecordid>eNotkL1OwzAURi1-JNLCjpj8AinXN4njO1YRFKRKDHSvbMduUtwmctyBtydSmb7hfDrDYexZwEoIoNfvpmlWgohWSoCQcMMylCRykAXesgXUkipAknjHMlEh5iUBPrDFNB0BcCYiY_v1mQ_m6GzKh9i7c3It1-MYB207ngau-aijDsEFnrS58MnpOBMdDvM9dSfuh8hT52Y6_fDJdq69hP584LPCBHd6ZPdeh8k9_e-S7d7fds1Hvv3afDbrbd4rSrlBUZUlIhChssa0pUeCurBKee8rJS1hIcEaq0ovhReg68qYwoBTwrSmWLKXq7Z3zu3H2J90_N1fsxR_fK1VdQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An object-oriented approach to a parallel tabu search algorithm for the task scheduling problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Silva, M.L. ; Porto, S.C.S.</creator><creatorcontrib>Silva, M.L. ; Porto, S.C.S.</creatorcontrib><description>This work presents a parallel object-oriented tabu search (TS) algorithm for static task scheduling. The scheduling problem and the TS method are separately modeled under an object-oriented approach. The TS parallelization follows a strategy based on multi-search threads and the algorithm is fully implemented using the Java language. Besides providing a new scheduling algorithm, this work contributes to demonstrate: the strength of object-orientation also in this field of applications; the adaptability of TS to asynchronous parallelization; the significance of diversification in TS algorithms; and the potential of the Java language in implementing highly portable object-oriented parallel software.</description><identifier>ISSN: 1522-4902</identifier><identifier>ISBN: 0769502962</identifier><identifier>ISBN: 9780769502960</identifier><identifier>EISSN: 2691-0632</identifier><identifier>DOI: 10.1109/SCCC.1999.810160</identifier><language>eng</language><publisher>IEEE</publisher><subject>Concurrent computing ; Greedy algorithms ; Java ; Processor scheduling ; Programming profession ; Scheduling algorithm ; Scholarships ; Simulated annealing ; Software algorithms ; Software engineering</subject><ispartof>Proceedings. SCCC'99 XIX International Conference of the Chilean Computer Science Society, 1999, p.105-111</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/810160$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/810160$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Silva, M.L.</creatorcontrib><creatorcontrib>Porto, S.C.S.</creatorcontrib><title>An object-oriented approach to a parallel tabu search algorithm for the task scheduling problem</title><title>Proceedings. SCCC'99 XIX International Conference of the Chilean Computer Science Society</title><addtitle>SCCC</addtitle><description>This work presents a parallel object-oriented tabu search (TS) algorithm for static task scheduling. The scheduling problem and the TS method are separately modeled under an object-oriented approach. The TS parallelization follows a strategy based on multi-search threads and the algorithm is fully implemented using the Java language. Besides providing a new scheduling algorithm, this work contributes to demonstrate: the strength of object-orientation also in this field of applications; the adaptability of TS to asynchronous parallelization; the significance of diversification in TS algorithms; and the potential of the Java language in implementing highly portable object-oriented parallel software.</description><subject>Concurrent computing</subject><subject>Greedy algorithms</subject><subject>Java</subject><subject>Processor scheduling</subject><subject>Programming profession</subject><subject>Scheduling algorithm</subject><subject>Scholarships</subject><subject>Simulated annealing</subject><subject>Software algorithms</subject><subject>Software engineering</subject><issn>1522-4902</issn><issn>2691-0632</issn><isbn>0769502962</isbn><isbn>9780769502960</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1999</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkL1OwzAURi1-JNLCjpj8AinXN4njO1YRFKRKDHSvbMduUtwmctyBtydSmb7hfDrDYexZwEoIoNfvpmlWgohWSoCQcMMylCRykAXesgXUkipAknjHMlEh5iUBPrDFNB0BcCYiY_v1mQ_m6GzKh9i7c3It1-MYB207ngau-aijDsEFnrS58MnpOBMdDvM9dSfuh8hT52Y6_fDJdq69hP584LPCBHd6ZPdeh8k9_e-S7d7fds1Hvv3afDbrbd4rSrlBUZUlIhChssa0pUeCurBKee8rJS1hIcEaq0ovhReg68qYwoBTwrSmWLKXq7Z3zu3H2J90_N1fsxR_fK1VdQ</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>Silva, M.L.</creator><creator>Porto, S.C.S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1999</creationdate><title>An object-oriented approach to a parallel tabu search algorithm for the task scheduling problem</title><author>Silva, M.L. ; Porto, S.C.S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i89t-b215442209928cbbd4f29073c88fff586c92360cbc84f61f10a75bb3b0e81bdb3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Concurrent computing</topic><topic>Greedy algorithms</topic><topic>Java</topic><topic>Processor scheduling</topic><topic>Programming profession</topic><topic>Scheduling algorithm</topic><topic>Scholarships</topic><topic>Simulated annealing</topic><topic>Software algorithms</topic><topic>Software engineering</topic><toplevel>online_resources</toplevel><creatorcontrib>Silva, M.L.</creatorcontrib><creatorcontrib>Porto, S.C.S.</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>Silva, M.L.</au><au>Porto, S.C.S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An object-oriented approach to a parallel tabu search algorithm for the task scheduling problem</atitle><btitle>Proceedings. SCCC'99 XIX International Conference of the Chilean Computer Science Society</btitle><stitle>SCCC</stitle><date>1999</date><risdate>1999</risdate><spage>105</spage><epage>111</epage><pages>105-111</pages><issn>1522-4902</issn><eissn>2691-0632</eissn><isbn>0769502962</isbn><isbn>9780769502960</isbn><abstract>This work presents a parallel object-oriented tabu search (TS) algorithm for static task scheduling. The scheduling problem and the TS method are separately modeled under an object-oriented approach. The TS parallelization follows a strategy based on multi-search threads and the algorithm is fully implemented using the Java language. Besides providing a new scheduling algorithm, this work contributes to demonstrate: the strength of object-orientation also in this field of applications; the adaptability of TS to asynchronous parallelization; the significance of diversification in TS algorithms; and the potential of the Java language in implementing highly portable object-oriented parallel software.</abstract><pub>IEEE</pub><doi>10.1109/SCCC.1999.810160</doi><tpages>7</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1522-4902
ispartof Proceedings. SCCC'99 XIX International Conference of the Chilean Computer Science Society, 1999, p.105-111
issn 1522-4902
2691-0632
language eng
recordid cdi_ieee_primary_810160
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Concurrent computing
Greedy algorithms
Java
Processor scheduling
Programming profession
Scheduling algorithm
Scholarships
Simulated annealing
Software algorithms
Software engineering
title An object-oriented approach to a parallel tabu search algorithm for the task scheduling problem
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T09%3A12%3A19IST&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=An%20object-oriented%20approach%20to%20a%20parallel%20tabu%20search%20algorithm%20for%20the%20task%20scheduling%20problem&rft.btitle=Proceedings.%20SCCC'99%20XIX%20International%20Conference%20of%20the%20Chilean%20Computer%20Science%20Society&rft.au=Silva,%20M.L.&rft.date=1999&rft.spage=105&rft.epage=111&rft.pages=105-111&rft.issn=1522-4902&rft.eissn=2691-0632&rft.isbn=0769502962&rft.isbn_list=9780769502960&rft_id=info:doi/10.1109/SCCC.1999.810160&rft_dat=%3Cieee_6IE%3E810160%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=810160&rfr_iscdi=true