Ãëàâíàÿ    Ex Libris    Êíèãè    Æóðíàëû    Ñòàòüè    Ñåðèè    Êàòàëîã    Wanted    Çàãðóçêà    ÕóäËèò    Ñïðàâêà    Ïîèñê ïî èíäåêñàì    Ïîèñê    Ôîðóì   
blank
Àâòîðèçàöèÿ

       
blank
Ïîèñê ïî óêàçàòåëÿì

blank
blank
blank
Êðàñîòà
blank
Tanenbaum A.S. — Distributed operating systems
Tanenbaum A.S. — Distributed operating systems



Îáñóäèòå êíèãó íà íàó÷íîì ôîðóìå



Íàøëè îïå÷àòêó?
Âûäåëèòå åå ìûøêîé è íàæìèòå Ctrl+Enter


Íàçâàíèå: Distributed operating systems

Àâòîð: Tanenbaum A.S.

Àííîòàöèÿ:

As distributed computer systems become more pervasive, so does the need for understanding how their operating systems are designed and implemented. Andrew S. Tanenbaum's Distributed Operating Systems fulfills this need. Representing a revised and greatly expanded Part II of the best-selling Modern Operating Systems, it covers the material from the original book, including communication, synchronization, processes, and file systems, and adds new material on distributed shared memory, real-time distributed systems, fault-tolerant distributed systems, and ATM networks. It also contains four detailed case studies: Amoeba, Mach, Chorus, and OSF/DCE. Tanenbaum's trademark writing provides readers with a thorough, concise treatment of distributed systems.


ßçûê: en

Ðóáðèêà: Computer science/Àëãîðèòìû/

Ñòàòóñ ïðåäìåòíîãî óêàçàòåëÿ: Ãîòîâ óêàçàòåëü ñ íîìåðàìè ñòðàíèö

ed2k: ed2k stats

Ãîä èçäàíèÿ: 1994

Êîëè÷åñòâî ñòðàíèö: 614

Äîáàâëåíà â êàòàëîã: 25.11.2005

