Filters








799,842 Hits in 6.3 sec

Shared Global States in Distributed Computations

Eddy Fromentin, Michel Raynal
1997 Journal of computer and system sciences (Print)  
A consistent observation of a given distributed computation is a sequence of global states that could be produced by executing that computation on a monoprocessor system.  ...  Therefore a distributed execution generally accepts several consistent observations. This paper investigates global states shared by all such observations.  ...  For example, in the lattice depicted in Fig. is a shared global state. The number of shared global states depends on both the computation and the abstraction level.  ... 
doi:10.1006/jcss.1997.1512 fatcat:nmttuj6zaraojdldfwxm7uznda

Tracing Distributed Component-Based Systems, a Brief Overview [chapter]

Yliès Falcone, Hosein Nazarpour, Mohamad Jaber, Marius Bozga, Saddek Bensalem
2018 Lecture Notes in Computer Science  
Local events are sent to a global observer which reconstructs on-the-fly the global traces that are compatible with the local traces, in a concurrency-preserving and communication-delay insensitive fashion  ...  We overview a framework for tracing asynchronous distributed component-based systems with multiparty interactions managed by distributed schedulers.  ...  A system state consists in the states of all components. The computation lattice is represented implicitly using vector clocks.  ... 
doi:10.1007/978-3-030-03769-7_24 fatcat:dxjfpz6lzncjjphgtwkmrtyvvm

Computation Offloading in Beyond 5G Networks: A Distributed Learning Framework and Applications [article]

Xianfu Chen and Celimuge Wu and Zhi Liu and Ning Zhang and Yusheng Ji
2020 arXiv   pre-print
To address the technical challenges originating from the uncertainties and the sharing of limited resource in an MEC system, we formulate the computation offloading problem as a multi-agent Markov decision  ...  We present a case study on resource orchestration in computation offloading to showcase the potentials of an online distributed reinforcement learning algorithm developed under the proposed framework.  ...  Notice that the global state transition follows the probability distribution over the next global states as a result of the joint action under the current global state.  ... 
arXiv:2007.08001v1 fatcat:pomlqitbbfcxlp2byq2uowbhja

Restoring consistent global states of distributed computations

Arthur P. Goldberg, Ajei Gopal, Andy Lowry, Rob Strom
1991 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging - PADD '91  
We present a mechanism for restoring any consistent global state of a distributed computation.  ...  Our mechanism offers flexibility in the following ways: any consistent global state of the computation can be restored; execution can be replayed either exactly as it occurred initially or with user-controlled  ...  Conclusions We have presented a mechanism called Distributed State Restorer (DSR) that allows users to debug their distributed applications by manipulating the global states of a computation in a natural  ... 
doi:10.1145/122759.122772 dblp:conf/pdd/GoldbergGLS91 fatcat:7mopswmpzzbpjl45vpz7u34qaa

Parallel Graph Generation Algorithms for Shared and Distributed Memory Machines [chapter]

S.C. Allmaier, S. Dalibor, D. Kreische
1998 Advances in Parallel Computing  
For distributed memory machines a dynamically adaptive partitioning strategy to distribute the state space onto di erent processors together with load balancing mechanisms is implemented.  ...  In this paper we give an overview and a comparison of two parallel algorithms for the state space generation in stochastic modeling on common classes of multiprocessors.  ...  The global state of the system is then given by the distribution of resources | which are called tokens | on the places. Such a global state is called a marking of the GSPN.  ... 
doi:10.1016/s0927-5452(98)80074-9 fatcat:nie3ra42jfbrbml5l77tnvcjme

Restoring consistent global states of distributed computations

Arthur P. Goldberg, Ajei Gopal, Andy Lowry, Rob Strom
1991 SIGPLAN notices  
We present a mechanism for restoring any consistent global state of a distributed computation.  ...  Our mechanism offers flexibility in the following ways: any consistent global state of the computation can be restored; execution can be replayed either exactly as it occurred initially or with user-controlled  ...  Conclusions We have presented a mechanism called Distributed State Restorer (DSR) that allows users to debug their distributed applications by manipulating the global states of a computation in a natural  ... 
doi:10.1145/127695.122772 fatcat:7jnjzojixzguhlskhg4bq5yxwy

A Comparative Analysis of Performance of Shared Memory Cluster Computing Interconnection Systems

Minakshi Tripathy, C. R. Tripathy
2014 Journal of Computer Networks and Communications  
In recent past, many types of shared memory cluster computing interconnection systems have been proposed. Each of these systems has its own advantages and limitations.  ...  The systems taken up for the purpose of the study are shared memory clusters, hierarchical shared memory clusters, distributed shared memory clusters, and the virtual distributed shared memory clusters  ...  Journal of Computer Networks and Communications  ... 
doi:10.1155/2014/128438 fatcat:qcjwpzai3bewnnvkti7s6vu7tq

Perspectives of New Decision Making Models of Processes Synchronization in Distributed Systems

