A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs:
Abstract: "Parallel algorithms for special cases of the assignment problem have been designed. These algorithms assume the edge weights are integers and within a range. In one case the algorithm is good if the maximum of the absolute values of the edge weights is polynomial in the number of ver...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Kingston, Ontario, Canada
1989
|
| Schriftenreihe: | Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report
258 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Parallel algorithms for special cases of the assignment problem have been designed. These algorithms assume the edge weights are integers and within a range. In one case the algorithm is good if the maximum of the absolute values of the edge weights is polynomial in the number of verticies, n. In another case the time-processor product exceeds the running time for best sequential algorithm for the assignment problem In this paper, we present an adaptive parallel algorithm for the assignment problem of a complete weighted bipartite graph, where the edge weights can be real valued. The algorithm is designed using the exclusive-read exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a complete weighted bipartite graph of n verticies, the algorithm runs in O(n[superscript 3]/p + n[superscript 2]p) time using p processors. We obtain a perfect speedup, with respect to the O(n[superscript 3]) Hungarian method, for p [lesser than or equal to the square root of n]. |
| Beschreibung: | 43 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010657407 | ||
| 003 | DE-604 | ||
| 005 | 19980216 | ||
| 007 | t | ||
| 008 | 960315s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)20977603 | ||
| 035 | |a (DE-599)BVBBV010657407 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 084 | |a DAT 516f |2 stub | ||
| 100 | 1 | |a Osiakwan, Constantine N. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs |c Constantine N. K. Osiakwan and Selim G. Akl |
| 264 | 1 | |a Kingston, Ontario, Canada |c 1989 | |
| 300 | |a 43 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report |v 258 | |
| 520 | 3 | |a Abstract: "Parallel algorithms for special cases of the assignment problem have been designed. These algorithms assume the edge weights are integers and within a range. In one case the algorithm is good if the maximum of the absolute values of the edge weights is polynomial in the number of verticies, n. In another case the time-processor product exceeds the running time for best sequential algorithm for the assignment problem | |
| 520 | 3 | |a In this paper, we present an adaptive parallel algorithm for the assignment problem of a complete weighted bipartite graph, where the edge weights can be real valued. The algorithm is designed using the exclusive-read exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a complete weighted bipartite graph of n verticies, the algorithm runs in O(n[superscript 3]/p + n[superscript 2]p) time using p processors. We obtain a perfect speedup, with respect to the O(n[superscript 3]) Hungarian method, for p [lesser than or equal to the square root of n]. | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Akl, Selim G. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computing and Information Science: Technical report |t Queen's University <Kingston, Ontario> |v 258 |w (DE-604)BV010020284 |9 258 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007113820 | ||
Datensatz im Suchindex
| _version_ | 1804125136439214080 |
|---|---|
| any_adam_object | |
| author | Osiakwan, Constantine N. Akl, Selim G. |
| author_facet | Osiakwan, Constantine N. Akl, Selim G. |
| author_role | aut aut |
| author_sort | Osiakwan, Constantine N. |
| author_variant | c n o cn cno s g a sg sga |
| building | Verbundindex |
| bvnumber | BV010657407 |
| classification_tum | DAT 516f |
| ctrlnum | (OCoLC)20977603 (DE-599)BVBBV010657407 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02260nam a2200337 cb4500</leader><controlfield tag="001">BV010657407</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980216 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960315s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20977603</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010657407</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 516f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Osiakwan, Constantine N.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs</subfield><subfield code="c">Constantine N. K. Osiakwan and Selim G. Akl</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kingston, Ontario, Canada</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">43 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report</subfield><subfield code="v">258</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Parallel algorithms for special cases of the assignment problem have been designed. These algorithms assume the edge weights are integers and within a range. In one case the algorithm is good if the maximum of the absolute values of the edge weights is polynomial in the number of verticies, n. In another case the time-processor product exceeds the running time for best sequential algorithm for the assignment problem</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In this paper, we present an adaptive parallel algorithm for the assignment problem of a complete weighted bipartite graph, where the edge weights can be real valued. The algorithm is designed using the exclusive-read exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a complete weighted bipartite graph of n verticies, the algorithm runs in O(n[superscript 3]/p + n[superscript 2]p) time using p processors. We obtain a perfect speedup, with respect to the O(n[superscript 3]) Hungarian method, for p [lesser than or equal to the square root of n].</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Akl, Selim G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computing and Information Science: Technical report</subfield><subfield code="t">Queen's University <Kingston, Ontario></subfield><subfield code="v">258</subfield><subfield code="w">(DE-604)BV010020284</subfield><subfield code="9">258</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007113820</subfield></datafield></record></collection> |
| id | DE-604.BV010657407 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:56:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007113820 |
| oclc_num | 20977603 |
| open_access_boolean | |
| physical | 43 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report |
| spelling | Osiakwan, Constantine N. Verfasser aut A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs Constantine N. K. Osiakwan and Selim G. Akl Kingston, Ontario, Canada 1989 43 S. txt rdacontent n rdamedia nc rdacarrier Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report 258 Abstract: "Parallel algorithms for special cases of the assignment problem have been designed. These algorithms assume the edge weights are integers and within a range. In one case the algorithm is good if the maximum of the absolute values of the edge weights is polynomial in the number of verticies, n. In another case the time-processor product exceeds the running time for best sequential algorithm for the assignment problem In this paper, we present an adaptive parallel algorithm for the assignment problem of a complete weighted bipartite graph, where the edge weights can be real valued. The algorithm is designed using the exclusive-read exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a complete weighted bipartite graph of n verticies, the algorithm runs in O(n[superscript 3]/p + n[superscript 2]p) time using p processors. We obtain a perfect speedup, with respect to the O(n[superscript 3]) Hungarian method, for p [lesser than or equal to the square root of n]. Algorithms Graph theory Parallel processing (Electronic computers) Akl, Selim G. Verfasser aut Department of Computing and Information Science: Technical report Queen's University <Kingston, Ontario> 258 (DE-604)BV010020284 258 |
| spellingShingle | Osiakwan, Constantine N. Akl, Selim G. A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs Algorithms Graph theory Parallel processing (Electronic computers) |
| title | A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs |
| title_auth | A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs |
| title_exact_search | A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs |
| title_full | A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs Constantine N. K. Osiakwan and Selim G. Akl |
| title_fullStr | A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs Constantine N. K. Osiakwan and Selim G. Akl |
| title_full_unstemmed | A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs Constantine N. K. Osiakwan and Selim G. Akl |
| title_short | A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs |
| title_sort | a perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs |
| topic | Algorithms Graph theory Parallel processing (Electronic computers) |
| topic_facet | Algorithms Graph theory Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV010020284 |
| work_keys_str_mv | AT osiakwanconstantinen aperfectspeedupparallelalgorithmfortheassignmentproblemoncompleteweightedbipartitegraphs AT aklselimg aperfectspeedupparallelalgorithmfortheassignmentproblemoncompleteweightedbipartitegraphs |