Relevant bibliographies by topics / Distributed systems and algorithms

Academic literature on the topic 'Distributed systems and algorithms'

Author: Grafiati
Published: 10 December 2022
Last updated: 16 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Distributed systems and algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Distributed systems and algorithms"

1

Kindler, Ekkart, and Sibylle Peuker. "Integrating Distributed Algorithms into Distributed Systems." Fundamenta Informaticae 37, no. 3 (1999): 291–309. http://dx.doi.org/10.3233/fi-1999-37306.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Hyeon-Seok, and Jae-Jung Yun. "Advanced MPPT Algorithm for Distributed Photovoltaic Systems." Energies 12, no. 18 (September 19, 2019): 3576. http://dx.doi.org/10.3390/en12183576.

Full text
Abstract:
The basic and adaptive maximum power point tracking algorithms have been studied for distributed photovoltaic systems to maximize the energy production of a photovoltaic (PV) module. However, the basic maximum power point tracking algorithms using a fixed step size, such as perturb and observe and incremental conductance, suffer from a trade-off between tracking accuracy and tracking speed. Although the adaptive maximum power point tracking algorithms using a variable step size improve the maximum power point tracking efficiency and dynamic response of the basic algorithms, these algorithms still have the oscillations at the maximum power point, because the variable step size is sensitive to external factors. Therefore, this paper proposes an enhanced maximum power point tracking algorithm that can have fast dynamic response, low oscillations, and high maximum power point tracking efficiency. To achieve these advantages, the proposed maximum power point tracking algorithm uses two methods that can apply the optimal step size to each operating range. In the operating range near the maximum power point, a small fixed step size is used to minimize the oscillations at the maximum power point. In contrast, in the operating range far from the maximum power point, a variable step size proportional to the slope of the power-voltage curve of PV module is used to achieve fast tracking speed under dynamic weather conditions. As a result, the proposed algorithm can achieve higher maximum power point tracking efficiency, faster dynamic response, and lower oscillations than the basic and adaptive algorithms. The theoretical analysis and performance of the proposed algorithm were verified by experimental results. In addition, the comparative experimental results of the proposed algorithm with the other maximum power point tracking algorithms show the superiority of the proposed algorithm.
APA, Harvard, Vancouver, ISO, and other styles
3

Dao-Tran, Minh, Thomas Eiter, Michael Fink, and Thomas Krennwallner. "Distributed Evaluation of Nonmonotonic Multi-context Systems." Journal of Artificial Intelligence Research 52 (April 29, 2015): 543–600. http://dx.doi.org/10.1613/jair.4574.

Full text
Abstract:
Multi-context Systems (MCSs) are a formalism for systems consisting of knowledge bases (possibly heterogeneous and non-monotonic) that are interlinked via bridge rules, where the global system semantics emerges from the local semantics of the knowledge bases (also called “contexts”) in an equilibrium. While MCSs and related formalisms are inherently targeted for distributed set- tings, no truly distributed algorithms for their evaluation were available. We address this short- coming and present a suite of such algorithms which includes a basic algorithm DMCS, an ad- vanced version DMCSOPT that exploits topology-based optimizations, and a streaming algorithm DMCS-STREAMING that computes equilibria in packages of bounded size. The algorithms be- have quite differently in several respects, as experienced in thorough experimental evaluation of a system prototype. From the experimental results, we derive a guideline for choosing the appropriate algorithm and running mode in particular situations, determined by the parameter settings.
APA, Harvard, Vancouver, ISO, and other styles
4

Challenger, Moharram, Elif Haytaoglu, Gorkem Tokatli, Orhan Dagdeviren, and Kayhan Erciyes. "A Hybrid Distributed Mutual Exclusion Algorithm for Cluster-Based Systems." Mathematical Problems in Engineering 2013 (2013): 1–15. http://dx.doi.org/10.1155/2013/703414.

Full text
Abstract:
Distributed mutual exclusion is a fundamental problem which arises in various systems such as grid computing, mobile ad hoc networks (MANETs), and distributed databases. Reducing key metrics like message count per any critical section (CS) and delay between two CS entrances, which is known as synchronization delay, is a great challenge for this problem. Various algorithms use either permission-based or token-based protocols. Token-based algorithms offer better communication costs and synchronization delay. Raymond's and Suzuki-Kasami's algorithms are well-known token-based ones. Raymond's algorithm needs onlyO(log2(N)) messages per CS and Suzuki-Kasami's algorithm needs just one message delivery time between two CS entrances. Nevertheless, both algorithms are weak in the other metric, synchronization delay and message complexity correspondingly. In this work, a new hybrid algorithm is proposed which gains from powerful aspects of both algorithms. Raysuz's algorithm (the proposed algorithm) uses a clustered graph and executes Suzuki-Kasami's algorithm intraclusters and Raymond's algorithm interclusters. This leads to have better message complexity than that of pure Suzuki-Kasami's algorithm and better synchronization delay than that of pure Raymond's algorithm, resulting in an overall efficient DMX algorithm pure algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Castanon, D., and D. Teneketzis. "Distributed estimation algorithms for nonlinear systems." IEEE Transactions on Automatic Control 30, no. 5 (May 1985): 418–25. http://dx.doi.org/10.1109/tac.1985.1103972.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ciobanu, Gabriel. "Distributed algorithms over communicating membrane systems." Biosystems 70, no. 2 (July 2003): 123–33. http://dx.doi.org/10.1016/s0303-2647(03)00035-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhuravel, S., O. Shpur, and Yu Pyrih. "METHOD OF ACHIEVING CONSENSUS IN DISTRIBUTED SERVICE." Information and communication technologies, electronic engineering 2, no. 2 (December 2022): 58–66. http://dx.doi.org/10.23939/ictee2022.02.058.

