Coggle requires JavaScript to display documents.
Introduction To DS
A Coggle Diagram about Algorithm/Design (Data replication, consistency models, and caching, Useful execution models and frameworks: to reason with and design correct
distributed programs, Time and global state, Group communication, multicast, and ordered message delivery, Monitoring distributed events and predicates, Distributed program design and verifcation tools, Debugging distributed programs, Dynamic distributed graph algorithms and routing algorithms, World Wide Web design: caching, searching, scheduling, Distributed shared memory abstraction, Reliable and fault-tolerant distributed systems, Load balancing, Real-time scheduling and Performance modeling and analysis), System Perspective (Consistency and replication, Communication mechanisms, Naming, Synchronization, Data storage and access, Processes, Fault-tolerance:, Distributed systems security, Scalability and modularity of algorithms, data, services, Some experimental systems: Globe, Globus, Grid and Transparency:), Applications and Emerging Challenges, Flynn's Taxonomy (SISD, SIMD, MISD and MIMD), Classifcation of Primitives , Terminology (Coupling, Parallelism, Concurrency of a program and Granularity of a program), Message-passing vs. Shared Memory, Parallel Systems, Interconnection Topologies for Multiprocesors, Distributed System Model, UMA vs. NUMA Models, Omega, Butter
y Interconnects, Omega Network, Non-blocking Primitive, System Emulations, Motivation for Distributed System, Relation between Software Components and Definition