Ãëàâíàÿ    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
Ïðåäìåòíûé óêàçàòåëü
Munin      346—353
Munin directories      351—352
Munin protocols      348—351
Munin release consistency      346—348
Munin synchronization      353
Mutex      175 391—392
Mutex fast      530
Mutex recursive      530—531
Mutual exclusion      134—140
Mutual exclusion comparison of methods      139—140
Name binary      252
Name DCE      546—547
name server      58
Name symbolic      252
Naming transparency      251
Naming, two-level      252
Nested transactions      149—150
Network File System      272—278
Network file system architecture      272—273
Network file system implementation      275—278
Network file system NIS      275
Network file system protocol      273—275
Network file system r-node      277
Network file system v-node      276
Network file system yellow pages      275
Network Information Service      275
Network layer      40
Network message server, Mach      469—471
Network Operating System      16—18
NFS      see “Network file system”
NIS      see “Network information service”
No remote access system      333
nonce      559
Nonmigratory allocation algorithms      198
Nonuniform Memory Access      13
NORMA      see “No remote access system”
Nucleus, Chorus      478
NUMA      see “Nonuniform Memory Access”
NUMA multiprocessor      308—311
NUMA multiprocessor, paging algorithm      311
Object      292 356 366 512—513
Object Amoeba      384—388
Object operations      387—388
Object protection      385—387
Object-based DSM      356—371
OC      1 45
Omega network      12
Open Group      101—102
Open Software Foundation      432
Open system      35
Open Systems Interconnection      35—42
Operation      366
optical disk      280—281
Optimistic concurrency control      156
Orca      365—371
Orca language      366—368
Orca object management      368—371
orphan      83—84
Orphan expiration      84
Orphan extermination      84
Orphan gentle reincarnation      84
Orphan reincarnation      84
OSF      see “Open Software Foundation”
OSF DCE      see “Distributed computing environment”
OSI model      see “Open systems interconnection”
Overrun error      87
PAC      see “Privilege attribute certificate”
Page scanner      311
Peer group      102—103
Periodic event      224
Permanent fault      212
Physical clock      124—127
Physical layer      38
Piggybacked acknowledgement      401
Pipeline model      173
Pipelined RAM      see “PRAM consistency”
Plaintext      555
point-to-point communication      99
Pop-up thread      185
Pope Gregory      541
Port Amoeba      395
Port Chorus      480 495—496 495—496
Port group, Chorus      496
Port Mach      435 457—460 463—464
Port Mach bootstrap      436
Port Mach control      452—453
Port Mach exception      436
Port Mach name      453
Port Mach network      469
Port Mach object      452
Port Mach process      460
Port Mach registered      437
Port set, Mach      459—460
Port thread      439
PRAM consistency      322—325
Precious page      454
Presentation layer      41—42
Primary copy replication      270
Primary-backup fault tolerance      217—219
Primitives      see “Communication primitives”
Principal, security      554
Privilege attribute certificate      557
Privilege server      557
Probe      162
Process      513—514
Process Amoeba      388—391
Process Chorus      484—485
Process descriptor      389
Process Mach      436
Process management Amoeba      388—392
Process management Chorus      483—490
Process management Mach      436—445
Processor allocation      197—210
Processor allocation algorithms bidding      209—210
Processor allocation algorithms centralized      206
Processor allocation algorithms design issues      199—201
Processor allocation algorithms graph-theoretic      204
Processor allocation algorithms hierarchical      206—208
Processor allocation algorithms implementation      201—203
Processor allocation algorithms receiver-initiated      208—209
Processor allocation algorithms sender-initiated      208
Processor allocation algorithms up-down      205
Processor consistency      324—325
Processor pool      193—197 379—380
Processor set Mach      442
Protecion identifier Chorus      484
Protected variable      328
Protocol      35
Protocol Amoeba broadcast      400—407
Protocol blast      86
Protocol cache consistency      294—298
Protocol connection-oriented      36
Protocol connectionless      36
Protocol distributed systems      408
Protocol multiprocessor      305—307
Protocol NFS      273—275
Protocol request/reply      52
Protocol RPC      85—86
Protocol selective repeat      87
protocol stack      38
Protocol stop-and-wait      86
Protocol TCP/IP      40—41
Protocol time-triggered      232—234
Protocol two-phase commit      153—154
Put-port, Amoeba      397 412—414
Queueing systems      194—196
quorum      271
R-node      277
rate monotonic algorithm      236
RDN      see “Relative distinguished name”
Read ahead      277
Read quorum      271
Read-driven pipeline      97
Real-time communication      230—234
Real-time connection      231
Real-time distributed systems      223—241
Real-time executive, Chorus      482
Real-time program      223
Real-time scheduling      234—241
Real-time scheduling dynamic      236—237 240—241
Real-time scheduling earliest deadline first      236
Real-time scheduling least laxity      237
Real-time scheduling rate monotonic      236
Real-time scheduling static      237—241
Real-time system Chorus      506
Real-time system design      226—230
Real-time system event-triggered      226
Real-time system fail-safe      229
Real-time system fault-tolerant      228—229
Real-time system hard      225
Real-time system language support      229—230
Real-time system myths      225—226
Real-time system predictable      227—228
Real-time system soft      225
Real-time system time-triggered      227
Redundancy      214—215
Region Chorus      479 490
Region Mach      447
Registered port, Mach      437
Registry server      557
relative distinguished name      550—551
Release consistency      327—330 346—348
Reliability      27—28
Reliable broadcasting      400—407
Remote access model      248
Remote file system      275
Remote Procedure Call      68—98 88—92
Remote procedure call Amoeba      394—398
Remote procedure call basic operation      68—72
Remote procedure call binding      77—80
Remote procedure call Chorus      47
Remote procedure call copying overhead      92—94
Remote procedure call critical path      90—92
Remote procedure call DCE      535—540
Remote procedure call handle      78
Remote procedure call implementation      84—98
Remote procedure call interaction with threads      184 185
Remote procedure call marshaling      72
Remote procedure call parameter passing      72—77
Remote procedure call problem areas      95—98
Remote procedure call protocols      85—86
Remote procedure call semantics      80—84
Remote procedure call sweep algorithm      95
Remote procedure call timer management      94—95
Replicated worker model      360—361
Replication active      215—217
Replication file system      268—270
Replication lazy      269
Replication server      416
Replication server Amoeba      425
Replication server DCE      572
Replication transparency      268—269
Request/reply protocol      52
Response ratio      199
Response time      198
Ring algorithm      143
Ring-based multiprocessor      298—301
Rochester intelligent gateway      431—432
rollback      152
Routing      40
RPC      see “Remote procedure call”
RPC daemon      538—539
Run server, Amoeba      425—427
Scalability      29—31 109—110 282—283
scatter/gather      93
Schedulable system      236
Scheduler activations      182—183
Scheduler real-time      234—241
Scheduler static real-time      237—241
schedules      149
Scheduling      210—212
Scheduling algorithms, comparison      240—241
Scheduling Chorus      486—487
Scheduling DCE      529—530
Scheduling dynamic real-time      236—237 240—241
Scheduling handoff      445
Scheduling Mach      442—445
Schema      551
SDH      see “Synchronous digital hierarchy”
Seal      see “Simple and efficient adaptation layer”
security components      557—558
Security DCE      554—563
security model      555—557
Security service DCE      555
Segment Amoeba      382 392—393
Segment Chorus      481 490
Segment mapped      393
Selective repeat protocol      87
Semantics at least once      83
Semantics at most once      83
Semantics exactly once      83
Semantics file sharing      253—256
Semantics RPC      80—84
Semantics session      253—254
Semantics Unix      253—254
Sensor      224
Sequencer      369
Sequential consistency      317—321
server      51 516—517
Server Amoeba      382—384 415—428
Server crashes      82—83
Server DCE      536—538
Server stub      70
Session layer      41
Session semantics      253—254
Shadow block      151
Shared memory      292—314
Shared memory machines, comparison      312—314
Simple and efficient adaptation layer      47
Single-processor system      2
Single-system image      19
Skulking      549
Snooping cache      11 294
Snoopy cache      see “Snooping cache”
SOAP server      see “Amoeba directory
Solar second      124
SONET      see “Synchronous optical network”
SONET frame      45
Spin lock      180
Spoofing      562
Sporadic event      224
St. Exupery, Antoine de      511
Stable storage      146—147
State machine approach      215
Stateless file system      260—262
Stateless server      274—275
Static real-time scheduling      237—241
strict consistency      315—317
Stub client      70
Stub server      70
Stunning      390
Supervisor, Chorus      481—483
Sweep algorithm      95
Switching fabric      47
Symbolic link      252
Symbolic names      252
Synchronization clock      119—133 124—132
Synchronization Distributed shared memory      344—345
Synchronization Munin      353
Synchronization variable      325
1 2 3 4
blank
Ðåêëàìà
blank
blank
HR
@Mail.ru
       © Ýëåêòðîííàÿ áèáëèîòåêà ïîïå÷èòåëüñêîãî ñîâåòà ìåõìàòà ÌÃÓ, 2004-2024
Ýëåêòðîííàÿ áèáëèîòåêà ìåõìàòà ÌÃÓ | Valid HTML 4.01! | Valid CSS! Î ïðîåêòå