Full text
Abstract:
This article examines the problems of distributed algorithms and proposes their solution using temporal analysis. There are many things that can go wrong in distributed systems that can cause the system to crash. The solution to this is to build a system that can withstand the problems that arise during its operation. It turns out that having an algorithm capable of reaching consensus is extremely important for systems that want to function properly despite network failures. Although consensus is omitted in performance-oriented systems, they still rely heavily on systems that implement consensus algorithms for them (such as Zookeeper, etc.) to handle the consensus-reduced task, while at the same time having some weaker consistency model. In turn, the algorithms available today have several problems, the solution of which will significantly increase the performance of the algorithms and, as a result, the systems that use them. This article discusses the problems that arise in existing implementations and presents a data analysis technique and model for solving one of the algorithm problem.
APA, Harvard, Vancouver, ISO, and other styles
8

Mishra, Swati, and Sanjaya Kumar Panda. "Efficient Fault Tolerant Algorithms for Internet Distributed Systems." International Journal of Knowledge Discovery in Bioinformatics 7, no. 1 (January 2017): 71–90. http://dx.doi.org/10.4018/ijkdb.2017010106.

Full text
Abstract:
In the current era, Internet is the fastest growing technology. It is a global network of distributed systems that interconnects with each other to share various resources and computation. The complexity of the distributed systems is rapidly increasing, which leads to an increased susceptibility of failure to the participating computers such as clients and servers and their interconnections. Therefore, the main challenge is to address such failures and develop efficient algorithms to tolerate such failures. In this paper, four fault tolerant algorithms, namely server-based fault tolerant (SFT), client-based fault tolerant (CFT), client-server fault tolerant (CSFT) and connection fault tolerant (CoFT) are proposed to deal with the above challenge. The proposed algorithms are evaluated in terms of number of failures (NOF), load factor (LF) and load standard deviation (LSD) and compared with an existing algorithm. The comparison results show the superior performance of the proposed algorithms.
APA, Harvard, Vancouver, ISO, and other styles
9

Logeswaran, Rajasvaran, and Li-Choo Chen. "Load Balancing Algorithms in Distributed Service Architectures for Medical Applications." International Journal of Healthcare Information Systems and Informatics 5, no. 1 (January 2010): 76–90. http://dx.doi.org/10.4018/jhisi.2010110305.

Full text
Abstract:
This paper investigates the performance of two proposed load balancing algorithms for Object-Oriented Distributed Service Architectures (DSA) that are open and flexible, enabling rapid and easy development of new applications on various kinds of software and hardware platforms, catering for telecommunications and distributed medical applications. The proposed algorithms, namely, Node Status Algorithm and Random Sender Initiated Algorithm, have been developed as solutions to the performance problems faced by the DSA. The performance of the proposed algorithms have been tested and compared with baseline load balancing algorithms, namely the Random Algorithm and Shortest Queue Algorithm. Simulation results show that both the proposed algorithms perform better than the baseline algorithms, especially in heavily loaded conditions. This paper discusses the mechanisms of the algorithms and reports on the investigations that have been carried out in comparing the load balancing algorithms implemented on a DSA-based network, which is useful for the distributed computing requirements of the medical field.
APA, Harvard, Vancouver, ISO, and other styles
10

Balanescu, Tudor, Radu Nicolescu, and Huiling Wu. "Asynchronous P Systems." International Journal of Natural Computing Research 2, no. 2 (April 2011): 1–18. http://dx.doi.org/10.4018/jncr.2011040101.

Full text
Abstract:
In this paper, the authors propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the field of distributed algorithms. The authors validate the proposed approach by implementing several well-known distributed depth-first search (DFS) and breadth-first search (BFS) algorithms. Empirical results show that the proposed P algorithms have shorter descriptions and achieve a performance comparable to the corresponding distributed algorithms.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Distributed systems and algorithms"

1

Pandit, Saurav. "Approximation algorithms for distributed systems." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/870.

