Filters








240,965 Hits in 2.3 sec

Primitives for distributed computing

Barbara Liskov
1979 Proceedings of the seventh symposium on Operating systems principles - SOSP '79  
This paper discusses primitives that support the construction of distributed programs. Attention is focussed on primitives in two major areas: modularity and communication.  ...  The primitives will ultimately be provided as part of a programming language that will be used to experiment with construction of distributed programs. I.  ...  The remainder of this paper discusses primitives for distributed computing in two key areas, namely, modularity and communication.  ... 
doi:10.1145/800215.806567 dblp:conf/sosp/Liskov79 fatcat:6oobinidkvbqvm43ddazfjchfi

Distributed Mega-Datasets: The Need for Novel Computing Primitives

Niklas Semmler, Georgios Smaragdakis, Anja Feldmann
2019 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)  
Hereby, we point out two research challenges: The need for (1) novel computing primitives that allow us to aggregate data at scale across multiple hierarchies (i.e., time and location) while answering  ...  These sensors produce highly, even globally, distributed data streams. The aggregate data rate of these streams far exceeds local storage and computing capabilities.  ...  EXAMPLE: COMPUTING PRIMITIVES FOR NETWORK MONITORING Here, we revisit the use-case of network monitoring and present a computing primitive for this use case.  ... 
doi:10.1109/icdcs.2019.00167 dblp:conf/icdcs/SemmlerSF19 fatcat:nqe57xddqbd2jnugjfggwljdcu

A Framework for Suspicious Action Detection with Mixture Distributions of Action Primitives [chapter]

Yoshio Iwai
2009 Lecture Notes in Computer Science  
In this paper, we propose a generic framework for detecting suspicious actions with mixture distributions of action primitives, of which collection represents human actions.  ...  Sequential Monte Carlo is used to approximate the distributions for fast calculation, but it tends to converge one local minimum.  ...  To avoid a local minimum, one solution is that we increase the number of sampling points to approximate the probability distribution accurately, but the computation time would increase.  ... 
doi:10.1007/978-3-540-92957-4_45 fatcat:5buxibuc4vbhfgu7am2r2lwivi

Communication Primitives for Real-Time Distributed Synchronization over Small Area Networks

Sang-Hun Lee, Hyun-Wook Jin
2009 2009 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing  
In this paper, we propose a novel design of communication primitives called RTDiP-Sync for real-time distributed synchronization over small area networks.  ...  In this paper, we propose a novel design of communication primitives called RTDiP-Sync for real-time distributed synchronization over small area networks.  ...  CONCLUSIONS AND FUTURE WORK In this paper, we have proposed a novel design of communication primitives called RTDiP-Sync for real-time distributed synchronization over small area networks.  ... 
doi:10.1109/isorc.2009.30 dblp:conf/isorc/LeeJ09 fatcat:s2a7ycshubarhcubm4bbmiv4sy

Pragmatic primitives for non-blocking data structures

Trevor Brown, Faith Ellen, Eric Ruppert
2013 Proceedings of the 2013 ACM symposium on Principles of distributed computing - PODC '13  
We provide an implementation of these new primitives from single-word compare-and-swap and prove it correct.  ...  We define a new set of primitive operations that greatly simplify the implementation of non-blocking data structures in asynchronous shared-memory systems.  ...  However, LL and SC operations have often been seen as more convenient primitives for building algorithms.  ... 
doi:10.1145/2484239.2484273 dblp:conf/podc/BrownER13 fatcat:kfi3khic4jg47o7igzdrtlnlzy

Global flush communication primitive for inter-process communication

Ashwani Gahlot, Mohan Ahuja, Timothy Carlson
1994 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94  
We propose a global flush communication primitive which allows the sender to order receipt of a message with respect to receipt of messages in its past and/or its Juture.  ...  Acknowledgements We thank Mukesh Singhal for his valuable comments.  ...  Distributed Computing, 1:40-52, 1986. Bounding logical clocks in distributed systems.  ... 
doi:10.1145/197917.197970 dblp:conf/podc/GahlotAC94 fatcat:4w727flm4zeznla5saybb2uwgi

An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives

Horst Wedde
1983 Theoretical Computer Science  
For an independent and Graphical representation of the constraints in distributed system parts the fti,r malism of Loo.wl~ Coupled Sy.wlns is recalled.  ...  We roconsidcl :I general problem for distributed processes which access shared resources 12. 131. The solution scheme for the special case of Dijkstra's problem applies at once to thr general case.  ...  In this section we want to point out that we have so far already modeled the solution scheme for a Fig. 20. considerably more general interaction problem under distributed control.  ... 
doi:10.1016/0304-3975(83)90127-5 fatcat:jgzexvaphvbqnayccjrqvh2xyq

A local distributed peer-to-peer algorithm using multi-party optimization based privacy preservation for data mining primitive computation

Kamalika Das, Hillol Kargupta, Kanishka Bhaduri
2009 2009 IEEE Ninth International Conference on Peer-to-Peer Computing  
This paper proposes a scalable, local privacy-preserving algorithm for distributed peer-to-peer (P2P) data aggregation useful for many advanced data mining/analysis tasks such as average/sum computation  ...  Since distributed sum computation is a frequently used primitive, the proposed approach is likely to have significant impact on many data mining tasks such as multi-party privacypreserving clustering,  ...  It has been widely used in privacy-preserving distributed data mining as an important primitive.  ... 
doi:10.1109/p2p.2009.5284514 dblp:conf/p2p/DasBK09 fatcat:jwbgdjujvbbelmblpujikmrssy

