Scheduling in Distributed Systems
https://doi.org/10.1007/978-3-540-24663-3_16
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.1007/978-3-540-24663-3_16
https://doi.org/10.1007/978-1-4471-2416-0
Abstract A serious difficulty in concurrent programming of a distributed system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. In this paper, we formulate the static load‐bal...
https://doi.org/10.1002/cpe.1331
This installment of Computer’s series highlighting the work published in IEEE Computer Society journals comes from IEEE Transactions on Parallel and Distributed Systems....
https://doi.org/10.1109/mc.2020.3017320
Easy to deploy, robust, and highly resilient to failures, epidemic algorithms are a potentially effective mechanism for propagating information in large peer-to-peer systems deployed on Internet or ad hoc networks. It is possible to adjust ...
https://doi.org/10.1109/mc.2004.1297243
https://doi.org/10.1007/978-3-319-03850-6
Testing large-scale distributed systems is a challenge, because some errors manifest themselves only after a distributed sequence of events that involves machine and network failures. D³S is a checker that allows developers to specify predi...
https://doi.org/10.1007/978-3-030-33702-5_3
Distributed applications consist of a collection of heterogeneous but fully autonomous components that can execute on different computers. While each of these components has full control over its constituent subparts, there is no master com...
https://doi.org/10.1201/b17923-7
This chapter demystifies computing systems consisting of multiple CPUs, shared and distributed memory, and different types of I/O in the form of multiprocessors and multicomputers that eventually gave rise to distributed computing systems a...
https://doi.org/10.1201/9781003383055-9
A brief description is given of the author's use of configuration programming in the conic environment, and an assessment is made of the benefits of such an approach. Based on this experience, the author extends the notions of configuration...
https://doi.org/10.1109/cmpeur.1990.113648
https://doi.org/10.1007/3-540-19333-2
Leslie Lamport, known for his seminal work in distributed systems, famously said, "A distributed system is one in which the failure of a computer you didn’t even know existed can render your own computer unusable." Given this bleak outlook ...
https://doi.org/10.1145/2857274.2889274
https://doi.org/10.1007/3-540-56733-x_144
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms, such as k-means. However, spectral clustering suffers from a scalability problem in both memory use and computational ...
https://doi.org/10.1109/tpami.2010.88
https://doi.org/10.1007/3-540-19488-6_106
https://doi.org/10.1007/978-3-319-12247-2
In order to realize green ecosocieties, the total electric power consumption of computers and networks is required to be reduced. In applications on distributed systems, clients issue service requests to servers and then servers send replie...
https://doi.org/10.1109/tie.2012.2206357
https://doi.org/10.1016/j.cose.2009.05.005
https://doi.org/10.1007/3-540-54430-5_99