Full text
Abstract:
Distributed Approximation is a new and rapidly developing discipline that lies at the crossroads of various well-established areas of Computer Science - Distributed Computing, Approximation Algorithms, Graph Theory and often, Computational Geometry. This thesis focuses on the design and analysis of distributed algorithms to solve optimization problems that usually arise in large-scale, heavily dynamic, resource constrained networks, e.g. wireless ad-hoc and sensor networks, P2P systems, mobile networks etc. These problems can often be abstracted by variations of well-known combinatorial optimization problems, such as topology control, clustering etc. Many of these problems are known to be hard (NP-complete). But we need fast and light-weight distributed algorithms for these problems, that yield near-optimal solutions. The results presented in this thesis can be broadly divided in two parts. The first part contains a set of results that obtain improved solutions to the classic problem of computing a sparse "backbone" for Wireless Sensor Networks (WSNs). In graph-theoretic terms, the goal is to compute a spanning subgraph of the input graph, that is sparse, lightweight and has low stretch. The term "low stretch" indicates that in spite of dropping many edges, the distance between any two nodes in the graph is not increased by much. We model WSNs as geometric graphs - unit ball graphs, quasi-unit ball graphs etc. in Euclidean spaces, as well as in more general metric spaces of low doubling dimension. We identify and exploit a variety of geometric features of those models to obtain our results. In the second part of the thesis we focus on distributed algorithms for clustering problems. We present several distributed approximation algorithms for clustering problems (e.g., minimum dominating set, facility location problems) that improve on best known results so far. The main contribution here is the design of distributed algorithms where the running time is a "tunable" parameter. The advent of distributed systems of unprecedented scale and complexity motivates the question of whether it is possible to design algorithms that can provide non-trivial approximation guarantees even after very few rounds of computation and message exchanges. We call these algorithms "k-round algorithms". We design k-round algorithms for various clustering problems that yield non-trivial approximation factors even if k is a constant. Additionally, if k assumes poly-logarithmic values, our algorithms match or improve on the best-known approximation factors for these problems.
APA, Harvard, Vancouver, ISO, and other styles
2

Bernabéu-Aubán, José Manuel. "Location finding algorithms for distributed systems." Diss., Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/32951.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cornejo, Collado Alejandro. "Local distributed algorithms for multi-robot systems." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/79220.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 165-173) and index.
The field of swarm robotics focuses on controlling large populations of simple robots to accomplish tasks more effectively than what is possible using a single robot. This thesis develops distributed algorithms tailored for multi-robot systems with large populations. Specifically we focus on local distributed algorithms since their performance depends primarily on local parameters on the system and are guaranteed to scale with the number of robots in the system. The first part of this thesis considers and solves the problem of finding a trajectory for each robot which is guaranteed to preserve the connectivity of the communication graph, and when feasible it also guarantees the robots advanced towards a goal defined by an arbitrary motion planner. We also describe how to extend our proposed approach to preserve the k-connectivity of a communication graph. Finally, we show how our connectivity-preserving algorithm can be combined with standard averaging procedures to yield a provably correct flocking algorithm. The second part of this thesis considers and solves the problem of having each robot localize an arbitrary subset of robots in a multi-robot system relying only on sensors at each robot that measure the angle, relative to the orientation of each robot, towards neighboring robots in the communication graph. We propose a distributed localization algorithm that computes the relative orientations and relative positions, up to scale, of an arbitrary subset of robots. For the case when the robots move in between rounds we show how to use odometry information to allow each robot to compute the relative positions complete with scale, of an arbitrary subset of robots. Finally we describe how to use the our localization algorithm to design a variety of multi-robot tasks.
by Alejandro Cornejo.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
4

Saia, Jared. "Algorithms for managing data in distributed systems /." Thesis, Connect to this title online; UW restricted, 2002. http://hdl.handle.net/1773/6941.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wilhelm, Daniel. "Ordered broadcast algorithms in dynamic distributed systems." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS135.

