Filters








4,371 Hits in 5.1 sec

Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization [chapter]

Dominik Gall, Riko Jacob, Andrea Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
2009 Lecture Notes in Computer Science  
Parallel Time Complexity We define the distributed runtime of a self-stabilizing algorithm as the total number of rounds required in the worst-case to establish a desirable topology (e.g., a linearized  ...  Introduction This brief announcement proposes a new model to measure the distributed time complexity of topological self-stabilization.  ... 
doi:10.1007/978-3-642-05118-0_58 fatcat:3fhf5wl3z5c4fg7bgksklx3urm

Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization [chapter]

Dominik Gall, Riko Jacob, Andrea Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
2010 Lecture Notes in Computer Science  
As a case study, we consider local graph linearization-i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner.  ...  Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture.  ...  In this paper, we address one of the first and foremost questions in distributed topological self-stabilization: How to measure the parallel time complexity?  ... 
doi:10.1007/978-3-642-12200-2_27 fatcat:o6ub2bk3rfhtnbqm7vuhy2f6la

Scalable Runtime for MPI: Efficiently Building the Communication Infrastructure [chapter]

George Bosilca, Thomas Herault, Pierre Lemarinier, Ala Rezmerita, Jack J. Dongarra
2011 Lecture Notes in Computer Science  
A precedent work [3] proposes a self-stabilizing algorithm to build such an overlay on top of a tree.  ...  In order to enable all these roles on a exascale parallel machine, which features hundreds of thousands of computing nodes (each of them featuring thousands of cores), scalability of the runtime environment  ... 
doi:10.1007/978-3-642-24449-0_44 fatcat:qwwz3hlqo5b6vmy2424e23hzgy

Local Quantitative LTL Model Checking [chapter]

Jiří Barnat, Luboš Brim, Ivana Černá, Milan Češka, Jana Tůmová
2009 Lecture Notes in Computer Science  
However, the global model checking procedure can be significantly outperformed by a dedicated local model checking one.  ...  On the other hand, in local model checking approach the probability of satisfaction is computed only for the set of initial states.  ...  cryptographers [9] -Leads -asynchronous leader election protocol [18] -Phils -randomized dining philosophers [19] -Stabi -randomized self-stabilizing protocol [17] Fig. 4 . a) Runtimes for  ... 
doi:10.1007/978-3-642-03240-0_8 fatcat:i5nlqnzuybfftdsjfe6giadmli

Using Linearization for Global Consistency in SSR

Kendy Kutzner, Thomas Fuhrmann
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
Recent results on self-stabilizing algorithms now suggest a new approach to bootstrap the virtual rings of SSR and VRR. This so-called linearization method does not require any flooding at all.  ...  The iterative successor pointer rewiring protocol (ISPRP) is one way to bootstrap such a network. Like its VRR-analogon, ISPRP requires one of the nodes to flood the network to guarantee consistency.  ...  The authors would like to thank Christian Scheideler for the fruitful discussions that lead to this paper.  ... 
doi:10.1109/ipdps.2007.370656 dblp:conf/ipps/KutznerF07 fatcat:e7luwmcy6fg4lnuqnf6oxwklhy

Robust architectures for open distributed systems and topological self-stabilization

Stefan Schmid
2010 Proceedings of the Third International Workshop on Reliability, Availability, and Security - WRAS '10  
Finally, we advocate the design of self-stabilizing topologies-a very appealing and still not well-understood notion of robustness-that converge quickly to a desirable structure from arbitrarily degenerated  ...  As a use case, graph linearization is examined in more detail. This invited paper complements the WRAS'10 talk and is joint work with  ...  Graph Linearization Graph linearization can be regarded as the drosophila melanogaster of topological self-stabilization: We investigate how to recover a sorted list-i.e., how to linearize a graph-from  ... 
doi:10.1145/1953563.1953569 dblp:conf/podc/Schmid10 fatcat:prd2iy7dtzbxdasinyk32s7vhu

Self‐adaptation on parallel stream processing: A systematic review

Adriano Vogel, Dalvan Griebler, Marco Danelutto, Luiz Gustavo Fernandes
2021 Concurrency and Computation  
In this work, we aim at providing a literature review regarding self-adaptation applied to the parallel stream processing domain.  ...  In this vein, stream processing is a class of applications that compute data flowing in the form of streams (e.g., video feeds, images, and data analytics), where parallel computing can help accelerate  ...  It is possible to note in the section "Fissioned-stages" of Figure 4 that the majority of studies focus on managing application graph topologies with a single fissioned stage.  ... 
doi:10.1002/cpe.6759 fatcat:4qa2hlnhijbjbhmf73de5qa2re

SimPL: An effective placement algorithm

Myung-Chul Kim, Dong-Jin Lee, Igor L. Markov
2010 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)  
Our placer SimPL outperforms mPL6, NTUPlace3, FastPlace3, APlace2 and Capo simultaneously in runtime and solution quality, running 6.4 times faster than mPL6 and reducing wirelength by 2% on the ISPD 2005  ...  It maintains lower-bound and upper-bound placements that converge to a final solution. The upperbound placement is produced by a novel rough legalization algorithm.  ...  This work was partially supported by the US National Science Foundation (NSF) through a CAREER award, as well as by Sun Microsystems and Texas Instruments.  ... 
doi:10.1109/iccad.2010.5654229 dblp:conf/iccad/KimLM10 fatcat:em56qvcf65h4dnesy6fgtve6rm

