Scheduling in distributed systems: A cloud computing perspective
https://doi.org/10.1016/j.cosrev.2018.08.002
Discover Books. Explore Knowledge.
Search and discover peer-reviewed scholarly literature, open-access articles, and research citations across DOAJ, PubMed Central, and OpenAlex.
https://doi.org/10.1016/j.cosrev.2018.08.002
This paper surveys the distributed system parameter identification problem and concludes that it can be treated as a series of largely independent subproblems, each of which must be considered in any attempt to treat the problem in applicat...
https://doi.org/10.1109/proc.1976.10066
https://doi.org/10.1007/978-3-319-94141-7
Techniques are examined for replicating data and execution in directly distributed systems: systems in which multiple processes interact directly with one another while continuously respecting constraints on their joint behavior. Directly d...
https://doi.org/10.1145/90417.90751
Developed to take advantage of the facilities of today's powerful personal workstations, the V kernel provides good system performance, not just good kernel performance....
https://doi.org/10.1109/ms.1984.234046
Monitoring and information services form a key component of a distributed system, or Grid. A quantitative study of such services can aid in understanding the performance limitations, advise in the deployment of the monitoring system, and he...
https://doi.org/10.1109/hpdc.2003.1210036
The earlier parts of this book studied the coordinated behavior that can be achieved in distributed systems where processes are reliable . For several reasons it is attractive to study what coordinated behavior of processes is possible unde...
https://doi.org/10.1017/cbo9781139168724.014
https://doi.org/10.1007/978-3-319-75632-5_6
A practical technique for delegation is described. It provides both cryptographic assurance that a delegation was authorized and authentication of the delegated systems, thereby allowing reliable access control as well as precise auditing o...
https://doi.org/10.1109/risp.1990.63835
A general method is described for implementing a distributed system with any desired degree of faulttolerance.Instead of relying upon explicit timeouts, processes execute a simple clock-driven algorithm.Reliable clock synchronization and a ...
https://doi.org/10.1145/2993.2994
It's difficult to determine event order in distributed systems because of the observability problem. The author discusses this problem and evaluates different strategies for determining arrival order. The author analyzed four time stamping ...
https://doi.org/10.1109/52.542297
Increasingly, computing addresses collaboration, data sharing, and interaction modes that involve distributed resources, resulting in an increased focus on the interconnection of systems both within and across enterprises. These evolutionar...
https://doi.org/10.1109/mc.2002.1009167
Distributed systems pose unique challenges for software developers. Understanding the system’s communication topology and reasoning about concurrent activities of system hosts can be difficult. The standard approach, analyzing system logs, ...
https://doi.org/10.1145/3375633
It is suggested that a functional model of monitoring in terms of the generation, processing, dissemination, and presentation of information can help determine the facilities needed to design and construct distributed systems. Implementatio...
https://doi.org/10.1109/65.244791
article Free Access Share on Maintaining the time in a distributed system Authors: Keith Marzullo Stanford University Stanford UniversityView Profile , Susan Owicki Stanford University Stanford UniversityView Profile Authors Info & Claims A...
https://doi.org/10.1145/850776.850780
https://doi.org/10.1016/0304-3975(81)90109-2
Probabilistic inference problems arise naturally in distributed systems such as sensor networks and teams of mobile robots. Inference algorithms that use message passing are a natural fit for distributed systems, but they must be robust to ...
https://doi.org/10.48550/arxiv.1207.4174
In a distributed system, one strategy for achieving mutual exclusion of groups of nodes without communication is to assign to each node a number of votes. Only a group with a majority of votes can execute the critical operations, and mutual...
https://doi.org/10.1145/4221.4223