Full text
Abstract:
La diffusion causale est un élément fondamental de nombreux systèmes distribués et parallèles, où les processus collaborent pour effectuer des tâches communes, telles que le calcul à haute performance, les bases de données distribuées, les conférences, les réseaux sociaux ou d'autres services fournissant un service à de nombreux utilisateurs. Dans de tels systèmes, les processus ont souvent besoin d'une primitive de diffusion pour partager des informations qui doivent être ordonnées pour avoir un sens, et l'ordre causal a été prouvé être l'ordre le plus fort qui peut être implémenté dans des systèmes dans lesquels des partitionnements peuvent se produire. Les algorithmes de diffusion causale existants ne sont soit pas évolutifs, soit ils ne tolèrent pas toutes les dynamiques introduites par les processus qui rejoignent et quittent le système ou qui sont fautifs pendant l'exécution. Dans cette thèse, nous proposons des algorithmes de diffusion causale qui passent à l'échelle et qui tolèrent les dynamiques des systèmes distribués. Nous proposons d'abord des algorithmes de diffusion causale pour les réseaux mobiles. Ces réseaux ont des caractéristiques spécifiques : des capacités limitées des nœuds (calcul, stockage, énergie), des canaux de communication peu fiables et la dynamique des connexions due à la mobilité des nœuds, à l'échec des nœuds et aux nœuds qui rejoignent et quittent le système durant l'exécution. Dans la deuxième partie, nous abordons la diffusion causale fournie avec des horloges de taille constante. Les horloges de taille constante tolèrent les processus qui rejoignent et quittent le système, et ils ont une taille qui ne dépend pas du nombre de processus. Cependant, elles ne caractérisent pas la causalité et les algorithmes les utilisant ne garantissent l'ordre causal que de manière probabiliste. Nous proposons d'abord un détecteur d'erreurs, basé sur le hachage, qui analyse les horloges de taille constante des messages avant de les livrer afin de détecter les messages qui ont des dépendances causales que le processus n'a pas encore livré. Deuxièmement, nous proposons un algorithme pour récupérer les dépendances causales des messages, que nous utilisons pour assurer la livraison causale des messages marqués par le détecteur d'erreurs. Troisièmement, nous proposons une nouvelle horloge, dénommée horloge de taille dynamique, composée d'horloges probabilistes, et dont la taille peut être modifiée durant l'exécution. La taille de l'horloge peut plus particulièrement s'adapter à la quantité de messages concurrents à l'intérieur du système. Nous avons implémentés les contributions sur le simulateur OMNeT++. Les deux algorithmes de diffusion causale pour réseaux mobiles ont été implémentés dans le framework INET, qui est un simulateur de réseau réaliste implémenté sur le simulateur OMNeT++, et qui implémente entre autres les interférences sur le réseau sans fil, les couches de réseau et la mobilité des nœuds. Les résultats confirment que les algorithmes de diffusion causale présentés surpassent les algorithmes existants pour les réseaux mobiles tout en faisant des hypothèses de réseau plus réalistes que la majorité d'entre eux. Les contributions aux horloges de taille constante ont été implémentées sur le simulateur OMNeT++. Les résultats montrent que le détecteur d'erreurs basé sur le hachage a détecté tous les messages délivrés en dehors de l'ordre causal. En combinant le détecteur d'erreurs basé sur le hachage avec l'algorithme pour récupérer les dépendances causales des messages, nous avons pu livrer tous les messages dans l'ordre causal. Nous avons analysé les limites du détecteur d'erreurs basé sur le hachage et la récupération des dépendances causales. Enfin, les résultats montrent que la nouvelle horloge proposée s'adapte bien au nombre de messages concurrents à l'intérieur du système
Causal broadcast is a fundamental building block of many distributed and parallel applications, where processes collaborate to perform common tasks, such as high performance computing, distributed databases, conferencing, social networks or other services providing a service to many users. In such systems, processes often require a broadcast primitive to share information that must be ordered to be meaningful, and causal order has been proven to be the strongest order that can be implemented in systems where partitioning can occur. Existing causal broadcast algorithms are either not scalable or they do not tolerate all the dynamics introduced by processes that join and leave the system or fail during execution. Some works append on messages all the information required to causally order them at destination. However, it has been proved that a structure with one entry per process in the system is the minimal structure required to ensure the causal delivery of broadcast messages. Hence, algorithms that append all the causal information on messages do not scale. Some other works make assumptions on the system, such as the network topology or the FIFO property of the communication channels. Such works do not handle well the dynamics caused by processes that join and leave the system or fail. Hence, these works do not handle all the possible dynamics of distributed systems. In this thesis, we provide causal broadcast algorithms that do scale and tolerate the dynamics of distributed systems. We first provide causal broadcast algorithms for Mobile Networks. Such networks have specific features: limited capacities of nodes (computation, storage, energy), unreliable communication channels, and the dynamics of connections due to node mobility, node failure, and join/leave operations of nodes. In the second part, we address causal broadcast provided with constant size clocks. Constant size clocks tolerate process churn and have a size that does not depend on the number of processes. However, they do not characterize causality and algorithms using them only ensure causal order probabilistically. We first propose an error detector, based on hashes, which analyzes the constant size clocks of messages before delivering them in order to detect messages which have causal dependencies that the process did not deliver yet. Second, we propose an algorithm to retrieve the causal dependencies of messages, which we use to ensure the causal delivery of messages tagged by the error detector. Third, we propose a new clock build with constant size clocks and which adapts its size to the number of concurrent messages inside the system. We implemented the contributions on the OMNeT++ simulator. Both causal broadcast algorithms were implemented on the framework INET, which is a realistic network simulator implementing interferences on the wireless network, network layers and node mobility among others. Results confirm that the presented causal broadcast algorithms outperform existing algorithms done for Mobile Networks while making realistic network assumptions. The contributions to constant size clocks were implemented on the OMNeT++ simulator. Results show that the hash-based error detector detected all messages whose causal dependencies have not been delivered yet. Combining the hash-based error detector with the algorithm to retrieve the causal dependencies of messages allowed to deliver all messages in causal order. We analyzed the limits of the hash-based error detector and the retrieval of causal dependencies. Finally, results show that the proposed clock adapts itself well to the number of concurrent messages inside the system
APA, Harvard, Vancouver, ISO, and other styles
6