David L. La Red Martinez, Julio C. Acosta
2014 INTERNATIONAL JOURNAL OF MANAGEMENT & INFORMATION TECHNOLOGY  
In the groups of processes in distributed systems is necessary to make decisions based on agreements; these processes may operate in distributed teams; processes may require the use of shared resources  ...  (are considered classical models for access to data structures shared in the form of mutual exclusion using critical regions (from memory), the centralized algorithm, the Lamport distributed algorithm,  ...  ACKNOWLEDGMENTS He is grateful for the funding of the research project "Decision Models for the Processes Synchronization in Distributed Systems", accredited by Science and Technology General Secretariat  ... 
doi:10.24297/ijmit.v9i1.671 fatcat:kwks3724o5g3pbbxhfuey54fau

pVD — Personal Video Distribution

Fei Su, John Markus Bjorndalen, Phuong Hoai Ha, Otto J. Anshus
2013 2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)  
The design has a local side sending and viewing videos, and a global side coordinating the switching and distribution of videos, and maintaining subscriptions and video state.  ...  The Personal Video Distribution (pVD) system supports sending and viewing live and stored videos between any of a single user's computers, and allows for a smooth handover of play back between computers  ...  CONCLUSIONS In this paper, we present a personal video distribution system for simple ad hoc sharing of live (camera) and stored video streams between a single user's computer.  ... 
doi:10.1109/wimob.2013.6673431 dblp:conf/wimob/SuBHA13 fatcat:euhzdcyytzhthirkfjzkggnhxu

Piccolo: Building Fast, Distributed Programs with Partitioned Tables

Russell Power, Jinyang Li
2010 USENIX Symposium on Operating Systems Design and Implementation  
Unlike existing data-flow models, Piccolo allows computation running on different machines to share distributed, mutable state via a key-value table interface.  ...  In particular, applications can specify locality policies to exploit the locality of shared state access and Piccolo's run-time automatically resolves write-write conflicts using userdefined accumulation  ...  Distributed shared memory [29, 32, 7, 17] and tuple spaces [13] allow sharing of distributed in-memory state.  ... 
dblp:conf/osdi/PowerL10 fatcat:rvjq67iuuneelfhun3a5ahucmi

A survey of checkpointing algorithms for parallel and distributed computers

S. Kalaiselvi, V. Rajaraman
2000 Sadhana (Bangalore)  
Recently algorithms have been published for distributed shared memory systems, which extend the cache coherence protocols used in shared memory systems.  ...  It is however felt that in development of parallel programs the user has to do a fair amount of work in distributing tasks and this information can be effectively used to simplify checkpointing and rollback  ...  Checkpointing algorithms for distributed shared-memory systems Distributed shared memory (DSM) systems have global address space like shared-memory systems but the memory is distributed across all the  ... 
doi:10.1007/bf02703630 fatcat:35tb2vnfcfh35ausgg4gv5qaaq

Programming and Timing Analysis of Parallel Programs on Multicores

Eugene Yip, Partha S. Roop, Morteza Biglari-Abhari, Alain Girault
2013 2013 13th International Conference on Application of Concurrency to System Design  
Consequently, they are rapidly penetrating market segments which are both safety critical and hard real-time in nature.  ...  By reducing our representation of the programs state-space, we reduced the analysis time for the largest program (with 43, 695 reachable states) by a factor of 342, to only 7 seconds.  ...  When all the threads in the program state have been traversed, the overhead for ending the global tick is computed.  ... 
doi:10.1109/acsd.2013.19 dblp:conf/acsd/YipRBG13 fatcat:d6dc57b3nvfafm62bjarkgkkly

Modeling and Validation of Object-Oriented Test Case through Finite State Machine

Taskeen Zaidi, Vipin Saxena
2013 International Journal of Computer Applications  
A UML state diagram is designed and then converted into the transition diagram for computation of valid test cases by the use of Finite State Machine (FSM).  ...  Distributed computing approach is preferred over centralized approach due to low cost involvement and for providing reliability and expandability to network.  ...  INTRODUCTION Distributed computing approach is very popular now days as it offers execution of tasks without using global clock, resources sharing, data sharing audio and video sharing, reliability and  ... 
doi:10.5120/12716-9530 fatcat:qj6swpx6jrfx7hp3bdbeuccu3i

How to withstand mobile virus attacks (extended abstract)

Rafail Ostrovsky, Moti Yung
1991 Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91  
We show how local computations (at each processor) and global computations can be polynomial factor-redundancy in the  ...  We initiate a study of distributed adversarial model of computation in which faults are non-stationary and can move through the net work, analogous to a spread of a virus or a worm.  ...  s To summarize, the community (as a whole) keeps the current legal state of each machine in its "global" (and shared) memory.  ... 
doi:10.1145/112600.112605 dblp:conf/podc/OstrovskyY91 fatcat:dp4ujza57rev7dghzgjj2uthzu

Distributed Kalman Filters in Sensor Networks: Bipartite Fusion Graphs

Usman A. Khan, Jose M. F. Moura
2007 2007 IEEE/SP 14th Workshop on Statistical Signal Processing  
We propose a generalized distributed Jacobi algorithm to compute global matrix inversion, locally, in an iterative fashion.  ...  We employ bipartite fusion graphs in order to fuse the shared observations and shared estimates across the local models.  ...  So the sensors having shared states have different observations of the shared states. The observations corresponding to the shared states need to be fused in order to guarantee global performance.  ... 
doi:10.1109/ssp.2007.4301349 fatcat:vgw6uzupqfe4vb446zzix2p2jm
« Previous Showing results 1 — 15 out of 799,842 results