A parallel linked list for shared-memory multiprocessors:
Abstract: "In shared-memory parallel computers, if a data structure such as a ring-buffer queue or a linked list is used by many concurrent processes, some kind of concurrency control is needed. One way is to use a high-level concurrency construct such as a monitor [1] [2] [3]. The monitor guar...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Urbana, Ill.
1989
|
| Series: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
879 |
| Subjects: | |
| Summary: | Abstract: "In shared-memory parallel computers, if a data structure such as a ring-buffer queue or a linked list is used by many concurrent processes, some kind of concurrency control is needed. One way is to use a high-level concurrency construct such as a monitor [1] [2] [3]. The monitor guarantees that only one process can access the data structure at a time. If several processes access the structure concurrently, they are serialized by the monitor. In a large parallel computer system, there may be hundreds or thousands of processors executing concurrent processes on a shared structure. A shared data structure protected by a monitor can easily become a bottleneck. Such a serial bottleneck limits the parallelism that can be exploited by the parallel computer system." |
| Physical Description: | 17 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949936 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)22145242 | ||
| 035 | |a (DE-599)BVBBV008949936 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Tang, Peiyi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A parallel linked list for shared-memory multiprocessors |c Peiyi Tang ; Pen-Chung Yew ; Chuan-Qi Zhu |
| 264 | 1 | |a Urbana, Ill. |c 1989 | |
| 300 | |a 17 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 879 | |
| 520 | 3 | |a Abstract: "In shared-memory parallel computers, if a data structure such as a ring-buffer queue or a linked list is used by many concurrent processes, some kind of concurrency control is needed. One way is to use a high-level concurrency construct such as a monitor [1] [2] [3]. The monitor guarantees that only one process can access the data structure at a time. If several processes access the structure concurrently, they are serialized by the monitor. In a large parallel computer system, there may be hundreds or thousands of processors executing concurrent processes on a shared structure. A shared data structure protected by a monitor can easily become a bottleneck. Such a serial bottleneck limits the parallelism that can be exploited by the parallel computer system." | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Multiprocessors | |
| 700 | 1 | |a Yew, Pen-Chung |e Verfasser |4 aut | |
| 700 | 1 | |a Zhu, Chuan-Qi |e Verfasser |4 aut | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 879 |w (DE-604)BV008930033 |9 879 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005905547 | ||
Record in the Search Index
| _version_ | 1804123283147194368 |
|---|---|
| any_adam_object | |
| author | Tang, Peiyi Yew, Pen-Chung Zhu, Chuan-Qi |
| author_facet | Tang, Peiyi Yew, Pen-Chung Zhu, Chuan-Qi |
| author_role | aut aut aut |
| author_sort | Tang, Peiyi |
| author_variant | p t pt p c y pcy c q z cqz |
| building | Verbundindex |
| bvnumber | BV008949936 |
| ctrlnum | (OCoLC)22145242 (DE-599)BVBBV008949936 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01878nam a2200325 cb4500</leader><controlfield tag="001">BV008949936</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22145242</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949936</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tang, Peiyi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A parallel linked list for shared-memory multiprocessors</subfield><subfield code="c">Peiyi Tang ; Pen-Chung Yew ; Chuan-Qi Zhu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">879</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In shared-memory parallel computers, if a data structure such as a ring-buffer queue or a linked list is used by many concurrent processes, some kind of concurrency control is needed. One way is to use a high-level concurrency construct such as a monitor [1] [2] [3]. The monitor guarantees that only one process can access the data structure at a time. If several processes access the structure concurrently, they are serialized by the monitor. In a large parallel computer system, there may be hundreds or thousands of processors executing concurrent processes on a shared structure. A shared data structure protected by a monitor can easily become a bottleneck. Such a serial bottleneck limits the parallelism that can be exploited by the parallel computer system."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yew, Pen-Chung</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Chuan-Qi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">879</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">879</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905547</subfield></datafield></record></collection> |
| id | DE-604.BV008949936 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905547 |
| oclc_num | 22145242 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 17 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| series2 | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| spelling | Tang, Peiyi Verfasser aut A parallel linked list for shared-memory multiprocessors Peiyi Tang ; Pen-Chung Yew ; Chuan-Qi Zhu Urbana, Ill. 1989 17 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 879 Abstract: "In shared-memory parallel computers, if a data structure such as a ring-buffer queue or a linked list is used by many concurrent processes, some kind of concurrency control is needed. One way is to use a high-level concurrency construct such as a monitor [1] [2] [3]. The monitor guarantees that only one process can access the data structure at a time. If several processes access the structure concurrently, they are serialized by the monitor. In a large parallel computer system, there may be hundreds or thousands of processors executing concurrent processes on a shared structure. A shared data structure protected by a monitor can easily become a bottleneck. Such a serial bottleneck limits the parallelism that can be exploited by the parallel computer system." Data structures (Computer science) Multiprocessors Yew, Pen-Chung Verfasser aut Zhu, Chuan-Qi Verfasser aut Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 879 (DE-604)BV008930033 879 |
| spellingShingle | Tang, Peiyi Yew, Pen-Chung Zhu, Chuan-Qi A parallel linked list for shared-memory multiprocessors Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Data structures (Computer science) Multiprocessors |
| title | A parallel linked list for shared-memory multiprocessors |
| title_auth | A parallel linked list for shared-memory multiprocessors |
| title_exact_search | A parallel linked list for shared-memory multiprocessors |
| title_full | A parallel linked list for shared-memory multiprocessors Peiyi Tang ; Pen-Chung Yew ; Chuan-Qi Zhu |
| title_fullStr | A parallel linked list for shared-memory multiprocessors Peiyi Tang ; Pen-Chung Yew ; Chuan-Qi Zhu |
| title_full_unstemmed | A parallel linked list for shared-memory multiprocessors Peiyi Tang ; Pen-Chung Yew ; Chuan-Qi Zhu |
| title_short | A parallel linked list for shared-memory multiprocessors |
| title_sort | a parallel linked list for shared memory multiprocessors |
| topic | Data structures (Computer science) Multiprocessors |
| topic_facet | Data structures (Computer science) Multiprocessors |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT tangpeiyi aparallellinkedlistforsharedmemorymultiprocessors AT yewpenchung aparallellinkedlistforsharedmemorymultiprocessors AT zhuchuanqi aparallellinkedlistforsharedmemorymultiprocessors |