Huq, Sikder Rezwanul. "Locally self-adjusting distributed algorithms." Diss., University of Iowa, 2018. https://ir.uiowa.edu/etd/6594.

Full text
Abstract:
In this dissertation, we study self-adjusting algorithms for large-scale distributed systems. Self-adjusting algorithms enable distributed systems to adjust their properties dynamically as the input pattern changes. Self-adjustment is an attractive tool as it has the potential to significantly improve the performance of distributed systems, especially when the input patterns are skewed. We start with a distributed self-adjusting algorithm for skip graphs that minimizes the average routing costs between arbitrary communication pairs by performing topological adaptation to the communication pattern. Our algorithm is fully decentralized, conforms to the CONGEST model (i.e. uses O(log n) bit messages), and requires O(log n) bits of memory for each node, where n is the total number of nodes. Upon each communication request, our algorithm first establishes communication by using the standard skip graph routing, and then locally and partially reconstructs the skip graph topology to perform topological adaptation. We propose a computational model for such algorithms, as well as a yardstick (working set property) to evaluate them. Our working set property can also be used to evaluate self-adjusting algorithms for other graph classes where multiple tree-like subgraphs overlap (e.g. hypercube networks). We derive a lower bound of the amortized routing cost for any algorithm that follows our model and serves an unknown sequence of communication requests. We show that the routing cost of our algorithm is at most a constant factor more than the amortized routing cost of any algorithm conforming to our computational model. We also show that the expected transformation cost for our algorithm is at most a logarithmic factor more than the amortized routing cost of any algorithm conforming to our computational model. As a follow-up work, we present a distributed self-adjusting algorithm (referred to as DyHypes) for topological adaption in hypercubic networks. One of the major differences between hypercubic networks and skip graphs is that hypercubic networks are more rigid in structure than that of skip graphs. This property of hypercubic networks makes self-adjustment significantly different compared to skip graphs. Upon a communication between an arbitrary pair of nodes, DyHypes transforms the network to place frequently communicating nodes closer to each other to maximize communication efficiency, and uses randomization in the transformation process to speed up the transformation and reduce message complexity. We show that, as compared to DSG, DyHypes reduces the transformation cost by a factor of O(log n), where n is the number of nodes involved in the transformation. Moreover, despite achieving faster transformation with lower message complexity, the combined cost (routing and transformation) of DyHypes is at most a log log n factor more than that of any algorithm that conforms to the computational model adopted for this work. Similar to DSG, DyHypes is fully decentralized, conforms to the CONGEST model, and requires O(log n) bits of memory for each node, where N is the total number of nodes. Finally, we present a novel distributed load balancing algorithm called Meezan to address the load imbalance among large-scale networked cache servers. Modern web services rely on a network of distributed cache servers to efficiently deliver content to users. Load imbalance among cache servers can substantially degrade content delivery performance. Due to the skewed and dynamic nature of real-world workloads, cache servers that serve viral content experience higher load as compared to other cache servers. Our algorithm Meezan replicates popular objects to mitigate skewness and adjusts hash space boundaries in response to load dynamics in a novel way. Our theoretical analysis shows that Meezan achieves near perfect load balancing for a wide range of operating parameters. Our trace driven simulations shows that Meezan reduces load imbalance by up to 52% as compared to prior solutions.
APA, Harvard, Vancouver, ISO, and other styles
7

Ghodsi, Ali. "Distributed k-ary System: Algorithms for Distributed Hash Tables." Doctoral thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4186.

Full text
Abstract:
This dissertation presents algorithms for data structures called distributed hash tables (DHT) or structured overlay networks, which are used to build scalable self-managing distributed systems. The provided algorithms guarantee lookup consistency in the presence of dynamism: they guarantee consistent lookup results in the presence of nodes joining and leaving. Similarly, the algorithms guarantee that routing never fails while nodes join and leave. Previous algorithms for lookup consistency either suffer from starvation, do not work in the presence of failures, or lack proof of correctness. Several group communication algorithms for structured overlay networks are presented. We provide an overlay broadcast algorithm, which unlike previous algorithms avoids redundant messages, reaching all nodes in O(log n) time, while using O(n) messages, where n is the number of nodes in the system. The broadcast algorithm is used to build overlay multicast. We introduce bulk operation, which enables a node to efficiently make multiple lookups or send a message to all nodes in a specified set of identifiers. The algorithm ensures that all specified nodes are reached in O(log n) time, sending maximum O(log n) messages per node, regardless of the input size of the bulk operation. Moreover, the algorithm avoids sending redundant messages. Previous approaches required multiple lookups, which consume more messages and can render the initiator a bottleneck. Our algorithms are used in DHT-based storage systems, where nodes can do thousands of lookups to fetch large files. We use the bulk operation algorithm to construct a pseudo-reliable broadcast algorithm. Bulk operations can also be used to implement efficient range queries. Finally, we describe a novel way to place replicas in a DHT, called symmetric replication, that enables parallel recursive lookups. Parallel lookups are known to reduce latencies. However, costly iterative lookups have previously been used to do parallel lookups. Moreover, joins or leaves only require exchanging O(1) messages, while other schemes require at least log(f) messages for a replication degree of f. The algorithms have been implemented in a middleware called the Distributed k-ary System (DKS), which is briefly described.
QC 20100824
APA, Harvard, Vancouver, ISO, and other styles
8