Flexible general purpose communication primitives for distributed systems

R. Baldoni, R. Beraldi, R. Prakash
Proceedings. The Sixth IEEE International Symposium on High Performance Distributed Computing (Cat. No.97TB100183)  
This paper presents the slotted-FIFO communication mode that supports communication primitives for the entire spectrum of reliability and ordering requirements of distributed applications: FIFO as well  ...  Hence, the slotted-FIFO communication mode is suitable for multimedia applications, as well as non real-time distributed applications.  ...  Acknowledgments The authors would like to thank Roy Friedman of Cor-ne11 University for useful comments and discussions on an earlier version of the paper.  ... 
doi:10.1109/hpdc.1997.626404 dblp:conf/hpdc/BaldoniBP97 fatcat:ul5l4srtb5bnta2rnlqxpqtode

Communication primitives for ubiquitous systems or RPC considered harmful

U. Saif, D.J. Greaves
Proceedings 21st International Conference on Distributed Computing Systems Workshops  
Its procedural call semantics are argued as an efficient unifying paradigm for both local and remote access. Our experience with ubiquitous device control systems has shown otherwise.  ...  This position paper considers other alternatives and proposes the use of comvets (conditional, mobility aware events) as the unifying generic communication paradigm for such systems.  ...  Acknowledgements We would like to thank Jean Beacon for her insightful comments that helped us improve the paper.  ... 
doi:10.1109/cdcs.2001.918712 dblp:conf/icdcsw/SaifG01 fatcat:w24ukkmicve2pfvic5mr66kwl4

Nonlinear force fields: a distributed system of control primitives for representing and learning movements

F.A. Mussa-Ivaldi
Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation'  
This paper explores the computational consequences of this structure in the framework of multivariate approximation.  ...  This nding indicates that basis elds such as the gradients of Gaussian functions constitute an appropriate control primitive for learning to control a repertoire of movement patterns across a substantial  ...  This paper presents a computational framework in which the combination of few independent force elds such as those generated by stimulation of the spinal cord provides a general way for dealing with movement  ... 
doi:10.1109/cira.1997.613842 dblp:conf/cira/Mussa-Ivaldi97 fatcat:wajyhglzvvcbhbyhoi2mexyc5u

Generic Executable Semantics for D-Clean

Viktória Zsók, Pieter Koopman, Rinus Plasmeijer
2011 Electronical Notes in Theoretical Computer Science  
First, the executable semantics definition for each D-Clean primitive is given in an abstract way.  ...  The computations are distributed automatically over the Grid by the middleware system.  ...  The DStart and DStop primitives The task of the DStart primitive is to start building up the distributed computation by generating the communication channels for the input dataflow of the distributed graph  ... 
doi:10.1016/j.entcs.2011.11.040 fatcat:oqx7twxpxrcedehhxjjoiqwoci

An elementary completeness proof for secure two-party computation primitives

Ye Wang, Prakash Ishwar, Shantanu Rane
2014 2014 IEEE Information Theory Workshop (ITW 2014)  
, if interaction is also allowed over general communication primitives (multi-input/output channels), there are "complete" primitives that enable any function to be securely computed.  ...  For semi-honest parties and informationtheoretic security guarantees, it is well-known that, if only noiseless communication is available, only a limited set of functions can be securely computed; however  ...  A function P X,Y |Q,T is said to be securely computable given a set of primitives if and only if for all ✏, > 0, there exists a protocol for computing P X,Y |Q,T using the given primitives that is (✏,  ... 
doi:10.1109/itw.2014.6970886 dblp:conf/itw/WangIR14 fatcat:axnbifdpuzhqpdvajo54q24bye

Analysis of digitized 3D mesh curvature histograms for reverse engineering

S. Gauthier, W. Puech, R. Bénière, G. Subsol
2017 Computers in industry (Print)  
Moreover, we propose to use the curvature histogram analysis for many steps of a reverse engineering process, which can be used to retrieve a CAD model from a digitized one for example.  ...  For primitive extraction, the type of the primitive is deduced from the distribution and then curvature tolerances are computed to fully adapt them to each 555 3D mesh.  ...  For 3D mesh segmentation, curvature thresholds are computed from the distribution to extract the object salient edges.  ... 
doi:10.1016/j.compind.2017.06.008 fatcat:oacfmnsd4zgfvd6nn2smxh5ywa

An Elementary Completeness Proof for Secure Two-Party Computation Primitives [article]

Ye Wang, Prakash Ishwar, Shantanu Rane
2014 arXiv   pre-print
, if interaction is also allowed over general communication primitives (multi-input/output channels), there are "complete" primitives that enable any function to be securely computed.  ...  For semi-honest parties and information-theoretic security guarantees, it is well-known that, if only noiseless communication is available, only a limited set of functions can be securely computed; however  ...  A function P X,Y |Q,T is said to be securely computable given a set of primitives if and only if for all ǫ, δ > 0, there exists a protocol for computing P X,Y |Q,T using the given primitives that is (ǫ  ... 
arXiv:1402.4360v2 fatcat:54tbrwrjd5fr7ocidbsdxob5ve
« Previous Showing results 1 — 15 out of 240,965 results