Synchronization algorithms and concurrent programming:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Harlow, Eng. ; Munich [u.a.]
Pearson/Prentice Hall
2006
|
| Ausgabe: | 1. publ. |
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016079418&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | XV, 423 S. graph. Darst. |
| ISBN: | 0131972596 9780131972599 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV022874361 | ||
| 003 | DE-604 | ||
| 005 | 20090511 | ||
| 007 | t| | ||
| 008 | 071010s2006 xxkd||| |||| 00||| eng d | ||
| 010 | |a 2006040785 | ||
| 020 | |a 0131972596 |c pbk. |9 0-13-197259-6 | ||
| 020 | |a 9780131972599 |9 978-0-13-197259-9 | ||
| 035 | |a (OCoLC)70060447 | ||
| 035 | |a (DE-599)BVBBV022874361 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxk |c GB | ||
| 049 | |a DE-703 |a DE-473 |a DE-739 | ||
| 050 | 0 | |a QA76.9.D5 | |
| 082 | 0 | |a 004/.35 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Taubenfeld, Gadi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Synchronization algorithms and concurrent programming |c Gadi Taubenfeld |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Harlow, Eng. ; Munich [u.a.] |b Pearson/Prentice Hall |c 2006 | |
| 300 | |a XV, 423 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Electronic data processing |x Distributed processing | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Synchronisierung |0 (DE-588)4130847-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Synchronisierung |0 (DE-588)4130847-5 |D s |
| 689 | 0 | 2 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | 3 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016079418&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-016079418 | |
Datensatz im Suchindex
| _version_ | 1819295260928376832 |
|---|---|
| adam_text | CONTENTS PREFACE KEY FEATURES CHAPTER 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7
CHAPTER 2 2.1 INTRODUCTION CONCURRENT AND DISTRIBUTED COMPUTING 1.1.1
DATA COMMUNICATION AND SYNCHRONIZATION 1.1.2 CONTENTION, COOPERATION,
AND RESOURCE ALLOCATION SYNCHRONIZATION: TWO EXAMPLES 1.2.1 WHY IS
SYNCHRONIZATION DIFFICULT? 1.2.2 TOOMUCHMILK 1.2.3 THE COORDINATED
ATTACK PROBLEM THE MUTUAL EXCLUSION PROBLEM 1.3.1 THE PROBLEM 1.3.2
COMMENTS COMPLEXITY MEASURES 1.4.1 COUNTING STEPS 1.4.2 COUNTING TIME
UNITS 1.4,3 COUNTING REMOTE MEMORY ACCESSES 1.4.4 SPACE COMPLEXITY
PROCESSES, THREADS AND SCHEDULING 1.5.1 PROCESSES 1,5.2 THREADS 1.5.3
SCHEDULING BIBLIOGRAPHIE NOTES PROBLEMS MUTUAL EXCLUSION USING ATOMIC
REGISTERS: BASIC TOPICS ALGORITHMS FOR TWO PROCESSES XIII XV 1 1 2 2 3 3
4 8 10 11 13 14 14 15 16 17 17 17 18 19 22 23 31 31 VUEI 2.1.1 PETERSON S
ALGORITHM 32 2.1,2 KESSELS SINGLE-WRITER ALGORITHM 35 ^ 2,2 TOURNAMENT
ALGORITHMS 37 2.2.1 A SOLUTION BASED ON PETERSON S ALGORITHM 38 JJ?
2.2.2 A SOLUTION BASED ON KESSELS ALGORITHM 40 CF 2.3 A FAST MUTUAL
EXCLUSION ALGORITHM 42 2.3.1 LAMPORT S FAST ALGORITHM 42 2.3.2 A SIMPLE
OBSERVATION 46 2.4 STARVATION-FREE ALGORITHMS 47 2.4.1 BASIC DEFINITIONS
4G 2.4.2 THE BAKERY ALGORITHM 49 2.4.3 THE BLACK-WHITE BAKERY ALGORITHM
55 2.5 TIGHT SPACE BOUNDS 5§ 2.5.1 A LOWER BOUND 59 2.5.2 AN UPPER
BOUND: THE ONE-BIT ALGORITHM 63 2.5.3 COMPUTING WITH INFINITEIY MANY
PROCESSES 66 2.6 AUTOMATIC DISCOVERY OF ALGORITHMS 68 2.6.1 THREE
ALGORITHMS ^ 2.6.2 MORE RESULTS 70 2.7 BIBLIOGRAPHIE NOTES 71 2.8
PROBLEMS 74 CHAPTER 3 MUTUAL EXDUSION USING ATOMIC REGISTERS: ADVANCED
TOPICS 97 3.1 LOCAL SPINNING ALGORITHMS 97 3.1.1 LOCAL SPINNING 9G 3.1.2
THE LOCAL SPINNING BLACK-WHITE BAKERY ALGORITHM 99 3.1.3 A LOCAL
SPINNING TOURNAMENT ALGORITHM 101 3.2 ADAPTIVE ALGORITHMS 104 3.2.1
BASIC DEFINITIONS 104 3.2.2 A SIMPLE ADAPTIVE ALGORITHM 105 3.2.3 AN
ADAPTIVE TOURNAMENT ALGORITHM 110 3.2.4 THE ADAPTIVE BLACK-WHITE BAKERY
ALGORITHM 116 3.2.5 AN IMPOSSI BILITY RESULT 119 3.3 FAULT-TOLERANT
ALGORITHMS 122 3.3.1 DEFINING FAULT-TOLERANCE 123 3.3.2 A FAULT-TOLERANT
ALGORITHM 124 3.3.3 SELF-STABILIZATION 127 3.4 SYMMETRIE ALGORITHMS 129
3.4.1 SYMMETRIE DEADLOCK-FREE ALGORITHMS 130 3.4.2 SYMMETRIE
STARVATION-FREE ALGORITHMS 132 3.4.3 OBSERVATIONS ABOUT CONCURRENCY 132
3.5 BIBLIOGRAPHIE NOTES I33 3.6 PROBLEMS 13G CHAPTER 4 BLOCKINGAND
NON-BLOCKING SYNCHRONIZATION 147 4.1 SYNCHRONIZATION PRIMITIVES 147
4.1.1 ATOMIC OPERATIONS 148 4.1.2 OBJECTS 150 4.1.3 NON-ATOMIC REGISTERS
152 4.2 COUISION AVOIDANCE USING TEST-AND-SET BITS 153 4.2.1 A TRIVIAL
DEADLOCK-FREE ALGORITHM 153 4.2.2 USING A TEST-AND-TEST-AND-SET BIT 154
4.2.3 COUISION AVOIDANCE LOCKS 155 4.2.4 A FAST STARVATIONTREE ALGORITHM
156 4.3 THE TICKET ALGORITHM USING RMW OBJECTS 157 4.3.1 THE TICKET
ALGORITHM 158 4.3.2 A SIMPLE LOWER BOUND 159 4.4 LOCAL SPINNING USING
STRONG PRIMITIVES 160 4.4.1 ANDERSON S QUEUE-BASED ALGORITHM 160 4.4.2
GRAUNKE AND THAKKAR QUEUE-BASED ALGORITHM 163 4.4.3 THE MCS QUEUE-BASED
ALGORITHM 165 4.5 CONCURRENT DATA STRUCTURES 169 4.5.1 NON-BLOCKING AND
WAIT-FREE SYNCHRONIZATION 170 4.5.2 A NON-BLOCKING CONCURRENT QUEUE
ALGORITHM 171 4.6 SEMAPHORES 176 4.6.1 CONSTANT SPACE STARVATION-FREE
ALGORITHM 178 4.6.2 CORRECTNESS PROOF 179 4.7 MONITORS 181 4.8 FAIRNESS
OF SHARED OBJECTS 183 4.8.1 FAIRNESS PROPERTIES 183 4.8.2 BASIC RESULTS
184 4.8.3 ALGORITHMS 186 4.9 BIBLIOGRAPHIE NOTES 189 4.10 PROBLEMS 194
CHAPTER 5 BARRIER SYNCHRONIZATION 203 5.1 BARRIERS 203 5.2 ATOMIC
COUNTER 204 5.2.1 A SIMPLE COUNTER BARRIER 204 5.2.2 A LOCAL SPINNING
COUNTER BARRIER 206 5.2.3 A BARRIER WITHOUT SHARED MEMORY INITIALIZATION
206 5.3 TEST-AND-SET BITS 207 5.3.1 A CONSTANT SPACE BARRIER 207 5.3.2
AN ASYMMETRIE BARRIER WITHOUT MEMORY INITIALIZATION 208 5.4 COMBINING
TREE BARRIERS 210 5.5 A TREE-BASED BARRIER 212 5.6 THE DISSEMINATION
BARRIER 213 5.7 THE SEE-SAW BARRIER 215 5.7.1 THE ALGORITHM 215 5.7.2
CORRECTNESS PROOF 5.8 SEMAPHORES 5.9 BIBLIOGRAPHIE NOTES 5.10 PROBLEMS
CHAPTER 6 THE ^-EXCLUSION PROBLEM 6.1 THE PROBLEM 7.2.1 7.2.2 7.3.1 THE
PROBLEM 7.3.2 THE BANKER S ALGORITHM THE DINING PHILOSOPHERS PROBLEM
7.4.1 THE PROBLEM 7.4.2 PRELIMINARIES 218 219 221 222 227 227 6.2
ALGORITHMS USING ATOMIC REGISTERS 2 29 6.2.1 AN ^-STARVATION-FREE
ALGORITHM 229 6.2.2 AN UNBOUNDED FIFOENABLING ALGORITHM 231 6.3 USING A
SINGLE READ-MODIFY-WRITE REGISTER 234 6.3.1 THE COUNTER ALGORITHM 2 34
6.3.2 THE NUMBERED TICKET ALGORITHM 2 35 6.3.3 THE UNBOUNDED COLORED
TICKET ALGORITHM 236 6.3.4 THE BOUNDED COLORED TICKET ALGORITHM 238 6.4
THE *-ASSIGNMENT PROBLEM 241 6.5 BIBLIOGRAPHIE NOTES 1A - 6.6 PROBLEMS
Z A 245 249 CHAPTER 7 MULTIPLE RESOURCES 7.1 DEADLOCKS 7.2 DEADLOCK
PREVENTION TWO PHASE LOCKING AND TIMESTAMPING-ORDERING 252 THE TOTAL
ORDER THEOREM 7 R , 249 252 ^* V LUW , UM^ JNEOREM 253 DEADLOCK
AVOIDANCE: THE PROBLEM OF DEADLY EMBRACE 255 255 7.4 THE DININCR
PH;W,R,I, A , 0 D_*UI JD 259 259 7.4.3 CONCURRENCY AND ROBUSTNESS 7A9
7.5 HOLD AND WATT STRATEGY 7.5.1 THE LR ALGORITHM 7.5.2 THE LLR
ALGORITHM 7.5.3 A LOWER BOUND 7* W 5 4 RELATIN G CONCURRENCY AND
ROBUSTNESS 269 7.6 WAIT AND RELEASE STRATEGY 269 7.7 RANDOMIZED
ALGORITHMS 271 7.7.1 THE FREE PHILOSOPHERS ALGORITHM 2 72 7 FI L J V TH
F COURTEOUS PHILOSOPHERS ALGORITHM 272 /*8 BIBLIOGRAPHIE NOTES -*. 7.9
PROBLEMS 274 276 263 263 265 267 CHAPTER 8 GASSICAL SYNCHRONIZATION
PROBLEMS 281 8.1 8.2 8.3 8.4 8.5 THE PRODUCER-CONSUMER PROBLEM 8.1.1
ATOMIC REGISTERS 8.1.2 ATOMIC COUNTER 8.1.3 GENERAL SEMAPHORES 8.1.4
BINARY SEMAPHORES 8.1.5 MONITORS 8.1.6 SLEEP AND WAKEUP READERS AND
WRITERS 8.2.1 SEMAPHORES 8.2.2 MONITORS THE SLEEPING BARBER THE
CIGARETTE SMOKER S PROBLEM MORE SYNCHRONIZATION PROBLEMS 8.5.1 GROUP
MUTUAL EXCLUSION AND ROOM SYNCHRON IZATION 8.5.2 CONCURRENT READING AND
WRITING OF CLOCKS 8,5.3 THE CHOICE COORDINATION PROBLEM 8.5.4 THE H 2 OE
PROBLEM 8.5.5 THE ROLLER COASTER PROBLEM BIBLIOGRAPHIE NOTES PROBLEMS
281 282 283 284 284 286 287 288 289 290 292 294 297 297 298 299 300 300
301 303 8.6 8.7 CHAPTER9 CONSENSUS 307 9.1 THE PROBLEM 307 9.2 THREE
SIMPLE CONSENSUS ALGORITHMS 308 9.2.1 A SINGLE 3-VALUED
READ-MODIFY-WRITE REGISTER 308 9.2.2 TWO PROCESSES, TWO
READ-MODIFY-WRITE BITS 309 9.2.3 MANY PROCESSES, FOUR READ-MODIFY-WRITE
BITS 310 9.3 CONSENSUS WITHOUT MEMORY INITIALIZATION 311 9.3.1 THE
ALGORITHM 312 9.3.2 CORRECTNESS PROOF 314 9.4 REACHING CONSENSUS USING A
SHARED QUEUE 316 9.5 IMPOSSIBILITY OF CONSENSUS WITH ONE FAULTY PROCESS
318 9.5.1 A FORMAL MODEL 318 9.5.2 BASIC OBSERVATIONS 320 9.5.3 THE
IMPOSSIBILITY THEOREM 321 9.6 THE RELATIVE POWER OF SYNCHRONIZATION
PRIMITIVES 325 9.7 THE UNIVERSALITY OF CONSENSUS 328 9.7.1 BASIC
DEFMITIONS 328 9.7.2 A UNIVERSAL CONSTRUCTION 330 9.8 BIBLIOGRAPHIE
NOTES 334 9.9 PROBLEMS 336 CHAPTERLO TIMING-BASED ALGORITHMS 10.1
TIMING-BASED SYSTEMS 10.2 MUTUAL EXCLUSION WITH KNOWN DELAYS 10.3 FAST
MUTUAL EXCLUSION WITH KNOWN DELAYS 10.3.1 THE ALGORITHM 10.3.2
COIRECTNESS PROOF 10.4 CONSENSUS WITH KNOWN DELAYS 10.5 FAST CONSENSUS
WITH KNOWN DELAYS 10.5.1 THE ALGORITHM 10.5.2 CORRECTNESS PROOF 10.6
FAST CONSENSUS WITH UNKNOWN DELAYS 10.6.1 THE ALGORITHM 10.6.2
CORRECTNESS PROOF 10.7 FAST MUTUAL EXCLUSION WITH UNKNOWN DELAYS 10.7.1
THE ALGORITHM 10.7.2 CORRECTNESS PROOF 10.7.3 TIME COMPLEXITY 10.8
BIBLIOGRAPHIE NOTES 10.9 PROBLEMS BIBLIOGRAPHY INDEX 417
|
| any_adam_object | 1 |
| author | Taubenfeld, Gadi |
| author_facet | Taubenfeld, Gadi |
| author_role | aut |
| author_sort | Taubenfeld, Gadi |
| author_variant | g t gt |
| building | Verbundindex |
| bvnumber | BV022874361 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.D5 |
| callnumber-search | QA76.9.D5 |
| callnumber-sort | QA 276.9 D5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)70060447 (DE-599)BVBBV022874361 |
| dewey-full | 004/.35 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.35 |
| dewey-search | 004/.35 |
| dewey-sort | 14 235 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01937nam a2200505zc 4500</leader><controlfield tag="001">BV022874361</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090511 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">071010s2006 xxkd||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2006040785</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0131972596</subfield><subfield code="c">pbk.</subfield><subfield code="9">0-13-197259-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780131972599</subfield><subfield code="9">978-0-13-197259-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)70060447</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022874361</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.D5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.35</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Taubenfeld, Gadi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Synchronization algorithms and concurrent programming</subfield><subfield code="c">Gadi Taubenfeld</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Harlow, Eng. ; Munich [u.a.]</subfield><subfield code="b">Pearson/Prentice Hall</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 423 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="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing</subfield><subfield code="x">Distributed processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Synchronisierung</subfield><subfield code="0">(DE-588)4130847-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Synchronisierung</subfield><subfield code="0">(DE-588)4130847-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016079418&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016079418</subfield></datafield></record></collection> |
| id | DE-604.BV022874361 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T13:05:09Z |
| institution | BVB |
| isbn | 0131972596 9780131972599 |
| language | English |
| lccn | 2006040785 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016079418 |
| oclc_num | 70060447 |
| open_access_boolean | |
| owner | DE-703 DE-473 DE-BY-UBG DE-739 |
| owner_facet | DE-703 DE-473 DE-BY-UBG DE-739 |
| physical | XV, 423 S. graph. Darst. |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Pearson/Prentice Hall |
| record_format | marc |
| spellingShingle | Taubenfeld, Gadi Synchronization algorithms and concurrent programming Datenverarbeitung Electronic data processing Distributed processing Parallel programming (Computer science) Computer algorithms Synchronisierung (DE-588)4130847-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Programmierung (DE-588)4076370-5 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4130847-5 (DE-588)4075860-6 (DE-588)4076370-5 (DE-588)4001183-5 |
| title | Synchronization algorithms and concurrent programming |
| title_auth | Synchronization algorithms and concurrent programming |
| title_exact_search | Synchronization algorithms and concurrent programming |
| title_full | Synchronization algorithms and concurrent programming Gadi Taubenfeld |
| title_fullStr | Synchronization algorithms and concurrent programming Gadi Taubenfeld |
| title_full_unstemmed | Synchronization algorithms and concurrent programming Gadi Taubenfeld |
| title_short | Synchronization algorithms and concurrent programming |
| title_sort | synchronization algorithms and concurrent programming |
| topic | Datenverarbeitung Electronic data processing Distributed processing Parallel programming (Computer science) Computer algorithms Synchronisierung (DE-588)4130847-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Programmierung (DE-588)4076370-5 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Datenverarbeitung Electronic data processing Distributed processing Parallel programming (Computer science) Computer algorithms Synchronisierung Parallelverarbeitung Programmierung Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016079418&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT taubenfeldgadi synchronizationalgorithmsandconcurrentprogramming |