Àâòîðèçàöèÿ
Ïîèñê ïî óêàçàòåëÿì
Andrew S.Tanenbaum — Distributed Systems: Principles and Paradigms
Îáñóäèòå êíèãó íà íàó÷íîì ôîðóìå Íàøëè îïå÷àòêó?
Íàçâàíèå: Distributed Systems: Principles and ParadigmsÀâòîð: Andrew S.Tanenbaum Àííîòàöèÿ: Virtually every computing system today is part of a distributed system. Programmers, developers, and engineers need to understand the underlying principles and paradigms as well as the real-world application of those principles. Now, internationally renowned expert Andrew S. Tanenbaum – with colleague Martin van Steen – presents a complete introduction that identifies the seven key principles of distributed systems, with extensive examples of each. Adds a completely new chapter on architecture to address the principle of organizing distributed systems. Provides extensive new material on peer-to-peer systems, grid computing and Web services, virtualization, and application-level multicasting. Updates material on clock synchronization, data-centric consistency, object-based distributed systems, and file systems and Web systems coordination. For all developers, software engineers, and architects who need an in-depth understanding of distributed systems.
ßçûê: Ðóáðèêà: Computer science /Ñòàòóñ ïðåäìåòíîãî óêàçàòåëÿ: Ãîòîâ óêàçàòåëü ñ íîìåðàìè ñòðàíèö ed2k: ed2k stats Ãîä èçäàíèÿ: 2006Êîëè÷åñòâî ñòðàíèö: 614Äîáàâëåíà â êàòàëîã: 26.06.2009Îïåðàöèè: Ïîëîæèòü íà ïîëêó |
Ñêîïèðîâàòü ññûëêó äëÿ ôîðóìà | Ñêîïèðîâàòü ID
Ïðåäìåòíûé óêàçàòåëü
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”) NIS, protocol 273—275 NIS, r-node 277 NIS, v-node 276 NIS, Yellow Pages 275 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 308—311 NUMA multiprocessor 308—311 NUMA multiprocessor, paging algorithm 311 NUMA, comparison of methods 139—140 NUMA, directories 351—352 NUMA, fast 530 NUMA, Munin 346—353 NUMA, Mutex 175 391—392 NUMA, Mutual exclusion 134—140 NUMA, protocols 348—351 NUMA, recursive 530—531 NUMA, release consistency 346—348 NUMA, ring-based 298—301 NUMA, switched 12—13 301—307 NUMA, synchronization 353 NUMA, timesharing 20—22 NUMA, UMA 308 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 group, Chorus 496 Port set, Mach 459—460 Port, Amoeba 395 Port, Chorus 480 495—496 495—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, 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 descriptor 389 Process management Amoeba 388—392 Process management Amoeba, Chorus 483—490 Process management Amoeba, Mach 436—445 Process, Amoeba 388—391 Process, Chorus 484—485 Process, Mach 436 Processor allocation 197—210 Processor allocation algorithms bidding 209—210 Processor allocation algorithms bidding, centralized 206 Processor allocation algorithms bidding, design issues 199—201 Processor allocation algorithms bidding, graph-theoretic 204 Processor allocation algorithms bidding, hierarchical 206—208 Processor allocation algorithms bidding, implementation 201—203 Processor allocation algorithms bidding, receiver-initiated 208—209 Processor allocation algorithms bidding, sender-initiated 208 Processor allocation algorithms bidding, 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 stack 38 Protocol, Amoeba broadcast 400—407 Protocol, blast 86 Protocol, cache consistency 294—298 Protocol, connection-oriented 36 Protocol, connectionless 36 Protocol, multiprocessor 305—307 Protocol, NFS 273—275 Protocol, request/reply 52 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 Chorus, design 226—230 Real-time system Chorus, event-triggered 226 Real-time system Chorus, fail-safe 229 Real-time system Chorus, fault-tolerant 228—229 Real-time system Chorus, hard 225 Real-time system Chorus, language support 229—230 Real-time system Chorus, myths 225—226 Real-time system Chorus, predictable 227—228 Real-time system Chorus, soft 225 Real-time system Chorus, time-triggered 227 Redundancy 214—215 Redundancy, Chorus 479 490 Redundancy, 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 (continued) binding 77—80 Remote procedure call, Amoeba 394—398 Remote procedure call, basic operation 68—72 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 server 416 Replication server, Amoeba 425 Replication server, DCE 572 Replication transparency 268—269 Replication, active 215—217 Replication, file system 268—270 Replication, lazy 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 85—86 RPC daemon 538—539 RPC, selective repeat 87 RPC, stop-and-wait 86 Scalability 29—31 109—110 282-283 scatter/gather 93 Schedulable system 236 Scheduler (continued) real-time 234—241 Scheduler (continued) real-time, static real-time 237—241 Scheduler activations 182—183 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 components, 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, cxactly oncc 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 crashes 82—83 Server stub 70 Server, Amoeba 382—384 415—428 Server, DCE 536—538 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 client, server 70 Stunning 390 Supervisor, Chorus 481—483 Sweep algorithm 95 Switching fabric 47 Symbolic link 252 Symbolic names 252 Synchronization variable 325 Synchronization, clock 119—133 124—132 Synchronization, Distributed shared memory 344—345 Synchronization, Munin 353 Synchronous Digital Hierarchy 44 Synchronous optical network 44—45 Synchronous system 214 System failure 213—214 Tai (see “International atomic time”) TCP {see “Transmission control protocol”) TCP/IP 40—41 TCP/IP server Amoeba 427—428 TCP/IP, distributed systems 408 TCP/IP, time-triggered 232—234 TCP/IP, two-phase commit 153—154 TDMA (see “Time division multiple access”) Team model 183
Ðåêëàìà
|
|
Î ïðîåêòå