Principles of concurrent and distributed programming:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Harlow u.a.
Addison-Wesley
2007
|
| Edition: | 2. ed., [Nachdr.] |
| Series: | Prentice Hall international series in computer science
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XV, 361 S. graph. Darst. |
| ISBN: | 9780321312839 032131283X |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023220981 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 080318s2007 d||| |||| 00||| eng d | ||
| 020 | |a 9780321312839 |9 978-0-321-31283-9 | ||
| 020 | |a 032131283X |9 0-321-31283-X | ||
| 035 | |a (OCoLC)255868678 | ||
| 035 | |a (DE-599)BVBBV023220981 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 | ||
| 050 | 0 | |a QA76.5 | |
| 082 | 0 | |a 004.35 | |
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Ben-Arî, Môtî |d 1948- |e Verfasser |0 (DE-588)121144844 |4 aut | |
| 245 | 1 | 0 | |a Principles of concurrent and distributed programming |c M. Ben-Ari |
| 250 | |a 2. ed., [Nachdr.] | ||
| 264 | 1 | |a Harlow u.a. |b Addison-Wesley |c 2007 | |
| 300 | |a XV, 361 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Prentice Hall international series in computer science | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 4 | |a Verteiltes Datenverarbeitungssystem |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteiltes System |0 (DE-588)4238872-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Verteiltes System |0 (DE-588)4238872-7 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 1 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Verteiltes System |0 (DE-588)4238872-7 |D s |
| 689 | 2 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 689 | 3 | 0 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |D s |
| 689 | 3 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 3 | |8 3\p |5 DE-604 | |
| 689 | 4 | 0 | |a Verteiltes Datenverarbeitungssystem |A s |
| 689 | 4 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 4 | |8 4\p |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=016406886&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016406886 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804137508300128256 |
|---|---|
| adam_text | PRINCIPLES OF CONCURRENT AND DISTRIBUTED PROGRAMMING SECOND EDITION M.
BEN-ARI ^ ADDISON-WESLEY HARLOW, ENGLAND * LONDON * NEW YORK * BOSTON *
SAN FRANCISCO * TORONTO * SYDNEY * SINGAPORE * HONG KONG TOKYO * SEOUL *
TAIPEI * NEW DELHI * CAPE TOWN * MADRID * MEXICO CITY * AMSTERDAM *
MUNICH * PARIS * MILAN CONTENTS PREFACE XI 1 WHAT IS CONCURRENT
PROGRAMMING? 1 1.1 INTRODUCTION 1 1.2 CONCURRENCY AS ABSTRACT
PARALLELISM 2 1.3 MULTITASKING 4 1.4 THE TERMINOLOGY OF CONCURRENCY 4
1.5 MULTIPLE COMPUTERS 5 1.6 THE CHALLENGE OF CONCURRENT PROGRAMMING 5 2
THE CONCURRENT PROGRAMMING ABSTRACTION 7 2.1 THE ROLE OF ABSTRACTION 7
2.2 CONCURRENT EXECUTION AS INTERLEAVING OF ATOMIC STATEMENTS .... 8 2.3
JUSTIFICATION OF THE ABSTRACTION 13 2.4 ARBITRARY INTERLEAVING 17 2.5
ATOMIC STATEMENTS 19 2.6 CORRECTNESS 21 2.7 FAIRNESS 23 2.8 MACHINE-CODE
INSTRUCTIONS 24 2.9 VOLATILE AND NON-ATOMIC VARIABLES 28 2.10 THE BACI
CONCURRENCY SIMULATOR 29 2.11 CONCURRENCY IN ADA 31 V VI CONTENTS 2.12
CONCURRENCY IN JAVA 34 2.13 WRITING CONCURRENT PROGRAMS IN PROMELA 36
2.14 SUPPLEMENT: THE STATE DIAGRAM FOR THE FROG PUZZLE 37 3 THE CRITICAL
SECTION PROBLEM 45 3.1 INTRODUCTION 45 3.2 THE DEFINITION OF THE PROBLEM
45 3.3 FIRST ATTEMPT 48 3.4 PROVING CORRECTNESS WITH STATE DIAGRAMS 49
3.5 CORRECTNESS OF THE FIRST ATTEMPT 53 3.6 SECOND ATTEMPT 55 3.7 THIRD
ATTEMPT 57 3.8 FOURTH ATTEMPT 58 3.9 DEKKER S ALGORITHM 60 3.10 COMPLEX
ATOMIC STATEMENTS 61 4 VERIFICATION OF CONCURRENT PROGRAMS 67 4.1
LOGICAL SPECIFICATION OF CORRECTNESS PROPERTIES 68 4.2 INDUCTIVE PROOFS
OF INVARIANTS 69 4.3 BASIC CONCEPTS OF TEMPORAL LOGIC 72 4.4 ADVANCED
CONCEPTS OF TEMPORAL LOGIC 75 4.5 A DEDUCTIVE PROOF OF DEKKER S
ALGORITHM 79 4.6 MODEL CHECKING 83 4.7 SPIN AND THE PROMELA MODELING
LANGUAGE 83 4.8 CORRECTNESS SPECIFICATIONS IN SPIN 86 4.9 CHOOSING A
VERIFICATION TECHNIQUE 88 5 ADVANCED ALGORITHMS FOR THE CRITICAL SECTION
PROBLEM 93 5.1 THE BAKERY ALGORITHM 93 5.2 THE BAKERY ALGORITHM FOR N
PROCESSES 95 5.3 LESS RESTRICTIVE MODEIS OF CONCURRENCY 96 CONTENTS VII
5.4 FAST ALGORITHMS 97 5.5 IMPLEMENTATIONS IN PROMELA 104 6 SEMAPHORES
107 6.1 PROCESS STATES 107 6.2 DEFINITION OF THE SEMAPHORE TYPE 109 6.3
THE CRITICAL SECTION PROBLEM FOR TWO PROCESSES 110 6.4 SEMAPHORE
INVARIANTS 112 6.5 THE CRITICAL SECTION PROBLEM FOR N PROCESSES 113 6.6
ORDER OF EXECUTION PROBLEMS 114 6.7 THE PRODUCER-CONSUMER PROBLEM 115
6.8 DEFINITIONS OF SEMAPHORES 119 6.9 THE PROBLEM OF THE DINING
PHILOSOPHERS 122 6.10 BARZ S SIMULATION OF GENERAL SEMAPHORES 126 6.11
UDDING S STARVATION-FREE ALGORITHM 129 6.12 SEMAPHORES IN BACI 131 6.13
SEMAPHORES IN ADA 132 6.14 SEMAPHORES IN JAVA 133 6.15 SEMAPHORES IN
PROMELA 134 7 MONITORS 145 7.1 INTRODUCTION 145 7.2 DECLARING AND USING
MONITORS 146 7.3 CONDITION VARIABLES 147 7.4 THE PRODUCER-CONSUMER
PROBLEM 151 7.5 THE IMMEDIATE RESUMPTION REQUIREMENT 152 7.6 THE PROBLEM
OF THE READERS AND WRITERS 154 7.7 CORRECTNESS OF THE READERS AND
WRITERS ALGORITHM 157 7.8 A MONITOR SOLUTION FOR THE DINING PHILOSOPHERS
160 7.9 MONITORS IN BACI 162 VIII CONTENTS 7.10 PROTECTED OBJECTS 162
7.11 MONITORS IN JAVA 167 7.12 SIMULATING MONITORS IN PROMELA 173 8
CHANNELS 179 8.1 MODELS FOR COMMUNICATIONS 179 8.2 CHANNELS 181 8.3
PARALLEL MATRIX MULTIPLICATION 183 8.4 THE DINING PHILOSOPHERS WITH
CHANNELS 187 8.5 CHANNELS IN PROMELA 188 8.6 RENDEZVOUS 190 8.7 REMOTE
PROCEDURE CALLS 193 9 SPACES 197 9.1 THE LINDA MODEL 197 9.2
EXPRESSIVENESS OF THE LINDA MODEL 199 9.3 FORMAL PARAMETERS 200 9.4 THE
MASTER-WORKER PARADIGM 202 9.5 IMPLEMENTATIONS OF SPACES 204 10
DISTRIBUTED ALGORITHMS 211 10.1 THE DISTRIBUTED SYSTEMS MODEL 211 10.2
IMPLEMENTATIONS 215 10.3 DISTRIBUTED MUTUAL EXCLUSION 216 10.4
CORRECTNESS OF THE RICART-AGRAWALA ALGORITHM 223 10.5 THE RA ALGORITHM
IN PROMELA 225 10.6 TOKEN-PASSING ALGORITHMS 227 10.7 TOKENS IN VIRTUAL
TREES 230 11 GLOBAL PROPERTIES 237 11.1 DISTRIBUTED TERMINATION 237
CONTENTS IX 11.2 THE DIJKSTRA-SCHOLTEN ALGORITHM 243 11.3
CREDIT-RECOVERY ALGORITHMS 248 11.4 SNAPSHOTS 250 12 CONSENSUS 257 12.1
INTRODUCTION 257 12.2 THE PROBLEM STATEMENT 258 12.3 A ONE-ROUND
ALGORITHM 260 12.4 THE BYZANTINE GENERALS ALGORITHM 261 12.5 CRASH
FAILURES 263 12.6 KNOWLEDGE TREES 264 12.7 BYZANTINE FAILURES WITH THREE
GENERALS 266 12.8 BYZANTINE FAILURES WITH FOUR GENERALS 268 12.9 THE
FLOODING ALGORITHM 271 12.10 THE KING ALGORITHM 274 12.11 IMPOSSIBILITY
WITH THREE GENERALS 280 13 REAL-TIME SYSTEMS 285 13.1 INTRODUCTION 285
13.2 DEFINITIONS 287 13.3 RELIABILITY AND REPEATABILITY 288 13.4
SYNCHRONOUS SYSTEMS 290 13.5 ASYNCHRONOUS SYSTEMS 293 13.6
INTERRUPT-DRIVEN SYSTEMS 297 13.7 PRIORITY INVERSION AND PRIORITY
INHERITANCE 299 13.8 THE MARS PATHFINDER IN SPIN 303 13.9 SIMPSON S
FOUR-SLOT ALGORITHM 306 13.10 THE RAVENSCAR PROFILE 309 13.11 UPPAAL 311
13.12 SCHEDULING ALGORITHMS FOR REAL-TIME SYSTEMS 312 X CONTENTS A THE
PSEUDOCODE NOTATION 317 B REVIEW OF MATHEMATICAL LOGIC 321 B.L THE
PROPOSITIONAL CALCULUS 321 B.2 INDUCTION 323 B.3 PROOFMETHODS 324 B.4
CORRECTNESS OF SEQUENTIAL PROGRAMS 326 C CONCURRENT PROGRAMMING PROBLEMS
331 D SOFTWARE TOOLS 339 D.L BACIANDJBACI 339 D.2 SPIN AND JSPIN 341 D.3
DAJ 345 E FURTHER READING 349 BIBLIOGRAPHY 351 INDEX 355 SUPPORTING
RESOURCES VISIT WWW.PEARSONED.CO.UK/BEN-ARI TO FIND VALUABLE ONLINE
RESOURCES COMPANION WEBSITE FOR STUDENTS * SOURCE CODE FOR ALL THE
ALGORITHMS IN THE BOOK * LINKS TO SITES WHERE SOFTWARE FOR STUDYING
CONCURRENCY MAY BE DOWNLOADED. FOR INSTRUCTORS * PDF SLIDES OF ALL
DIAGRAMS, ALGORITHMS AND SCENARIOS (WITH ETGX SOURCE) * ANSWERS TO
EXERCISES FOR MORE INFORMATION PLEASE CONTACT YOUR LOCAL PEARSON
EDUCATION SALES REPRESENTATIVE OR VISIT WWW.PEARSONED.CO.UK/BEN-ARI
|
| adam_txt |
PRINCIPLES OF CONCURRENT AND DISTRIBUTED PROGRAMMING SECOND EDITION M.
BEN-ARI ^ ADDISON-WESLEY HARLOW, ENGLAND * LONDON * NEW YORK * BOSTON *
SAN FRANCISCO * TORONTO * SYDNEY * SINGAPORE * HONG KONG TOKYO * SEOUL *
TAIPEI * NEW DELHI * CAPE TOWN * MADRID * MEXICO CITY * AMSTERDAM *
MUNICH * PARIS * MILAN CONTENTS PREFACE XI 1 WHAT IS CONCURRENT
PROGRAMMING? 1 1.1 INTRODUCTION 1 1.2 CONCURRENCY AS ABSTRACT
PARALLELISM 2 1.3 MULTITASKING 4 1.4 THE TERMINOLOGY OF CONCURRENCY 4
1.5 MULTIPLE COMPUTERS 5 1.6 THE CHALLENGE OF CONCURRENT PROGRAMMING 5 2
THE CONCURRENT PROGRAMMING ABSTRACTION 7 2.1 THE ROLE OF ABSTRACTION 7
2.2 CONCURRENT EXECUTION AS INTERLEAVING OF ATOMIC STATEMENTS . 8 2.3
JUSTIFICATION OF THE ABSTRACTION 13 2.4 ARBITRARY INTERLEAVING 17 2.5
ATOMIC STATEMENTS 19 2.6 CORRECTNESS 21 2.7 FAIRNESS 23 2.8 MACHINE-CODE
INSTRUCTIONS 24 2.9 VOLATILE AND NON-ATOMIC VARIABLES 28 2.10 THE BACI
CONCURRENCY SIMULATOR 29 2.11 CONCURRENCY IN ADA 31 V VI CONTENTS 2.12
CONCURRENCY IN JAVA 34 2.13 WRITING CONCURRENT PROGRAMS IN PROMELA 36
2.14 SUPPLEMENT: THE STATE DIAGRAM FOR THE FROG PUZZLE 37 3 THE CRITICAL
SECTION PROBLEM 45 3.1 INTRODUCTION 45 3.2 THE DEFINITION OF THE PROBLEM
45 3.3 FIRST ATTEMPT 48 3.4 PROVING CORRECTNESS WITH STATE DIAGRAMS 49
3.5 CORRECTNESS OF THE FIRST ATTEMPT 53 3.6 SECOND ATTEMPT 55 3.7 THIRD
ATTEMPT 57 3.8 FOURTH ATTEMPT 58 3.9 DEKKER'S ALGORITHM 60 3.10 COMPLEX
ATOMIC STATEMENTS 61 4 VERIFICATION OF CONCURRENT PROGRAMS 67 4.1
LOGICAL SPECIFICATION OF CORRECTNESS PROPERTIES 68 4.2 INDUCTIVE PROOFS
OF INVARIANTS 69 4.3 BASIC CONCEPTS OF TEMPORAL LOGIC 72 4.4 ADVANCED
CONCEPTS OF TEMPORAL LOGIC 75 4.5 A DEDUCTIVE PROOF OF DEKKER'S
ALGORITHM 79 4.6 MODEL CHECKING 83 4.7 SPIN AND THE PROMELA MODELING
LANGUAGE 83 4.8 CORRECTNESS SPECIFICATIONS IN SPIN 86 4.9 CHOOSING A
VERIFICATION TECHNIQUE 88 5 ADVANCED ALGORITHMS FOR THE CRITICAL SECTION
PROBLEM 93 5.1 THE BAKERY ALGORITHM 93 5.2 THE BAKERY ALGORITHM FOR N
PROCESSES 95 5.3 LESS RESTRICTIVE MODEIS OF CONCURRENCY 96 CONTENTS VII
5.4 FAST ALGORITHMS 97 5.5 IMPLEMENTATIONS IN PROMELA 104 6 SEMAPHORES
107 6.1 PROCESS STATES 107 6.2 DEFINITION OF THE SEMAPHORE TYPE 109 6.3
THE CRITICAL SECTION PROBLEM FOR TWO PROCESSES 110 6.4 SEMAPHORE
INVARIANTS 112 6.5 THE CRITICAL SECTION PROBLEM FOR N PROCESSES 113 6.6
ORDER OF EXECUTION PROBLEMS 114 6.7 THE PRODUCER-CONSUMER PROBLEM 115
6.8 DEFINITIONS OF SEMAPHORES 119 6.9 THE PROBLEM OF THE DINING
PHILOSOPHERS 122 6.10 BARZ'S SIMULATION OF GENERAL SEMAPHORES 126 6.11
UDDING'S STARVATION-FREE ALGORITHM 129 6.12 SEMAPHORES IN BACI 131 6.13
SEMAPHORES IN ADA 132 6.14 SEMAPHORES IN JAVA 133 6.15 SEMAPHORES IN
PROMELA 134 7 MONITORS 145 7.1 INTRODUCTION 145 7.2 DECLARING AND USING
MONITORS 146 7.3 CONDITION VARIABLES 147 7.4 THE PRODUCER-CONSUMER
PROBLEM 151 7.5 THE IMMEDIATE RESUMPTION REQUIREMENT 152 7.6 THE PROBLEM
OF THE READERS AND WRITERS 154 7.7 CORRECTNESS OF THE READERS AND
WRITERS ALGORITHM 157 7.8 A MONITOR SOLUTION FOR THE DINING PHILOSOPHERS
160 7.9 MONITORS IN BACI 162 VIII CONTENTS 7.10 PROTECTED OBJECTS 162
7.11 MONITORS IN JAVA 167 7.12 SIMULATING MONITORS IN PROMELA 173 8
CHANNELS 179 8.1 MODELS FOR COMMUNICATIONS 179 8.2 CHANNELS 181 8.3
PARALLEL MATRIX MULTIPLICATION 183 8.4 THE DINING PHILOSOPHERS WITH
CHANNELS 187 8.5 CHANNELS IN PROMELA 188 8.6 RENDEZVOUS 190 8.7 REMOTE
PROCEDURE CALLS 193 9 SPACES 197 9.1 THE LINDA MODEL 197 9.2
EXPRESSIVENESS OF THE LINDA MODEL 199 9.3 FORMAL PARAMETERS 200 9.4 THE
MASTER-WORKER PARADIGM 202 9.5 IMPLEMENTATIONS OF SPACES 204 10
DISTRIBUTED ALGORITHMS 211 10.1 THE DISTRIBUTED SYSTEMS MODEL 211 10.2
IMPLEMENTATIONS 215 10.3 DISTRIBUTED MUTUAL EXCLUSION 216 10.4
CORRECTNESS OF THE RICART-AGRAWALA ALGORITHM 223 10.5 THE RA ALGORITHM
IN PROMELA 225 10.6 TOKEN-PASSING ALGORITHMS 227 10.7 TOKENS IN VIRTUAL
TREES 230 11 GLOBAL PROPERTIES 237 11.1 DISTRIBUTED TERMINATION 237
CONTENTS IX 11.2 THE DIJKSTRA-SCHOLTEN ALGORITHM 243 11.3
CREDIT-RECOVERY ALGORITHMS 248 11.4 SNAPSHOTS 250 12 CONSENSUS 257 12.1
INTRODUCTION 257 12.2 THE PROBLEM STATEMENT 258 12.3 A ONE-ROUND
ALGORITHM 260 12.4 THE BYZANTINE GENERALS ALGORITHM 261 12.5 CRASH
FAILURES 263 12.6 KNOWLEDGE TREES 264 12.7 BYZANTINE FAILURES WITH THREE
GENERALS 266 12.8 BYZANTINE FAILURES WITH FOUR GENERALS 268 12.9 THE
FLOODING ALGORITHM 271 12.10 THE KING ALGORITHM 274 12.11 IMPOSSIBILITY
WITH THREE GENERALS 280 13 REAL-TIME SYSTEMS 285 13.1 INTRODUCTION 285
13.2 DEFINITIONS 287 13.3 RELIABILITY AND REPEATABILITY 288 13.4
SYNCHRONOUS SYSTEMS 290 13.5 ASYNCHRONOUS SYSTEMS 293 13.6
INTERRUPT-DRIVEN SYSTEMS 297 13.7 PRIORITY INVERSION AND PRIORITY
INHERITANCE 299 13.8 THE MARS PATHFINDER IN SPIN 303 13.9 SIMPSON'S
FOUR-SLOT ALGORITHM 306 13.10 THE RAVENSCAR PROFILE 309 13.11 UPPAAL 311
13.12 SCHEDULING ALGORITHMS FOR REAL-TIME SYSTEMS 312 X CONTENTS A THE
PSEUDOCODE NOTATION 317 B REVIEW OF MATHEMATICAL LOGIC 321 B.L THE
PROPOSITIONAL CALCULUS 321 B.2 INDUCTION 323 B.3 PROOFMETHODS 324 B.4
CORRECTNESS OF SEQUENTIAL PROGRAMS 326 C CONCURRENT PROGRAMMING PROBLEMS
331 D SOFTWARE TOOLS 339 D.L BACIANDJBACI 339 D.2 SPIN AND JSPIN 341 D.3
DAJ 345 E FURTHER READING 349 BIBLIOGRAPHY 351 INDEX 355 SUPPORTING
RESOURCES VISIT WWW.PEARSONED.CO.UK/BEN-ARI TO FIND VALUABLE ONLINE
RESOURCES COMPANION WEBSITE FOR STUDENTS * SOURCE CODE FOR ALL THE
ALGORITHMS IN THE BOOK * LINKS TO SITES WHERE SOFTWARE FOR STUDYING
CONCURRENCY MAY BE DOWNLOADED. FOR INSTRUCTORS * PDF SLIDES OF ALL
DIAGRAMS, ALGORITHMS AND SCENARIOS (WITH ETGX SOURCE) * ANSWERS TO
EXERCISES FOR MORE INFORMATION PLEASE CONTACT YOUR LOCAL PEARSON
EDUCATION SALES REPRESENTATIVE OR VISIT WWW.PEARSONED.CO.UK/BEN-ARI |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Ben-Arî, Môtî 1948- |
| author_GND | (DE-588)121144844 |
| author_facet | Ben-Arî, Môtî 1948- |
| author_role | aut |
| author_sort | Ben-Arî, Môtî 1948- |
| author_variant | m b a mba |
| building | Verbundindex |
| bvnumber | BV023220981 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.5 |
| callnumber-search | QA76.5 |
| callnumber-sort | QA 276.5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 230 |
| ctrlnum | (OCoLC)255868678 (DE-599)BVBBV023220981 |
| 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.35 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| edition | 2. ed., [Nachdr.] |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02652nam a2200637 c 4500</leader><controlfield tag="001">BV023220981</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080318s2007 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780321312839</subfield><subfield code="9">978-0-321-31283-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">032131283X</subfield><subfield code="9">0-321-31283-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)255868678</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023220981</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.35</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ben-Arî, Môtî</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121144844</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Principles of concurrent and distributed programming</subfield><subfield code="c">M. Ben-Ari</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed., [Nachdr.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Harlow u.a.</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 361 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">Prentice Hall international series in computer science</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="650" ind1="0" ind2="4"><subfield code="a">Verteiltes Datenverarbeitungssystem</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">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</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">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Verteiltes Datenverarbeitungssystem</subfield><subfield code="A">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">4\p</subfield><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=016406886&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016406886</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV023220981 |
| illustrated | Illustrated |
| index_date | 2024-07-02T20:16:04Z |
| indexdate | 2024-07-09T21:13:24Z |
| institution | BVB |
| isbn | 9780321312839 032131283X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016406886 |
| oclc_num | 255868678 |
| open_access_boolean | |
| owner | DE-20 |
| owner_facet | DE-20 |
| physical | XV, 361 S. graph. Darst. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Addison-Wesley |
| record_format | marc |
| series2 | Prentice Hall international series in computer science |
| spelling | Ben-Arî, Môtî 1948- Verfasser (DE-588)121144844 aut Principles of concurrent and distributed programming M. Ben-Ari 2. ed., [Nachdr.] Harlow u.a. Addison-Wesley 2007 XV, 361 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Prentice Hall international series in computer science Algorithmus (DE-588)4001183-5 gnd rswk-swf Verteiltes Datenverarbeitungssystem rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Verteiltes System (DE-588)4238872-7 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Nebenläufigkeit (DE-588)4115352-2 gnd rswk-swf Verteiltes System (DE-588)4238872-7 s Algorithmus (DE-588)4001183-5 s DE-604 Parallelverarbeitung (DE-588)4075860-6 s Programmierung (DE-588)4076370-5 s 1\p DE-604 2\p DE-604 Nebenläufigkeit (DE-588)4115352-2 s 3\p DE-604 Verteiltes Datenverarbeitungssystem s 4\p DE-604 GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016406886&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Ben-Arî, Môtî 1948- Principles of concurrent and distributed programming Algorithmus (DE-588)4001183-5 gnd Verteiltes Datenverarbeitungssystem Parallelverarbeitung (DE-588)4075860-6 gnd Verteiltes System (DE-588)4238872-7 gnd Programmierung (DE-588)4076370-5 gnd Nebenläufigkeit (DE-588)4115352-2 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4075860-6 (DE-588)4238872-7 (DE-588)4076370-5 (DE-588)4115352-2 |
| title | Principles of concurrent and distributed programming |
| title_auth | Principles of concurrent and distributed programming |
| title_exact_search | Principles of concurrent and distributed programming |
| title_exact_search_txtP | Principles of concurrent and distributed programming |
| title_full | Principles of concurrent and distributed programming M. Ben-Ari |
| title_fullStr | Principles of concurrent and distributed programming M. Ben-Ari |
| title_full_unstemmed | Principles of concurrent and distributed programming M. Ben-Ari |
| title_short | Principles of concurrent and distributed programming |
| title_sort | principles of concurrent and distributed programming |
| topic | Algorithmus (DE-588)4001183-5 gnd Verteiltes Datenverarbeitungssystem Parallelverarbeitung (DE-588)4075860-6 gnd Verteiltes System (DE-588)4238872-7 gnd Programmierung (DE-588)4076370-5 gnd Nebenläufigkeit (DE-588)4115352-2 gnd |
| topic_facet | Algorithmus Verteiltes Datenverarbeitungssystem Parallelverarbeitung Verteiltes System Programmierung Nebenläufigkeit |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016406886&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT benarimoti principlesofconcurrentanddistributedprogramming |