Distributed deadlock detection: algorithms and proofs
Abstract: "We consider loosely-coupled multiprocessors on which memory is distributed. We discuss transaction schedulers which both serialise transactions and minimize network messages. Two distributed deadlock detection algorithms are given which are 'truly distributed' in the sense...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Manchester
Univ.
1989
|
| Schriftenreihe: | Technical report series / University of Manchester, Department of Computer Science.
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We consider loosely-coupled multiprocessors on which memory is distributed. We discuss transaction schedulers which both serialise transactions and minimize network messages. Two distributed deadlock detection algorithms are given which are 'truly distributed' in the sense that they require no synchronisation procedures or central control. These algorithms can be used in the more general distributed case. Formal proofs of their correctness are given, together with a discussion of their efficiency and a comparison with published algorithms We believe that the formal proof notation and method should be useful for verifying other distributed algorithms where communication is by message passing. |
| Beschreibung: | 24 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035579692 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 090623s1989 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)23609865 | ||
| 035 | |a (DE-599)BVBBV035579692 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Hilditch, Steve |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Distributed deadlock detection |b algorithms and proofs |
| 246 | 1 | 3 | |a Reportnr. UMCS 89 6 1 |
| 264 | 1 | |a Manchester |b Univ. |c 1989 | |
| 300 | |a 24 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Technical report series / University of Manchester, Department of Computer Science. | |
| 520 | 3 | |a Abstract: "We consider loosely-coupled multiprocessors on which memory is distributed. We discuss transaction schedulers which both serialise transactions and minimize network messages. Two distributed deadlock detection algorithms are given which are 'truly distributed' in the sense that they require no synchronisation procedures or central control. These algorithms can be used in the more general distributed case. Formal proofs of their correctness are given, together with a discussion of their efficiency and a comparison with published algorithms | |
| 520 | 3 | |a We believe that the formal proof notation and method should be useful for verifying other distributed algorithms where communication is by message passing. | |
| 650 | 7 | |a Communications |2 sigle | |
| 650 | 7 | |a Computer hardware |2 sigle | |
| 650 | 4 | |a Computer networks | |
| 650 | 4 | |a Microprocessors | |
| 700 | 1 | |a Thomson, Tom |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017635123 | ||
Datensatz im Suchindex
| _version_ | 1804139236981473280 |
|---|---|
| any_adam_object | |
| author | Hilditch, Steve Thomson, Tom |
| author_facet | Hilditch, Steve Thomson, Tom |
| author_role | aut aut |
| author_sort | Hilditch, Steve |
| author_variant | s h sh t t tt |
| building | Verbundindex |
| bvnumber | BV035579692 |
| ctrlnum | (OCoLC)23609865 (DE-599)BVBBV035579692 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01730nam a2200349 c 4500</leader><controlfield tag="001">BV035579692</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090623s1989 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23609865</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035579692</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="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hilditch, Steve</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed deadlock detection</subfield><subfield code="b">algorithms and proofs</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Reportnr. UMCS 89 6 1</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Manchester</subfield><subfield code="b">Univ.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 S.</subfield><subfield code="b">graph. Darst.</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="0" ind2=" "><subfield code="a">Technical report series / University of Manchester, Department of Computer Science.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We consider loosely-coupled multiprocessors on which memory is distributed. We discuss transaction schedulers which both serialise transactions and minimize network messages. Two distributed deadlock detection algorithms are given which are 'truly distributed' in the sense that they require no synchronisation procedures or central control. These algorithms can be used in the more general distributed case. Formal proofs of their correctness are given, together with a discussion of their efficiency and a comparison with published algorithms</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We believe that the formal proof notation and method should be useful for verifying other distributed algorithms where communication is by message passing.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Communications</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer hardware</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Microprocessors</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Thomson, Tom</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017635123</subfield></datafield></record></collection> |
| id | DE-604.BV035579692 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:40:53Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017635123 |
| oclc_num | 23609865 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 24 S. graph. Darst. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Univ. |
| record_format | marc |
| series2 | Technical report series / University of Manchester, Department of Computer Science. |
| spelling | Hilditch, Steve Verfasser aut Distributed deadlock detection algorithms and proofs Reportnr. UMCS 89 6 1 Manchester Univ. 1989 24 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technical report series / University of Manchester, Department of Computer Science. Abstract: "We consider loosely-coupled multiprocessors on which memory is distributed. We discuss transaction schedulers which both serialise transactions and minimize network messages. Two distributed deadlock detection algorithms are given which are 'truly distributed' in the sense that they require no synchronisation procedures or central control. These algorithms can be used in the more general distributed case. Formal proofs of their correctness are given, together with a discussion of their efficiency and a comparison with published algorithms We believe that the formal proof notation and method should be useful for verifying other distributed algorithms where communication is by message passing. Communications sigle Computer hardware sigle Computer networks Microprocessors Thomson, Tom Verfasser aut |
| spellingShingle | Hilditch, Steve Thomson, Tom Distributed deadlock detection algorithms and proofs Communications sigle Computer hardware sigle Computer networks Microprocessors |
| title | Distributed deadlock detection algorithms and proofs |
| title_alt | Reportnr. UMCS 89 6 1 |
| title_auth | Distributed deadlock detection algorithms and proofs |
| title_exact_search | Distributed deadlock detection algorithms and proofs |
| title_full | Distributed deadlock detection algorithms and proofs |
| title_fullStr | Distributed deadlock detection algorithms and proofs |
| title_full_unstemmed | Distributed deadlock detection algorithms and proofs |
| title_short | Distributed deadlock detection |
| title_sort | distributed deadlock detection algorithms and proofs |
| title_sub | algorithms and proofs |
| topic | Communications sigle Computer hardware sigle Computer networks Microprocessors |
| topic_facet | Communications Computer hardware Computer networks Microprocessors |
| work_keys_str_mv | AT hilditchsteve distributeddeadlockdetectionalgorithmsandproofs AT thomsontom distributeddeadlockdetectionalgorithmsandproofs AT hilditchsteve reportnrumcs8961 AT thomsontom reportnrumcs8961 |