Îïåðàöèè: Ïîëîæèòü íà ïîëêó | Ñêîïèðîâàòü ññûëêó äëÿ ôîðóìà | Ñêîïèðîâàòü ID
blank
Ïðåäìåòíûé óêàçàòåëü
A-node      568
ABCAST      112
Accent      432
Access Control List      247 555 562—563
ACID properties      148
Acknowledgement      86—88
ACL      see “Access control list”
ACL manager      562
Active Replication      215—217
Actor, Chorus      479
Actuator      224
Addressing, predicate      105
Aggregate, DCE      566
Agreement in faulty systems      217—222
AIL      see “Amoeba interface language”
Algorithm Berkeley clock synchronization      130
Algorithm bidding      209—210
Algorithm bully      141—142
Algorithm clock synchronization      124—132
Algorithm Cristian's      128—130
Algorithm earliest deadline first      236
Algorithm election      140—143
Algorithm graph-theoretic      204
Algorithm hierarchical allocation      206—208
Algorithm least laxity      237
Algorithm migratory allocation      198
Algorithm nonmigratory allocation      198
Algorithm NUMA      311
Algorithm primary copy      270
Algorithm processor allocation      203—210
Algorithm rate monotonic      236
Algorithm real-time scheduling      237—241
Algorithm receiver-initiated      208—209
Algorithm ring      143
Algorithm sender-initiated      208
Algorithm up-down      205
Algorithm voting      270—271
Algorithm wait-die      164
Algorithm wound-wait      165
Alias      551
Allocation algorithm, processor      203—210
Allocation model, processor      197—199
Amoeba      376—429
Amoeba boot server      427
Amoeba broadcast protocol      400—407
Amoeba bullet server      383 415—420
Amoeba capability      384—388
Amoeba communication      393—415
Amoeba comparison with Mach and Chorus      510—517
Amoeba directory server      383 420—425
Amoeba fault tolerance      405—407
Amoeba FLIP protocol      407—415
Amoeba get-port      397
Amoeba glocal variable      391
Amoeba goals      377—378
Amoeba group communication      398—407
Amoeba history      376—377
Amoeba history buffer      402
Amoeba interface language      415
Amoeba memory management      392—393
Amoeba microkernel      380—382
Amoeba mutex      391—392
Amoeba objects      384—388
Amoeba port      395
Amoeba process management      388—392
Amoeba processor pool      379—380
Amoeba put-port      397 412—414
Amoeba replication server      425
Amoeba RPC      394—398
Amoeba run server      425—427
Amoeba segment      382 392—393
Amoeba servers      415—428
Amoeba service      380
Amoeba soap server      383
Amoeba system architecture      378—380
Amoeba TCP/IP server      427—428
Amoeba thread      391—392
Amoeba wide-area networks      414—415
Aperiodic event      224
Application layer      42
ARPANET      42
Asynchronous system      214
Asynchronous Transfer Mode      42—50
At least once semantics      83
At most once semantics      83 132—133
AT&T      432—433
ATM      see “Asynchronous transfer mode”
ATM Adaptation Layer      46—47
ATM layer      45—46
ATM physical layer      44—45
ATM switching      47—49
ATM switching fabric      47
Atomic broadcast      106—107 217
Atomic transaction      144—158
atomicity      106—107
attributes, file      246
Authenticated RPC      559—562
Authentication      554
authentication server      557
Authenticator      558—559
Authorization      555
Automounting, NFS      274
Availability      27
Barrier      328
Basic overseer server      572
BBN Butterfly      309
Berkeley clock synchronization algorithm      130
Big endian machine      74
Binary names      252
Binder      78
Binding      538—539
Boot server, Amoeba      427
Bootstrap port, Mach      436
Broadcast protocol, Amoeba      400—407
broadcasting      100
Bullet server Amoeba      383 415—420
Bullet server implementation      418—420
Bully algorithm      141—142
Bus      293—294
busy waiting      180
Byzantine Empire      214
Byzantine fault      214
Byzantine generals problem      220—222
C threads      440—442
Cache consistency algorithm      265—268
Cache consistency protocol      294
Cache consistency protocol write once      296
Cache consistency protocol write through      295
Cache multiprocessor      305
Cache snooping      294
Caching write-on-close algorithm      266
Caching write-through algorithm      265—266
Caching, file      262—268
Call-by-copy/restore      70
Call-by-reference parameter      69
Call-by-value parameter      69
Canonical form      75
capability      247
Capability Amoeba      384—388
Capability Chorus      481
Capability list, Mach      460—462
Capability Mach      435 460—463
Capability name, Mach      461
Cascaded aborts      155
Causal consistency      321—322
Causally related events      112
CBCAST      112—114
CdS      see “Cell directory service”
CDS directory      547—548
CDS server      549
cell      43—44
Cell directory service      545 547—549
Cell, DCE      525—527
Centralized system      2
Cesium clock      125
Checksum      38
Chicken, rubber      36
Chorus      475—518
Chorus actor      479
Chorus capability      481
Chorus communication      495—499
Chorus communication calls      498—499
Chorus comparison with Amoeba and Mach      510—517
Chorus configurability      504—506
Chorus exception handling      487—488
Chorus goals      477
Chorus history      476—477
Chorus interprocess communication      482
Chorus IPC manager      504
Chorus kernel abstraction      479—481
Chorus kernel process      478
Chorus kernel structure      481—483
Chorus mapper      491—492
Chorus memory management      490—495
Chorus memory management calls      493—495
Chorus message      495
Chorus microkernel      478
Chorus minimessage      495
Chorus miniport      495
Chorus nucleus      478
Chorus object manager      503—504
Chorus object orientation      483
Chorus object-oriented layer      507—510
Chorus object-oriented layer base layer      507—509
Chorus object-oriented layer cluster      508
Chorus object-oriented layer context space      508—509
Chorus object-oriented layer context space, implementation      510
Chorus object-oriented layer context space, runtime system      509—510
Chorus port      480
Chorus process management      483—490
Chorus process management calls      488—490
Chorus process manager      502—503
Chorus protection identifier      484
Chorus real time      506
Chorus real-time executive, Chorus      482
Chorus region      479 490
Chorus scheduling      486—487
Chorus segment      481 490
Chorus software register      486
Chorus streams manager      504
Chorus subsystem      479
Chorus supervisor      481—483
Chorus system process      479
Chorus system structure      478—479
Chorus thread      479 485 486
Chorus UNIX emulation      483 499—506
Chorus UNIX extensions      500—501
Chorus UNIX implementation      501—506
Chorus user process      479
Chorus virtual memory manager      482
Ciphertext      555
Clearinghouse, DCE      548
Client      17 51
Client crashes      83—84
Client DCE      536—538
Client stub      70
Client/server binding      538—539
Client/server model      50—68
Client/server model addressing      56—58
Client/server model example      52—55
Client/server model implementing      65—68
Clock logical      120—124
Clock physical      124—127
Clock skew      121
Clock synchronization      119—133 226
Clock tick      121
Clocks, synchronized      132—133
Closed group      101—102
Co-scheduling      211—212
Coarse-grained parallelism      29
Coherent memory      11
Committed file      417
Communication      515—516
Communication Amoeba      393—415
Communication Chorus      495—499
Communication Mach      457—471
Communication one-to-many      99
Communication point-to-point      99
Communication primitives      58—65
Communication primitives asynchronous      59—61
Communication primitives blocking      58—59
Communication primitives buffered      61—63
Communication primitives group      105—106
Communication primitives mailbox      63
Communication primitives nonblocking      59—61
Communication primitives reliable      63—65
Communication primitives synchronous      58—59
Communication primitives unbuffered      61—63
Communication primitives unreliable      63—65
Communication real-time      230—234
Comparison of Amoeba, Mach, Chorus      510—517
Component fault      212—213
Computer supported cooperative work      4—5
concurrency control      154—158
Concurrency control eager release      329
Concurrency control entry      330—331 353—354
Concurrency control lazy release      329
Concurrency control optimistic      156
Concurrency control PRAM      322—325
Concurrency control processor      324—325
Concurrency control release      327—330 346—348
Concurrency control sequential      317—321
Concurrency control strict      315—317
Concurrency control summary of models      331—333
Concurrent events      112 122
Concurrent operations      322
condition variable      175—176 530
Consistency causal      321—322
Consistency models      315—333
cool      see “Chorus object-oriented layer”
Copy-on-write, Mach      451
Crashes client      83—84
Crashes server      82—83
Cristian's algorithm      128—130
Critical path, RPC      88—92
Crossbar switch      12
Cryptography      555
DARPA      432
DASH      303—307
Data Link layer      38—40
DCE      see “Distributed computing environment”
Deadlock      158—165
Deadlock detection      159—163
Deadlock prevention      163—165
DFS      see “DCE distributed
Directory server agent      553
Directory server Amoeba      383 420-425
Directory server implementation      423—425
Directory user agent      553
Directory, multiprocessor      303—305
Disk, optical      280—281
Diskless workstation      186—187
Dispatcher      172
distinguished name      551
Distributed Computing Environment      520—574
Distributed computing environment access control list      562—563
Distributed computing environment authenticated RPC      559—562
Distributed computing environment basic overseer server      572—573
Distributed computing environment CDS      545 547—549
Distributed computing environment cell      525—527
1 2 3 4
blank
Ðåêëàìà
blank
blank
HR
@Mail.ru
       © Ýëåêòðîííàÿ áèáëèîòåêà ïîïå÷èòåëüñêîãî ñîâåòà ìåõìàòà ÌÃÓ, 2004-2024
Ýëåêòðîííàÿ áèáëèîòåêà ìåõìàòà ÌÃÓ | Valid HTML 4.01! | Valid CSS! Î ïðîåêòå