AGATE, Vincenzo. "REPUTATION MANAGEMENT ALGORITHMS IN DISTRIBUTED APPLICATIONS." Doctoral thesis, Università degli Studi di Palermo, 2020. http://hdl.handle.net/10447/395198.

Full text
Abstract:
Nowadays, several distributed systems and applications rely on interactions between unknown agents that cooperate in order to exchange resources and services. The distributed nature of these systems, and the consequent lack of a single centralized point of control, let agents to adopt selfish and malicious behaviors in order to maximize their own utility. To address such issue, many applications rely on Reputation Management Systems (RMSs) to estimate the future behavior of unknown agents before establishing actual interactions. The relevance of these systems is even greater if the malicious or selfish behavior exhibited by a few agents may reduce the utility perceived by cooperative agents, leading to a damage to the whole community. RMSs allow to estimate the expected outcome of a given interaction, thus providing relevant information that can be exploited to take decisions about the convenience of interacting with a certain agent. Agents and their behavior are constantly evolving and becoming even more complex, so it is increasingly difficult to successfully develop the RMS, able to resist the threats presented. A possible solution to this problem is the use of agent-based simulation software designed to support researchers in evaluating distributed reputation management systems since the design phase. This dissertation presents the design and the development of a distributed simulation platform based on HPC technologies called DRESS. This solution allows researchers to assess the performance of a generic reputation management system and provides a comprehensive assessment of its ability to withstand security attacks. In the scientific literature, a tool that allows the comparison of distinct RMS and different design choices through a set of defined metrics, also supporting large-scale simulations, is still missing. The effectiveness of the proposed approach is demonstrated by the application scenario of user energy sharing systems within smart-grids and by considering user preferences differently from other work. The platform has proved to be useful for the development of an energy sharing system among users, which with the aim of maximizing the amount of energy transferred has exploited the reputation of users once learned their preferences.
APA, Harvard, Vancouver, ISO, and other styles
9

Obrovac, Marko. "Chemical Computing for Distributed Systems: Algorithms and Implementation." Phd thesis, Université Rennes 1, 2013. http://tel.archives-ouvertes.fr/tel-00925257.

Full text
Abstract:
Avec l'émergence de plates-formes distribuées très hétérogènes, dynamiques et à large échelle, la nécessité d'un moyen de les programmer efficacement et de les gérer est apparu. Le concept de l'informatique autonomique propose de créer des systèmes auto-gérés c'est-à-dire des systèmes qui sont conscients de leurs composants et de leur environnement, et peuvent se configurer, s'optimiser, se réparer et se protéger. Dans le cadre de la réalisation de tels systèmes, la programmation déclarative, dont l'objectif est de faciliter la tâche du programmeur en séparant le contrôle de la logique du calcul, a retrouvé beaucoup d'intérêt ces derniers temps. En particulier, la programmation à base de des règles est considérée comme un modèle prometteur dans cette quête d'abstractions de programmation adéquates pour ces plates-formes. Cependant, bien que ces modèles gagnent beaucoup d'attention, ils créent une demande pour des outils génériques capables de les exécuter à large échelle. Le modèle de programmation chimique, qui a été conçu suivant la métaphore chimique, est un modèle de programmation à bas de règles et d'ordre supérieur, avec une exécution non-déterministe, où les règles sont appliquées de façon concurrente sur un multi ensemble de données. Dans cette thèse, nous proposons la conception, le développement et l'expérimentation d'un intergiciel distribué pour l'exécution de programmes chimique sur des plates-formes à large échelle et génériques. L'architecture proposée combine une couche de communication pair-à-pair avec un protocole de capture atomique d'objets sur lesquels les règles doivent être appliquées, et un système efficace de détection de terminaison. Nous décrivons le prototype d'intergiciel mettant en oeuvre cette architecture. En s'appuyant sur son déploiement sur une plate-forme expérimentale à large échelle, nous présentons les résultats de performance, qui confirment les complexités analytiques obtenues et montrons expérimentalement la viabilité d'un tel modèle de programmation.
APA, Harvard, Vancouver, ISO, and other styles
10

