A discipline of multiprogramming: programming theory for distributed applications
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London
Springer
2001
|
| Schriftenreihe: | Monographs in computer science
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 397 - 409 |
| Beschreibung: | XVIII, 420 S. 24 cm |
| ISBN: | 0387952063 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV013916287 | ||
| 003 | DE-604 | ||
| 005 | 20020814 | ||
| 007 | t| | ||
| 008 | 010911s2001 gw |||| |||| 00||| eng d | ||
| 016 | 7 | |a 962209279 |2 DE-101 | |
| 020 | |a 0387952063 |9 0-387-95206-3 | ||
| 035 | |a (OCoLC)248075334 | ||
| 035 | |a (DE-599)BVBBV013916287 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-739 |a DE-384 |a DE-634 |a DE-83 | ||
| 050 | 0 | |a QA76.6 | |
| 082 | 0 | |a 005.4/34 |2 21 | |
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Misra, Jayadev |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A discipline of multiprogramming |b programming theory for distributed applications |c Jayadev Misra |
| 264 | 1 | |a New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London |b Springer |c 2001 | |
| 300 | |a XVIII, 420 S. |b 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Monographs in computer science | |
| 500 | |a Literaturverz. S. 397 - 409 | ||
| 650 | 4 | |a Multiprogramming (Electronic computers) | |
| 650 | 0 | 7 | |a Weitverkehrsnetz |0 (DE-588)4294149-0 |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 Mehrprogrammbetrieb |0 (DE-588)4169318-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Mehrprogrammbetrieb |0 (DE-588)4169318-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Verteiltes System |0 (DE-588)4238872-7 |D s |
| 689 | 1 | 1 | |a Mehrprogrammbetrieb |0 (DE-588)4169318-8 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Weitverkehrsnetz |0 (DE-588)4294149-0 |D s |
| 689 | 2 | 1 | |a Mehrprogrammbetrieb |0 (DE-588)4169318-8 |D s |
| 689 | 2 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009521772&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009521772 | |
Datensatz im Suchindex
| _version_ | 1816444448290111488 |
|---|---|
| adam_text |
CONTENTS
PREFACE
VII
1
A
DISCIPLINE
OF
MULTIPROGRAMMING
1
1.1
WIDE-AREA
COMPUTING
.
1
1.2
AN
EXAMPLE:
PLANNING
A
MEETING
.
4
1.2.1
PROBLEM
DESCRIPTION
.
4
1.2.2
PROGRAM
DEVELOPMENT
.
5
1.2.3
CORRECTNESS
AND
PERFORMANCE
OF
PLAN
.
6
1.3
ISSUES
IN
MULTIPROGRAM
DESIGN
.
7
1.3.1
CONCURRENCY
IS
NOT
A
PRIMARY
ISSUE
IN
DESIGN
.
7
1.3.2
STRUCTURING
THROUGH
OBJECTS,
NOT
PROCESSES
.
8
1.3.3
IMPLEMENTATION
FOR
EFFICIENT
EXECUTION
.
9
1.3.4
TRANSFORMATIONAL
AND
REACTIVE
PROCEDURES
.
10
1.4
CONCLUDING
REMARKS
.
11
1.5
BIBLIOGRAPHIC
NOTES
.
12
2
ACTION
SYSTEMS
13
2.1
AN
INFORMAL
VIEW
OF
ACTION
SYSTEMS
.
14
2.2
SYNTAX
AND
SEMANTICS
OF
ACTION
SYSTEMS
.
15
2.3
PROPERTIES
OF
ACTION
SYSTEMS
.
16
2.3.1
INVARIANT
.
16
2.3.2
FIXED
POINT
.
17
2.4
EXAMPLES
.
18
2.4.1
FINITE
STATE
MACHINE
.
18
XII
CONTENTS
2.4.2
ODOMETER
.
20
2.4.3
GREATEST
COMMON
DIVISOR
.
22
2.4.4
MERGING
SORTED
SEQUENCES
.
23
2.4.5
MUTUAL
EXCLUSION
.
25
2.4.6
SHORTEST
PATH
.
31
2.5
CONCLUDING
REMARKS
.
37
2.6
BIBLIOGRAPHIC
NOTES
.
37
3
AN
OBJECT-ORIENTED
VIEW
OF
ACTION
SYSTEMS
39
3.1
INTRODUCTION
.
39
3.2
SEUSS
SYNTAX
.
41
3.2.1
PROGRAM
.
41
3.2.2
PROCEDURE
.
42
3.2.3
PROCEDURE
BODY
.
43
3.2.4
MULTIPLE
ALTERNATIVES
.
44
3.2.5
EXAMPLES
OF
ALTERNATIVES
.
45
3.2.6
CONSTRAINTS
ON
PROGRAMS
.
48
3.3 SEUSS
SEMANTICS
(OPERATIONAL)
.
48
3.3.1
TIGHT
EXECUTION
.
49
3.3.2
PROCEDURE
EXECUTION
.
49
3.4
DISCUSSION
.
51
3.4.1
TOTAL
VS.
PARTIAL
PROCEDURES
.
51
3.4.2
TIGHT
VS.
LOOSE
EXECUTION
.
53
3.4.3
THE
SEUSS
PROGRAMMING
METHODOLOGY
.
53
3.4.4
PARTIAL
ORDER
ON
BOXES
.
54
3.5
CONCLUDING
REMARKS
.
55
3.6
BIBLIOGRAPHIC
NOTES
.
56
4
SMALL
EXAMPLES
57
4.1
CHANNELS
.
58
4.1.1
UNBOUNDED
FIFO
CHANNEL
.
58
4.1.2
BOUNDED
FIFO
CHANNEL
.
59
4.1.3
UNORDERED
CHANNEL
.
61
4.1.4
TASK
DISPATCHER
.
62
4.1.5
DISK
HEAD
SCHEDULER
.
63
4.1.6
FAULTY
CHANNEL
.
64
4.2 A
SIMPLE
DATABASE
.
65
4.3
MANAGEMENT
OF
MULTILEVEL
MEMORY:
LAZY
CACHING
.
68
4.4
REAL-TIME
CONTROLLER;
DISCRETE-EVENT
SIMULATION
.
69
4.4.1
DISCRETE-EVENT
SIMULATION
.
71
4.5
EXAMPLE
OF
A
PROCESS
NETWORK
.
71
4.6
BROADCAST
.
73
4.7
BARRIER
SYNCHRONIZATION
.
74
4.8
READERS
AND
WRITERS
.
75
4.8.1
GUARANTEED
PROGRESS
FOR
WRITERS
.
76
CONTENTS
XIII
4.8.2
GUARANTEED
PROGRESS
FOR
READERS
AND
WRITERS
.
76
4.8.3
STARVATION-FREEDOM
FOR
WRITERS
.
77
4.9
SEMAPHORE
.
78
4.9.1
WEAK
SEMAPHORE
.
79
4.9.2
STRONG
SEMAPHORE
.
81
4.9.3
SNOOPY
SEMAPHORE
.
83
4.10
MULTIPLE
RESOURCE
ALLOCATION
.
85
4.10.1
A
DEADLOCK-FREE
SOLUTION
.
86
4.10.2
A
STARVATION-FREE
SOLUTION
.
87
4.10.3
A
DEADLOCK-FREE
SOLUTION
USING
SNOOPY
SEMAPHORES
.
87
4.11
CONCLUDING
REMARKS
.
89
4.12
BIBLIOGRAPHIC
NOTES
.
89
5
SAFETY
PROPERTIES
91
5.1
INTRODUCTION
.
91
5.2
THE
MEANING
OF
CO
.
92
5.3
SPECIAL
CASES
OF
CO
.
97
5.3.1
STABLE,
INVARIANT,
CONSTANT
.
97
5.3.2
FIXED
POINT
.
98
5.4
DERIVED
RULES
.
100
5.4.1
BASIC
RULES
.
100
5.4.2
RULES
FOR
THE
SPECIAL
CASES
.
101
5.4.3
SUBSTITUTION
AXIOM
.
102
5.4.4
ELIMINATION
THEOREM
.
103
5.4.5
DISTINCTION
BETWEEN
PROPERTIES
AND
PREDICATES
.
104
5.5
APPLICATIONS
.
105
5.5.1
NON-OPERATIONAL
DESCRIPTIONS
OF
ALGORITHMS
.
105
5.5.2
COMMON
MEETING
TIME
.
107
5.5.3
A
SMALL
CONCURRENT
PROGRAM:
TOKEN
RING
.
110
5.5.4
FROM
PROGRAM
TEXTS
TO
PROPERTIES
.
ILL
5.5.5
FINITE
STATE
SYSTEMS
.
114
5.5.6
AUXILIARY
VARIABLES
.
117
5.5.7
DEADLOCK
.
118
5.5.8
AXIOMATIZATION
OF
A
COMMUNICATION
NETWORK
.
120
5.5.9
COORDINATED
ATTACK
.
122
5.5.10
DYNAMIC
GRAPHS
.
124
5.5.11
A
TREATMENT
OF
REAL
TIME
.
126
5.5.12
A
REAL-TIME
MUTUAL
EXCLUSION
ALGORITHM
.
129
5.6
THEORETICAL
RESULTS
.
134
5.6.1
STRONGEST
RHS;
WEAKEST
IHS
.
134
5.6.2
STRONGEST
INVARIANT
.
134
5.6.3
FIXED
POINT
.
135
5.7
CONCLUDING
REMARKS
.
136
5.8
BIBLIOGRAPHIC
NOTES
.
137
5.9
EXERCISES
.
139
XIV
CONTENTS
5.10
SOLUTIONS
TO
EXERCISES
.
143
6
PROGRESS
PROPERTIES
155
6.1
INTRODUCTION
.
155
6.2
FAIRNESS
.
156
6.2.1
MINIMAL
PROGRESS
.
157
6.2.2
WEAK
FAIRNESS
.
157
6.2.3
STRONG
FAIRNESS
.
158
6.2.4
WHICH
IS
THE
FAIREST
ONE?
.
158
6.3
TRANSIENT
PREDICATE
.
159
6.3.1
MINIMAL
PROGRESS
.
.
160
6.3.2
WEAK
FAIRNESS
.
161
6.3.3
STRONG
FAIRNESS
.
162
6.3.4
COMPARING
MINIMAL
PROGRESS
AND
WEAK
FAIRNESS
.
.
.
162
6.3.5
DERIVED
RULES
.
163
6.3.6
DISCUSSION
.
164
6.4
ENSURES,
LEADS-TO
.
164
6.4.1
ENSURES
.
164
6.4.2
LEADS-TO
.
165
6.4.3
EXAMPLES
OF
SPECIFICATIONS
WITH
LEADS-TO
.
166
6.4.4
DERIVED
RULES
.
168
6.4.5
PROOFS
OF
THE
DERIVED
RULES
.
170
6.4.6
COROLLARIES
OF
THE
DERIVED
RULES
.
174
6.5
APPLICATIONS
.
176
6.5.1
NON-OPERATIONAL
DESCRIPTIONS
OF
ALGORITHMS
.
176
6.5.2
COMMON
MEETING
TIME
.
177
6.5.3
TOKEN
RING
.
178
6.5.4
UNORDERED
CHANNEL
.
180
6.5.5
SHARED
COUNTER
.
181
6.5.6
DYNAMIC
GRAPHS
.
182
6.5.7
TREATMENT
OF
STRONG
FAIRNESS
.
184
6.6
THEORETICAL
ISSUES
.
188
6.6.1
WIT
.
188
6.6.2
A
FIXPOINT
CHARACTERIZATION
OF
WIT
.
191
6.6.3
THE
ROLE
OF
THE
DISJUNCTION
RULE
.
192
6.7
CONCLUDING
REMARKS
.
193
6.8
BIBLIOGRAPHIC
NOTES
.
194
6.9
EXERCISES
.
195
6.10
SOLUTIONS
TO
EXERCISES
.
201
7
MAXIMALITY
PROPERTIES
215
7.1
INTRODUCTION
.
215
7.2
NOTION
OF
MAXIMALITY
.
217
7.2.1
DEFINITION
OF
MAXIMALITY
.
218
7.3
PROVING
MAXIMALITY
.
219
CONTENTS
XV
7.3.1
CONSTRAINED
PROGRAM
.
219
7.3.2
PROVING
MAXIMALITY
.
222
7.3.3
JUSTIFICATION
FOR
THE
PROOF
RULES
.
223
7.3.4
PROOF
OF
MAXIMALITY
OF
PROGRAM
FAIRNATURAL
.
224
7.4
RANDOM
ASSIGNMENT
.
225
7.4.1
THE
FORM
OF
RANDOM
ASSIGNMENT
.
225
7.5
FAIR
UNORDERED
CHANNEL
.
227
7.5.1
MAXIMAL
SOLUTION
FOR
FAIR
UNORDERED
CHANNEL
.
228
7.5.2
THE
CONSTRAINED
PROGRAM
.
229
7.5.3
PROOF
OF
MAXIMALITY:
INVARIANTS
.
230
7.5.4
CORRECTNESS
OF
IMPLEMENTATION
OF
RANDOM
ASSIGNMENTS
231
7.5.5
PROOF
OF
CHRONICLE
AND
EXECUTION
CORRESPONDENCE
.
.
232
7.6
FAULTY
CHANNEL
.
232
7.7
CONCLUDING
REMARKS
.
233
7.8
BIBLIOGRAPHIC
NOTES
.
233
8
PROGRAM
COMPOSITION
235
8.1
INTRODUCTION
.
235
8.2
COMPOSITION
BY
UNION
.
237
8.2.1
DEFINITION
OF
UNION
.
237
8.2.2
HIERARCHICAL
PROGRAM
STRUCTURES
.
239
8.2.3
UNION
THEOREM
.
240
8.2.4
PROOF
OF
THE
UNION
THEOREM
AND
ITS
COROLLARIES
.
241
8.2.5
LOCALITY
AXIOM
.
243
8.2.6
UNION
THEOREM
FOR
PROGRESS
.
245
8.3
EXAMPLES
OF
PROGRAM
UNION
.
246
8.3.1
PARALLEL
SEARCH
.
247
8.3.2
HANDSHAKE
PROTOCOL
.
250
8.3.3
SEMAPHORE
.
252
8.3.4
VENDING
MACHINE
.
259
8.3.5
MESSAGE
COMMUNICATION
.
263
8.4
SUBSTITUTION
AXIOM
UNDER
UNION
.
266
8.5
THEORETICAL
ISSUES
.
266
8.5.1
AXIOMS
OF
UNION
.
266
8.5.2
A
DEFINITION
OF
REFINEMENT
.
267
8.5.3
ALTERNATIVE
DEFINITION
OF
REFINEMENT
.
269
8.6
CONCLUDING
REMARKS
.
270
8.7
BIBLIOGRAPHIC
NOTES
.
271
8.8
EXERCISES
.
271
8.9
SOLUTIONS
TO
EXERCISES
.
274
9
CONDITIONAL
AND
CLOSURE
PROPERTIES
281
9.1
INTRODUCTION
.
281
9.2
CONDITIONAL
PROPERTIES
.
282
9.2.1
SPECIFICATION
USING
CONDITIONAL
PROPERTIES
.
282
XVI
CONTENTS
9.2.2
LINEAR
NETWORK
.
283
9.2.3
EXAMPLE:
PRODUCER,
CONSUMER
.
284
9.2.4
EXAMPLE:
FACTORIAL
NETWORK
.
287
9.2.5
EXAMPLE:
CONCURRENT
BAG
.
288
9.3
CLOSURE
PROPERTIES
.
295
9.3.1
TYPES
OF
GLOBAL
VARIABLES
.
296
9.3.2
DEFINITIONS
OF
CLOSURE
PROPERTIES
.
299
9.3.3
CLOSURE
THEOREM
.
299
9.3.4
DERIVED
RULES
.
302
9.3.5
EXAMPLE:
HANDSHAKE
PROTOCOL
.
304
9.3.6
EXAMPLE:
CONCURRENT
BAG
.
306
9.3.7
EXAMPLE:
TOKEN
RING
.
309
9.4
COMBINING
CLOSURE
AND
CONDITIONAL
PROPERTIES
.
313
9.5
CONCLUDING
REMARKS
.
313
9.6
BIBLIOGRAPHIC
NOTES
.
314
10
REDUCTION
THEOREM
315
10.1
INTRODUCTION
.
315
10.2
A
MODEL
OF
SEUSS
PROGRAMS
.
317
10.2.1
BASIC
CONCEPTS
.
317
10.2.2
JUSTIFICATION
OF
THE
MODEL
.
318
10.2.3
PARTIAL
ORDER
ON
BOXES
.
320
10.2.4
PROCEDURES
AS
RELATIONS
.
322
10.3
COMPATIBILITY
.
323
10.3.1
EXAMPLES
OF
COMPATIBILITY
.
324
10.3.2
SEMICOMMUTATIVITY
OF
COMPATIBLE
PROCEDURES
.
326
10.4
LOOSE
EXECUTION
.
328
10.4.1
BOX
CONDITION
.
329
10.4.2
EXECUTION
TREE
.
330
10.5
REDUCTION
THEOREM
AND
ITS
PROOF
.
331
10.5.1
PROOF
OF
THE
REDUCTION
THEOREM
.
331
10.6
A
VARIATION
OF
THE
REDUCTION
THEOREM
.
334
10.7
CONCLUDING
REMARKS
.
335
10.8
BIBLIOGRAPHIC
NOTES
.
336
11
DISTRIBUTED
IMPLEMENTATION
339
11.1
INTRODUCTION
.
339
11.2
OUTLINE
OF
THE
IMPLEMENTATION
STRATEGY
.
340
11.3
DESIGN
OF
THE
SCHEDULER
.
341
11.3.1
AN
ABSTRACTION
OF
THE
SCHEDULING
PROBLEM
.
341
11.3.2
SPECIFICATION
.
342
11.3.3
A
SCHEDULING
STRATEGY
.
342
11.3.4
CORRECTNESS
OF
THE
SCHEDULING
STRATEGY
.
343
11.4
PROOF
OF
MAXIMALITY
OF
THE
SCHEDULER
.
345
11.4.1
INVARIANTS
OF
THE
CONSTRAINED
PROGRAM
.
346
CONTENTS
XVII
11.4.2
CORRECTNESS
OF
RANDOM
ASSIGNMENT
IMPLEMENTATION
.
348
11.4.3
PROOF
OF
CHRONICLE
AND
EXECUTION
CORRESPONDENCE
.
.
349
11.5
REFINING
THE
SCHEDULING
STRATEGY
.
349
11.5.1
CENTRALIZED
SCHEDULER
.
349
11.5.2
DISTRIBUTED
SCHEDULER
.
350
11.6
DESIGNS
OF
THE
PROCESSORS
.
351
11.7
OPTIMIZATIONS
.
352
11.7.1
DATA
STRUCTURES
FOR
OPTIMIZATION
.
353
11.7.2
OPERATION
OF
THE
SCHEDULER
.
354
11.7.3
MAINTAINING
THE
SHADOW
INVARIANT
.
355
11.7.4
NOTES
ON
THE
OPTIMIZATION
SCHEME
.
357
11.8
CONCLUDING
REMARKS
.
359
11.9
BIBLIOGRAPHIC
NOTES
.
359
12
A
LOGIC
FOR
SEUSS
361
12.1
INTRODUCTION
.
361
12.2
SPECIFICATIONS
OF
SIMPLE
PROCEDURES
.
362
12.2.1
READERS-WRITERS
WITH
PROGRESS
FOR
WRITERS
.
365
12.2.2
READERS-WRITERS
WITH
PROGRESS
FOR
BOTH
.
368
12.3
SPECIFICATIONS
OF
GENERAL
PROCEDURES
.
370
12.3.1
DERIVED
RULES
.
371
12.3.2
SIMPLIFICATIONS
OF
THE
DERIVED/RULES
.
372
12.4
PERSISTENCE
AND
RELATIVE
STABILITY
.
373
12.4.1
PERSISTENCE
.
373
12.4.2
RELATIVE
STABILITY
.
374
12.4.3
INFERENCE
RULES
.
374
12.5
STRONG
SEMAPHORE
.
376
12.5.1
SPECIFICATION
OF
STRONG
SEMAPHORE
.
376
12.5.2
PROOF
OF
THE
SPECIFICATION
.
377
12.6
STARVATION
FREEDOM
IN
A
RESOURCE
ALLOCATION
ALGORITHM
.
.
379
12.6.1
THE
RESOURCE
ALLOCATION
PROGRAM
.
380
12.6.2
PROOF
OF
ABSENCE
OF
STARVATION
.
381
12.7
CONCLUDING
REMARKS
.
384
12.8
BIBLIOGRAPHIC
NOTES
.
385
IN
RETROSPECT
387
A
ELEMENTARY
LOGIC
AND
ALGEBRA
389
A.L
PROPOSITIONAL
CALCULUS
.
389
A.
2
PREDICATE
CALCULUS
.
391
A.
2.1
QUANTIFICATION
.
391
A.
2.2
TEXTUAL
SUBSTITUTION
.
391
A.
2.3
UNIVERSAL
AND
EXISTENTIAL
QUANTIFICATION
.
392
A.
3
PROOF
FORMAT
.
393
A.
4
HOARE
LOGIC
AND
WEAKEST
PRE-CONDITIONS
.
393
XVIII
CONTENTS
A.4.1
HOARE
LOGIC
.
393
A.4.2
WEAKEST
PRE-CONDITIONS
.
394
A.
5
ELEMENTARY
RELATIONAL
CALCULUS
.
394
REFERENCES
397
INDEX
410 |
| any_adam_object | 1 |
| author | Misra, Jayadev |
| author_facet | Misra, Jayadev |
| author_role | aut |
| author_sort | Misra, Jayadev |
| author_variant | j m jm |
| building | Verbundindex |
| bvnumber | BV013916287 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.6 |
| callnumber-search | QA76.6 |
| callnumber-sort | QA 276.6 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 230 |
| ctrlnum | (OCoLC)248075334 (DE-599)BVBBV013916287 |
| dewey-full | 005.4/34 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.4/34 |
| dewey-search | 005.4/34 |
| dewey-sort | 15.4 234 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV013916287</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20020814</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">010911s2001 gw |||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">962209279</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387952063</subfield><subfield code="9">0-387-95206-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248075334</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013916287</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.4/34</subfield><subfield code="2">21</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">Misra, Jayadev</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A discipline of multiprogramming</subfield><subfield code="b">programming theory for distributed applications</subfield><subfield code="c">Jayadev Misra</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London</subfield><subfield code="b">Springer</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 420 S.</subfield><subfield code="b">24 cm</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">Monographs in computer science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 397 - 409</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprogramming (Electronic computers)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Weitverkehrsnetz</subfield><subfield code="0">(DE-588)4294149-0</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">Mehrprogrammbetrieb</subfield><subfield code="0">(DE-588)4169318-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mehrprogrammbetrieb</subfield><subfield code="0">(DE-588)4169318-8</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">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Mehrprogrammbetrieb</subfield><subfield code="0">(DE-588)4169318-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Weitverkehrsnetz</subfield><subfield code="0">(DE-588)4294149-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Mehrprogrammbetrieb</subfield><subfield code="0">(DE-588)4169318-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=009521772&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-009521772</subfield></datafield></record></collection> |
| id | DE-604.BV013916287 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-22T17:26:54Z |
| institution | BVB |
| isbn | 0387952063 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009521772 |
| oclc_num | 248075334 |
| open_access_boolean | |
| owner | DE-739 DE-384 DE-634 DE-83 |
| owner_facet | DE-739 DE-384 DE-634 DE-83 |
| physical | XVIII, 420 S. 24 cm |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer |
| record_format | marc |
| series2 | Monographs in computer science |
| spelling | Misra, Jayadev Verfasser aut A discipline of multiprogramming programming theory for distributed applications Jayadev Misra New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London Springer 2001 XVIII, 420 S. 24 cm txt rdacontent n rdamedia nc rdacarrier Monographs in computer science Literaturverz. S. 397 - 409 Multiprogramming (Electronic computers) Weitverkehrsnetz (DE-588)4294149-0 gnd rswk-swf Verteiltes System (DE-588)4238872-7 gnd rswk-swf Mehrprogrammbetrieb (DE-588)4169318-8 gnd rswk-swf Mehrprogrammbetrieb (DE-588)4169318-8 s DE-604 Verteiltes System (DE-588)4238872-7 s Weitverkehrsnetz (DE-588)4294149-0 s DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009521772&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Misra, Jayadev A discipline of multiprogramming programming theory for distributed applications Multiprogramming (Electronic computers) Weitverkehrsnetz (DE-588)4294149-0 gnd Verteiltes System (DE-588)4238872-7 gnd Mehrprogrammbetrieb (DE-588)4169318-8 gnd |
| subject_GND | (DE-588)4294149-0 (DE-588)4238872-7 (DE-588)4169318-8 |
| title | A discipline of multiprogramming programming theory for distributed applications |
| title_auth | A discipline of multiprogramming programming theory for distributed applications |
| title_exact_search | A discipline of multiprogramming programming theory for distributed applications |
| title_full | A discipline of multiprogramming programming theory for distributed applications Jayadev Misra |
| title_fullStr | A discipline of multiprogramming programming theory for distributed applications Jayadev Misra |
| title_full_unstemmed | A discipline of multiprogramming programming theory for distributed applications Jayadev Misra |
| title_short | A discipline of multiprogramming |
| title_sort | a discipline of multiprogramming programming theory for distributed applications |
| title_sub | programming theory for distributed applications |
| topic | Multiprogramming (Electronic computers) Weitverkehrsnetz (DE-588)4294149-0 gnd Verteiltes System (DE-588)4238872-7 gnd Mehrprogrammbetrieb (DE-588)4169318-8 gnd |
| topic_facet | Multiprogramming (Electronic computers) Weitverkehrsnetz Verteiltes System Mehrprogrammbetrieb |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009521772&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT misrajayadev adisciplineofmultiprogrammingprogrammingtheoryfordistributedapplications |