Significance of Problem Solving Parameters on the Performance of Combinatorial Algorithms on Multi-Computer Parallel Architectures

This paper describes the interaction between specific algorithm parameters and the parallel computer architecture. The classes of architectures we consider are those which have inherent distributed control and whose connection structure is regular. Combinatorial problems require solutions which do s...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	McCormack,W M, Gray,F Gail, Haralick,Robert M
Format:	Report
Sprache:	eng
Schlagworte:	Algorithms Combinatorial analysis Computer architecture Computer Hardware Computer logic Interactions Labels Optimization Parallel processing Parameters Performance(Engineering) Problem solving Searching Strategy Theoretical Mathematics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page
container_issue
container_start_page
container_title
container_volume
creator	McCormack,W M Gray,F Gail Haralick,Robert M
description	This paper describes the interaction between specific algorithm parameters and the parallel computer architecture. The classes of architectures we consider are those which have inherent distributed control and whose connection structure is regular. Combinatorial problems require solutions which do searching. This experiment has determined an optimum problem solving strategy for the consistent labeling problem. One combination of factors, depth first search strategy-transmit large problems-transmit 50% of a processor's work, was found to be statistically best, especially for large problem sizes or for architectures with restricted communications paths.
format	Report
fullrecord	<record><control><sourceid>dtic_1RU</sourceid><recordid>TN_cdi_dtic_stinet_ADA112487</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ADA112487</sourcerecordid><originalsourceid>FETCH-dtic_stinet_ADA1124873</originalsourceid><addsrcrecordid>eNqFjDEKwkAQRdNYiHoDi7lAiqigbYiKjRCIvWzW2WRgdldmJx7AkxuC1lb_w3__zbN3Q10gR9YEixAd1BJbRg9N5BeFDmojxqOiJIgBtEeoUVwU_ztU0bcUjEYhw1ByNxbt_YRfB1bKR-I5jIbJxYwjJbYnRauDYFpmM2c44eqbi2x9Pt2qS_5QsvekFFDv5bEsis3usN_-mT8AHUdc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>report</recordtype></control><display><type>report</type><title>Significance of Problem Solving Parameters on the Performance of Combinatorial Algorithms on Multi-Computer Parallel Architectures</title><source>DTIC Technical Reports</source><creator>McCormack,W M ; Gray,F Gail ; Haralick,Robert M</creator><creatorcontrib>McCormack,W M ; Gray,F Gail ; Haralick,Robert M ; VIRGINIA POLYTECHNIC INST AND STATE UNIV BLACKSBURG DEPT OF COMPUTER SCIENCE</creatorcontrib><description>This paper describes the interaction between specific algorithm parameters and the parallel computer architecture. The classes of architectures we consider are those which have inherent distributed control and whose connection structure is regular. Combinatorial problems require solutions which do searching. This experiment has determined an optimum problem solving strategy for the consistent labeling problem. One combination of factors, depth first search strategy-transmit large problems-transmit 50% of a processor's work, was found to be statistically best, especially for large problem sizes or for architectures with restricted communications paths.</description><language>eng</language><subject>Algorithms ; Combinatorial analysis ; Computer architecture ; Computer Hardware ; Computer logic ; Interactions ; Labels ; Optimization ; Parallel processing ; Parameters ; Performance(Engineering) ; Problem solving ; Searching ; Strategy ; Theoretical Mathematics</subject><creationdate>1982</creationdate><rights>APPROVED FOR PUBLIC RELEASE</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,776,881,27544,27545</link.rule.ids><linktorsrc>$$Uhttps://apps.dtic.mil/sti/citations/ADA112487$$EView_record_in_DTIC$$FView_record_in_$$GDTIC$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>McCormack,W M</creatorcontrib><creatorcontrib>Gray,F Gail</creatorcontrib><creatorcontrib>Haralick,Robert M</creatorcontrib><creatorcontrib>VIRGINIA POLYTECHNIC INST AND STATE UNIV BLACKSBURG DEPT OF COMPUTER SCIENCE</creatorcontrib><title>Significance of Problem Solving Parameters on the Performance of Combinatorial Algorithms on Multi-Computer Parallel Architectures</title><description>This paper describes the interaction between specific algorithm parameters and the parallel computer architecture. The classes of architectures we consider are those which have inherent distributed control and whose connection structure is regular. Combinatorial problems require solutions which do searching. This experiment has determined an optimum problem solving strategy for the consistent labeling problem. One combination of factors, depth first search strategy-transmit large problems-transmit 50% of a processor's work, was found to be statistically best, especially for large problem sizes or for architectures with restricted communications paths.</description><subject>Algorithms</subject><subject>Combinatorial analysis</subject><subject>Computer architecture</subject><subject>Computer Hardware</subject><subject>Computer logic</subject><subject>Interactions</subject><subject>Labels</subject><subject>Optimization</subject><subject>Parallel processing</subject><subject>Parameters</subject><subject>Performance(Engineering)</subject><subject>Problem solving</subject><subject>Searching</subject><subject>Strategy</subject><subject>Theoretical Mathematics</subject><fulltext>true</fulltext><rsrctype>report</rsrctype><creationdate>1982</creationdate><recordtype>report</recordtype><sourceid>1RU</sourceid><recordid>eNqFjDEKwkAQRdNYiHoDi7lAiqigbYiKjRCIvWzW2WRgdldmJx7AkxuC1lb_w3__zbN3Q10gR9YEixAd1BJbRg9N5BeFDmojxqOiJIgBtEeoUVwU_ztU0bcUjEYhw1ByNxbt_YRfB1bKR-I5jIbJxYwjJbYnRauDYFpmM2c44eqbi2x9Pt2qS_5QsvekFFDv5bEsis3usN_-mT8AHUdc</recordid><startdate>19820303</startdate><enddate>19820303</enddate><creator>McCormack,W M</creator><creator>Gray,F Gail</creator><creator>Haralick,Robert M</creator><scope>1RU</scope><scope>BHM</scope></search><sort><creationdate>19820303</creationdate><title>Significance of Problem Solving Parameters on the Performance of Combinatorial Algorithms on Multi-Computer Parallel Architectures</title><author>McCormack,W M ; Gray,F Gail ; Haralick,Robert M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-dtic_stinet_ADA1124873</frbrgroupid><rsrctype>reports</rsrctype><prefilter>reports</prefilter><language>eng</language><creationdate>1982</creationdate><topic>Algorithms</topic><topic>Combinatorial analysis</topic><topic>Computer architecture</topic><topic>Computer Hardware</topic><topic>Computer logic</topic><topic>Interactions</topic><topic>Labels</topic><topic>Optimization</topic><topic>Parallel processing</topic><topic>Parameters</topic><topic>Performance(Engineering)</topic><topic>Problem solving</topic><topic>Searching</topic><topic>Strategy</topic><topic>Theoretical Mathematics</topic><toplevel>online_resources</toplevel><creatorcontrib>McCormack,W M</creatorcontrib><creatorcontrib>Gray,F Gail</creatorcontrib><creatorcontrib>Haralick,Robert M</creatorcontrib><creatorcontrib>VIRGINIA POLYTECHNIC INST AND STATE UNIV BLACKSBURG DEPT OF COMPUTER SCIENCE</creatorcontrib><collection>DTIC Technical Reports</collection><collection>DTIC STINET</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>McCormack,W M</au><au>Gray,F Gail</au><au>Haralick,Robert M</au><aucorp>VIRGINIA POLYTECHNIC INST AND STATE UNIV BLACKSBURG DEPT OF COMPUTER SCIENCE</aucorp><format>book</format><genre>unknown</genre><ristype>RPRT</ristype><btitle>Significance of Problem Solving Parameters on the Performance of Combinatorial Algorithms on Multi-Computer Parallel Architectures</btitle><date>1982-03-03</date><risdate>1982</risdate><abstract>This paper describes the interaction between specific algorithm parameters and the parallel computer architecture. The classes of architectures we consider are those which have inherent distributed control and whose connection structure is regular. Combinatorial problems require solutions which do searching. This experiment has determined an optimum problem solving strategy for the consistent labeling problem. One combination of factors, depth first search strategy-transmit large problems-transmit 50% of a processor's work, was found to be statistically best, especially for large problem sizes or for architectures with restricted communications paths.</abstract><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier
ispartof
issn
language	eng
recordid	cdi_dtic_stinet_ADA112487
source	DTIC Technical Reports
subjects	Algorithms Combinatorial analysis Computer architecture Computer Hardware Computer logic Interactions Labels Optimization Parallel processing Parameters Performance(Engineering) Problem solving Searching Strategy Theoretical Mathematics
title	Significance of Problem Solving Parameters on the Performance of Combinatorial Algorithms on Multi-Computer Parallel Architectures
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T13%3A35%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-dtic_1RU&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=unknown&rft.btitle=Significance%20of%20Problem%20Solving%20Parameters%20on%20the%20Performance%20of%20Combinatorial%20Algorithms%20on%20Multi-Computer%20Parallel%20Architectures&rft.au=McCormack,W%20M&rft.aucorp=VIRGINIA%20POLYTECHNIC%20INST%20AND%20STATE%20UNIV%20BLACKSBURG%20DEPT%20OF%20COMPUTER%20SCIENCE&rft.date=1982-03-03&rft_id=info:doi/&rft_dat=%3Cdtic_1RU%3EADA112487%3C/dtic_1RU%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true