A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem

This work analyses the difficulties of parallelizing the best known sequential algorithm for the 2D cutting stock problem. All the approaches to parallelize the algorithm strive against its highly irregular computation structure and its sequential nature. A distributed-memory parallel algorithm has...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Leon, C., Miranda, G., Rodriguez, C., Segura, C.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Computer architecture Concurrent computing cutting stock problem Data structures Dynamic programming Ethernet networks Libraries load balancing Load management Parallel algorithms synchronization scheme Upper bound
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	434
container_issue
container_start_page	429
container_title
container_volume
creator	Leon, C. Miranda, G. Rodriguez, C. Segura, C.
description	This work analyses the difficulties of parallelizing the best known sequential algorithm for the 2D cutting stock problem. All the approaches to parallelize the algorithm strive against its highly irregular computation structure and its sequential nature. A distributed-memory parallel algorithm has been designed through a time-driven task intercommunication service. The service allows to introduce a load balancing scheme that tries to hide the non-homogeneous work load nature of the involved single tasks. Experimental results obtained for MVAPICH infiniband and MPICH gigabit Ethernet implementations prove the efficiency of the communication and balancing schemes and show the almost linear speedup achieved by the parallel algorithm.
doi_str_mv	10.1109/PDP.2008.31
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4457154</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4457154</ieee_id><sourcerecordid>4457154</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-2d96962017224b39b655ae7ca9249be739f8d2c919955d36027fa05d796ba3c43</originalsourceid><addsrcrecordid>eNotzLtOwzAUAFCLh0QonRhZ_AMp18-bO0YNBaRKRCrMlZO4rcElyHGR-HsGmM52GLsVsBAC6L5t2oUEqBZKnLFCKsTSoIFzNiesAC0ZBRWZC1YIsLa0guQVu56mdwBALalgq5o3YcopdKfsB9665GL0kddxP6aQD0eeR74Z47fn-eC5bPjylHP43PNNHvsP3qaxi_54wy53Lk5-_u-Mva0eXpdP5frl8XlZr8sg0ORSDmTJShAope4UddYY57F3JDV1HhXtqkH2JIiMGZQFiTsHZkCynVO9VjN29_cG7_32K4WjSz9brQ0Ko9UvrE9Kag</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Leon, C. ; Miranda, G. ; Rodriguez, C. ; Segura, C.</creator><creatorcontrib>Leon, C. ; Miranda, G. ; Rodriguez, C. ; Segura, C.</creatorcontrib><description>This work analyses the difficulties of parallelizing the best known sequential algorithm for the 2D cutting stock problem. All the approaches to parallelize the algorithm strive against its highly irregular computation structure and its sequential nature. A distributed-memory parallel algorithm has been designed through a time-driven task intercommunication service. The service allows to introduce a load balancing scheme that tries to hide the non-homogeneous work load nature of the involved single tasks. Experimental results obtained for MVAPICH infiniband and MPICH gigabit Ethernet implementations prove the efficiency of the communication and balancing schemes and show the almost linear speedup achieved by the parallel algorithm.</description><identifier>ISSN: 1066-6192</identifier><identifier>ISBN: 9780769530895</identifier><identifier>ISBN: 0769530893</identifier><identifier>EISSN: 2377-5750</identifier><identifier>DOI: 10.1109/PDP.2008.31</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Computer architecture ; Concurrent computing ; cutting stock problem ; Data structures ; Dynamic programming ; Ethernet networks ; Libraries ; load balancing ; Load management ; Parallel algorithms ; synchronization scheme ; Upper bound</subject><ispartof>16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008), 2008, p.429-434</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/4457154$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4457154$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Leon, C.</creatorcontrib><creatorcontrib>Miranda, G.</creatorcontrib><creatorcontrib>Rodriguez, C.</creatorcontrib><creatorcontrib>Segura, C.</creatorcontrib><title>A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem</title><title>16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)</title><addtitle>EMPDP</addtitle><description>This work analyses the difficulties of parallelizing the best known sequential algorithm for the 2D cutting stock problem. All the approaches to parallelize the algorithm strive against its highly irregular computation structure and its sequential nature. A distributed-memory parallel algorithm has been designed through a time-driven task intercommunication service. The service allows to introduce a load balancing scheme that tries to hide the non-homogeneous work load nature of the involved single tasks. Experimental results obtained for MVAPICH infiniband and MPICH gigabit Ethernet implementations prove the efficiency of the communication and balancing schemes and show the almost linear speedup achieved by the parallel algorithm.</description><subject>Algorithm design and analysis</subject><subject>Computer architecture</subject><subject>Concurrent computing</subject><subject>cutting stock problem</subject><subject>Data structures</subject><subject>Dynamic programming</subject><subject>Ethernet networks</subject><subject>Libraries</subject><subject>load balancing</subject><subject>Load management</subject><subject>Parallel algorithms</subject><subject>synchronization scheme</subject><subject>Upper bound</subject><issn>1066-6192</issn><issn>2377-5750</issn><isbn>9780769530895</isbn><isbn>0769530893</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotzLtOwzAUAFCLh0QonRhZ_AMp18-bO0YNBaRKRCrMlZO4rcElyHGR-HsGmM52GLsVsBAC6L5t2oUEqBZKnLFCKsTSoIFzNiesAC0ZBRWZC1YIsLa0guQVu56mdwBALalgq5o3YcopdKfsB9665GL0kddxP6aQD0eeR74Z47fn-eC5bPjylHP43PNNHvsP3qaxi_54wy53Lk5-_u-Mva0eXpdP5frl8XlZr8sg0ORSDmTJShAope4UddYY57F3JDV1HhXtqkH2JIiMGZQFiTsHZkCynVO9VjN29_cG7_32K4WjSz9brQ0Ko9UvrE9Kag</recordid><startdate>200802</startdate><enddate>200802</enddate><creator>Leon, C.</creator><creator>Miranda, G.</creator><creator>Rodriguez, C.</creator><creator>Segura, C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200802</creationdate><title>A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem</title><author>Leon, C. ; Miranda, G. ; Rodriguez, C. ; Segura, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-2d96962017224b39b655ae7ca9249be739f8d2c919955d36027fa05d796ba3c43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithm design and analysis</topic><topic>Computer architecture</topic><topic>Concurrent computing</topic><topic>cutting stock problem</topic><topic>Data structures</topic><topic>Dynamic programming</topic><topic>Ethernet networks</topic><topic>Libraries</topic><topic>load balancing</topic><topic>Load management</topic><topic>Parallel algorithms</topic><topic>synchronization scheme</topic><topic>Upper bound</topic><toplevel>online_resources</toplevel><creatorcontrib>Leon, C.</creatorcontrib><creatorcontrib>Miranda, G.</creatorcontrib><creatorcontrib>Rodriguez, C.</creatorcontrib><creatorcontrib>Segura, C.</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>Leon, C.</au><au>Miranda, G.</au><au>Rodriguez, C.</au><au>Segura, C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem</atitle><btitle>16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)</btitle><stitle>EMPDP</stitle><date>2008-02</date><risdate>2008</risdate><spage>429</spage><epage>434</epage><pages>429-434</pages><issn>1066-6192</issn><eissn>2377-5750</eissn><isbn>9780769530895</isbn><isbn>0769530893</isbn><abstract>This work analyses the difficulties of parallelizing the best known sequential algorithm for the 2D cutting stock problem. All the approaches to parallelize the algorithm strive against its highly irregular computation structure and its sequential nature. A distributed-memory parallel algorithm has been designed through a time-driven task intercommunication service. The service allows to introduce a load balancing scheme that tries to hide the non-homogeneous work load nature of the involved single tasks. Experimental results obtained for MVAPICH infiniband and MPICH gigabit Ethernet implementations prove the efficiency of the communication and balancing schemes and show the almost linear speedup achieved by the parallel algorithm.</abstract><pub>IEEE</pub><doi>10.1109/PDP.2008.31</doi><tpages>6</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 1066-6192
ispartof	16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008), 2008, p.429-434
issn	1066-6192 2377-5750
language	eng
recordid	cdi_ieee_primary_4457154
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Algorithm design and analysis Computer architecture Concurrent computing cutting stock problem Data structures Dynamic programming Ethernet networks Libraries load balancing Load management Parallel algorithms synchronization scheme Upper bound
title	A Distributed Parallel Algorithm to Solve the 2D Cutting Stock 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-09T11%3A40%3A44IST&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%20Distributed%20Parallel%20Algorithm%20to%20Solve%20the%202D%20Cutting%20Stock%20Problem&rft.btitle=16th%20Euromicro%20Conference%20on%20Parallel,%20Distributed%20and%20Network-Based%20Processing%20(PDP%202008)&rft.au=Leon,%20C.&rft.date=2008-02&rft.spage=429&rft.epage=434&rft.pages=429-434&rft.issn=1066-6192&rft.eissn=2377-5750&rft.isbn=9780769530895&rft.isbn_list=0769530893&rft_id=info:doi/10.1109/PDP.2008.31&rft_dat=%3Cieee_6IE%3E4457154%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=4457154&rfr_iscdi=true