Efficient logic variables for distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Leader Election in Asynchronous Distributed Systems
IEEE Transactions on Computers
Towards a secure platform for distributed mobile object computing
ACM SIGOPS Operating Systems Review
HiCoMo: High Commit Mobile Transactions
Distributed and Parallel Databases
A java toolkit for teaching distributed algorithms
Proceedings of the 7th annual conference on Innovation and technology in computer science education
A Roll-Forward Recovery Scheme for Solving the Problem of Coasting Forward for Distributed Systems
ACM SIGOPS Operating Systems Review
Logically Clustered Architectures for Networked Databases
Distributed and Parallel Databases
A quorum-based self-stabilizing distributed mutual exclusion algorithm
Journal of Parallel and Distributed Computing
Locating Mobile Agents in a Wide Distributed Environment
IEEE Transactions on Parallel and Distributed Systems
A Performance Comparison of Monile Agents and RPC
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Design patterns for semaphores
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Consistent and automatic replica regeneration
ACM Transactions on Storage (TOS)
An Efficient Topology-Adaptive Membership Protocol for Large-Scale Cluster-Based Services
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Improving the Performance of Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
Consistent and automatic replica regeneration
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
On the bounded-hop MST problem on random Euclidean instances
Theoretical Computer Science
Optimising uplink scheduling in an integrated 3G/WLAN network
International Journal of Wireless and Mobile Computing
A Balanced Resource Allocation and Overload Control Infrastructure for the Service Grid Environment
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Agent Based Load Balancing Middleware for Service-Oriented Applications
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
ROBMAT: Teleoperation of a Modular Robot for Collaborative Manipulation
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
DR: Divided Ring Leader Election Algorithm
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
A Distributed Shared Memory Architecture for Occasionally Connected Mobile Environments
APPT '09 Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
International Journal of Ad Hoc and Ubiquitous Computing
Hi-index | 0.01 |
From the Publisher:Distributed Operating Systems and Algorithms integrates into one text both the theory and implementation aspects of distributed operating systems for the first time. This innovative book provides the reader with knowledge of the important algorithms necessary for an in-depth understanding of distributed systems; at the same time it motivates the study of these algorithms by presenting a systems framework for their practical application. The first part of the book is intended for use in an advanced course on operating systems and concentrates on parallel systems, distributed systems, real-time systems, and computer networks. The second part of the text is written for a course on distributed algorithms with a focus on algorithms for asynchronous distributed systems. While each of the two parts is self-contained, extensive cross-referencing allows the reader to emphasize either theory or implementation or to cover both elements of selected topics. Features: Integrates and balances coverage of the advanced aspects of operating systems with the distributed algorithms used by these systems. Includes extensive references to commercial and experimental systems to illustrate the concepts and implementation issues. Provides precise algorithm description and explanation of why these algorithms were developed. Structures the coverage of algorithms around the creation of a framework for implementing a replicated server-a prototype for implementing a fault-tolerant and highly available distributed system. Contains programming projects on such topics as sockets, RPC, threads, and implementation of distributed algorithmsusing these tools. Includes an extensive annotated bibliography for each chapter, pointing the reader to recent developments. Solutions to selected exercises, templates to programming problems, a simulator for algorithms for distributed synchronization, and teaching tips for selected topics are available to qualified instructors from Addison Wesley.