SimPL: An Effective Placement Algorithm

Myung-Chul Kim, Dong-Jin Lee, Igor L. Markov
2012 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Our placer SimPL outperforms mPL6, NTUPlace3, FastPlace3, APlace2 and Capo simultaneously in runtime and solution quality, running 6.4 times faster than mPL6 and reducing wirelength by 2% on the ISPD 2005  ...  It maintains lower-bound and upper-bound placements that converge to a final solution. The upperbound placement is produced by a novel rough legalization algorithm.  ...  This work was partially supported by the US National Science Foundation (NSF) through a CAREER award, as well as by Sun Microsystems and Texas Instruments.  ... 
doi:10.1109/tcad.2011.2170567 fatcat:c22g4cmu7jcmxcxrvjau3lsnie

Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs

Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid
2012 Theoretical Computer Science  
In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of "local Delaunay graphs" and which forwards temporary edges in greedy fashion reminiscent of compass routing  ...  This article studies the construction of self-stabilizing topologies for distributed systems.  ...  Acknowledgments A preliminary version of this article without proofs has been published at the 20th International Symposium on Algorithms and Computation (ISAAC), 2009 [18] .  ... 
doi:10.1016/j.tcs.2012.07.029 fatcat:253teybqonffpdz6jp7dnq7yge

Analysis of the Current Electric Battery Models for Electric Vehicle Simulation

Gaizka Saldaña, José Ignacio San Martín, Inmaculada Zamora, Francisco Javier Asensio, Oier Oñederra
2019 Energies  
In this sense, this paper serves as a reference for the scientific community focused on the development of control and optimization strategies in the field of electric vehicles, since it facilitates the  ...  Electric vehicles (EVs) are a promising technology to reduce emissions, but its development enormously depends on the technology used in batteries.  ...  Figure 19 shows a runtime model, which is commonly used for runtime simulation of a battery under a fixed average current. where Rself-dis is the self-discharge resistance, CCap is the capacitor that  ... 
doi:10.3390/en12142750 fatcat:2mwyv7zyxrdfrj6zizmysbe6c4

FastSV: A Distributed-Memory Connected Component Algorithm with Fast Convergence [article]

Yongzhe Zhang, Ariful Azad, Zhenjiang Hu
2020 arXiv   pre-print
FastSV outperforms the state-of-the-art algorithm by an average speedup of 2.21x (max 4.27x) on a variety of real-world graphs.  ...  We map different steps of FastSV to linear algebraic operations and implement them with the help of scalable graph libraries.  ...  Nevertheless, the extra iterations needed by Algorithm 1 increase the runtime of parallel SV algorithms.  ... 
arXiv:1910.05971v2 fatcat:bvon3tci5vdfvnuy5miimuhbpm

On the runtime of universal coating for programmable matter

Joshua J. Daymude, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter, Andréa W. Richa, Christian Scheideler, Thim Strothmann
2017 Natural Computing  
We continue the study of our Universal Coating algorithm by focusing on its runtime analysis, showing that our algorithm terminates within a linear number of rounds with high probability.  ...  In this paper, we study the problem of uniformly coating objects of arbitrary shape in the context of self-organizing programmable matter, i.e., programmable matter which consists of simple computational  ...  We first show that coating problems do not only have a (trivial) linear lower bound on the runtime, but that there is also a linear lower bound on the competitive gap between the runtime of fully local  ... 
doi:10.1007/s11047-017-9658-6 fatcat:xepybp57ujbgpomvk3zj3mhcpq

Parallel MATALAB Techniques [chapter]

Ashok Krishnamurthy, Siddharth Samsi, Vijay Gadepally
2009 Image Processing  
In this chapter, we show why parallel MATLAB is useful, provide a comparison of the different parallel MATLAB choices, and describe a number of applications in Signal and Image Processing: Audio Signal  ...  The objective of this chapter is to help signal and image processing algorithm developers understand the advantages of using parallel MATLAB to tackle larger problems while staying within the powerful  ...  Acknowledgements The authors would like to thank Gene Whipps (Army Research Laboratory, Adephi, MA, USA) for providing the ARL GRAPE application. The authors would also like to thank Dr.  ... 
doi:10.5772/7046 fatcat:kwvywkabtnfw5oz55afidj5xmu

Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth [article]

Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis
2020 arXiv   pre-print
Our results also imply a bound of O(κ· (n+m)· t^2) for each objective on MDPs, where κ is the number of strategy-iteration refinements required for the given input and objective.  ...  For an MC with n states and m transitions, we show that each of the classical quantitative objectives can be computed in O((n+m)· t^2) time, given a tree decomposition of the MC that has width t.  ...  If a self-loop (u, u) appears in our graph, this is equivalent to having an equation e u := y u = R in the linear system, in which R is a linear expression that contains a non-zero multiple of y u .  ... 
arXiv:2004.08828v1 fatcat:6chxbu5odfchbfuxizn2nfw2re
« Previous Showing results 1 — 15 out of 4,371 results