Divi, Vijay 1980. "Estimation and calibration algorithms for distributed sampling systems." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45874.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
Includes bibliographical references (p. 153-157).
Traditionally, the sampling of a signal is performed using a single component such as an analog-to-digital converter. However, many new technologies are motivating the use of multiple sampling components to capture a signal. In some cases such as sensor networks, multiple components are naturally found in the physical layout; while in other cases like time-interleaved analog-to-digital converters, additional components are added to increase the sampling rate. Although distributing the sampling load across multiple channels can provide large benefits in terms of speed, power, and resolution, a variety mismatch errors arise that require calibration in order to prevent a. degradation in system performance.In this thesis, we develop low-complexity, blind algorithms for the calibration of distributed sampling systems. In particular, we focus on recovery from timing skews that cause deviations from uniform timing. Methods for bandlimited input reconstruction from nonuniform recurrent samples are presented for both the small-mismatch and the low-SNR domains. Alternate iterative reconstruction methods are developed to give insight into the geometry of the problem.From these reconstruction methods, we develop time-skew estimation algorithms that have high performance and low complexity even for large numbers of components. We also extend these algorithms to compensate for gain mismatch between sampling components. To understand the feasibility of implementation, analysis is also presented for a sequential implementation of the estimation algorithm.In distributed sampling systems, the minimum input reconstruction error is dependent upon the number of sampling components as well as the sample times of the components. We develop bounds on the expected reconstruction error when the time-skews are distributed uniformly.
(cont) Performance is compared to systems where input measurements are made via projections onto random bases, an alternative to the sinc basis of time-domain sampling. From these results, we provide a framework on which to compare the effectiveness of any calibration algorithm.Finally, we address the topic of extreme oversampling, which pertains to systems with large amounts of oversampling due to redundant sampling components. Calibration algorithms are developed for ordering the components and for estimating the input from ordered components. The algorithms exploit the extra samples in the system to increase estimation performance and decrease computational complexity.
by Vijay Divi.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Distributed systems and algorithms"

1

Chow, Randy. Distributed operating systems & algorithms. Reading, Mass: Addison Wesley, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chow, Randy. Distributed operating systems & algorithms. Reading, Mass: Addison-Wesley, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Haddad, Serge. Distributed systems: Design and algorithms. Hoboken, NJ: John Wiley & Sons, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Raynal, Michel. Distributed Algorithms for Message-Passing Systems. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38123-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kshemkalyani, Ajay D. Distributed computing: Principles, algorithms, and systems. Cambridge: Cambridge University Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kshemkalyani, Ajay. Distributed Computing: Principles, Algorithms, and Systems. Leiden: Cambridge University Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Neumann, Dirk, Mark Baker, Jörn Altmann, and Omer Rana, eds. Economic Models and Algorithms for Distributed Systems. Basel: Birkhäuser Basel, 2010. http://dx.doi.org/10.1007/978-3-7643-8899-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Neumann, Dirk. Economic models and algorithms for distributed systems. Basel: Birkhäuser, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ghosh, Sukumar. Distributed systems: An algorithmic approach. Boca Raton: CRC Press, Taylor & Franciss Group, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Distributed systems: An algorithmic approach. Boca Raton: Chapman & Hall/CRC, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Distributed systems and algorithms"

1

Ölveczky, Peter Csaba. "Distributed Algorithms." In Designing Reliable Distributed Systems, 211–32. London: Springer London, 2017. http://dx.doi.org/10.1007/978-1-4471-6687-0_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dolev, Danny. "Theory and practice in distributed systems." In Distributed Algorithms, 71. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/bfb0022138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ricciardi, Aleta, Kenneth Birman, and Patrick Stephenson. "The cost of order in asynchronous systems." In Distributed Algorithms, 329–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56188-9_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Israeli, Amos, Amnon Shaham, and Asaf Shirazi. "Linear-time snapshot protocols for unbalanced systems." In Distributed Algorithms, 26–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57271-6_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dolev, Shlomi. "Optimal time self stabilization in dynamic systems." In Distributed Algorithms, 160–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57271-6_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Moser, Louise E., and P. M. Melliar-Smith. "Total ordering algorithms for asynchronous Byzantine systems." In Distributed Algorithms, 242–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/bfb0022151.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hélary, Jean-Michel, Achour Mostéfaoui, and Michel Raynal. "Virtual precedence in asynchronous systems: Concept and applications." In Distributed Algorithms, 170–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0030683.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Stoller, Scott D. "Detecting global predicates in distributed systems with clocks." In Distributed Algorithms, 185–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0030684.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Babaoğlu, Özalp, Alberto Bartoli, and Gianluca Dini. "Replicated file management in large-scale distributed systems." In Distributed Algorithms, 1–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/bfb0020420.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Vidyasankar, K., and Toshimi Minoura. "An optimistic resiliency control scheme for distributed database systems." In Distributed Algorithms, 297–309. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0019810.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Distributed systems and algorithms"

1

Zambonelli, F. "Distributed algorithms and systems." In Proceedings Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing. IEEE, 2003. http://dx.doi.org/10.1109/empdp.2003.1183591.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jiannong Cao, Yifeng Chen, Kang Zhang, and Yanxiang He. "Checkpointing in hybrid distributed systems." In 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. IEEE, 2004. http://dx.doi.org/10.1109/ispan.2004.1300471.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Osmera, P. "Multilevel distributed genetic algorithms." In 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA). IEE, 1995. http://dx.doi.org/10.1049/cp:19951099.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

McLurkin, James. "Distributed algorithms for multi-robot systems." In the 6th international conference. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1236360.1236432.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

McLurkin, James. "Distributed Algorithms for Multi-Robot Systems." In 2007 6th International Symposium on Information Processing in Sensor Networks. IEEE, 2007. http://dx.doi.org/10.1109/ipsn.2007.4379717.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Richard, Alexander, Jesse Francis, and Jalal Kawash. "Basic Distributed Algorithms Visual Simulations for Distributed Systems Students." In 2021 IEEE Global Engineering Education Conference (EDUCON). IEEE, 2021. http://dx.doi.org/10.1109/educon46332.2021.9453906.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Didona, Diego, Panagiota Fatourou, Rachid Guerraoui, Jingjing Wang, and Willy Zwaenepoel. "Distributed Transactional Systems Cannot Be Fast." In SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3323165.3323189.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cechin, Sérgio Luis, and Ingrid Jansch-Pôrto. "Performance Evaluation of Checkpoint and Rollback-Recovery Algorithms for Distributed Systems." In Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho. Sociedade Brasileira de Computação, 1998. http://dx.doi.org/10.5753/sbac-pad.1998.22668.

Full text
Abstract:
In distributed systems, backward recovery has the synchronous and asynchronous approaches as the two main implementation paradigms. In this paper we compare two representative algorithms on these groups and present some theoretical results. Koo & Toueg synchronous algorithm and Juang & Venkatesan asynchronous algorithm have been chosen for this purpose. Our goal is to demonstrate that the advantages and disadvantages between them are mainly related to the characteristics of the applications.
APA, Harvard, Vancouver, ISO, and other styles
9

Luo, Yang, King Tin Lam, and Cho-Li Wang. "Path-Analytic Distributed Object Prefetching." In 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks. IEEE, 2009. http://dx.doi.org/10.1109/i-span.2009.131.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ciobanu, Gabriel. "TiMo: Timed Mobility in Distributed Systems." In 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2013. http://dx.doi.org/10.1109/synasc.2013.8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Distributed systems and algorithms"

1

Prasadan, Arvind. Sketching Algorithms in Distributed Systems. Office of Scientific and Technical Information (OSTI), October 2021. http://dx.doi.org/10.2172/1826094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cho, Kilseok, Alan D. George, Raj Subramaniyan, and Keonwook Kim. Parallel Algorithms for Adaptive Matched-Field Processing in Distributed Array Systems. Fort Belvoir, VA: Defense Technical Information Center, January 2003. http://dx.doi.org/10.21236/ada465545.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cho, Kilseok, Alan D. George, and Raj Subramaniyan. Fault-Tolerant Parallel Algorithms for Adaptive Matched-Field Processing on Distributed Array Systems. Fort Belvoir, VA: Defense Technical Information Center, September 2004. http://dx.doi.org/10.21236/ada466282.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cristian, Flaviu. AASERT Grant - Distributed Systems and Flow Analysis Algorithm. Fort Belvoir, VA: Defense Technical Information Center, November 1997. http://dx.doi.org/10.21236/ada334840.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Varshney, Pramod K., and Wael Hashlamoun. ALGORITHMS FOR SENSOR FUSION: Applications of Distance Measures and Probability of Error Bounds to Distributed. Detection Systems. Volume 2. Fort Belvoir, VA: Defense Technical Information Center, December 1991. http://dx.doi.org/10.21236/ada254634.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Davis, M., D. Costyk, and A. Narang. Distributed and Electric Power System Aggregation Model and Field Configuration Equivalency Validation Testing: Supplemental Report on Penetration Software Algorithms. Office of Scientific and Technical Information (OSTI), March 2005. http://dx.doi.org/10.2172/15011464.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Meyer, David, and Jeffrey Remmel. Distributed Algorithms for Sensor Fusion. Fort Belvoir, VA: Defense Technical Information Center, October 2002. http://dx.doi.org/10.21236/ada415039.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Leighton, Tom. Parallel and Distributed Computing Combinatorial Algorithms. Fort Belvoir, VA: Defense Technical Information Center, October 1993. http://dx.doi.org/10.21236/ada277333.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jajodia, Sushil. Replica Control Algorithms in Distributed Databases. Fort Belvoir, VA: Defense Technical Information Center, July 1993. http://dx.doi.org/10.21236/ada271571.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hungate, Joseph, and Geraldina Fernandes. Distributed systems:. Gaithersburg, MD: National Institute of Standards and Technology, 1995. http://dx.doi.org/10.6028/nist.ir.5735.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Distributed systems and algorithms' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography