Filters








18,111 Hits in 3.6 sec

Fork sequential consistency is blocking

Christian Cachin, Idit Keidar, Alexander Shraer
2009 Information Processing Letters  
We show that no storage access protocol can on the one hand preserve sequential consistency and wait-freedom when the server is correct, and on the other hand always preserve fork sequential consistency  ...  A fork-sequentially-consistent history in which some permutation π of complete(σ ) is a possible view of all clients is sequentially consistent.  ...  It should guarantee sequential consistency and wait-freedom when the server is correct, and fork sequential consistency otherwise.  ... 
doi:10.1016/j.ipl.2008.12.004 fatcat:lujyhhsndbcrdobgz4u7vnfjqm

Fork Sequential Consistency is Blocking [article]

Christian Cachin, Idit Keidar, Alexander Shraer
2008 arXiv   pre-print
We show that no storage access protocol can on the one hand preserve sequential consistency and wait-freedom when the server is correct, and on the other hand always preserve fork sequential consistency  ...  A fork-sequentially-consistent history in which some permutation π of complete(σ ) is a possible view of all clients is sequentially consistent.  ...  It should guarantee sequential consistency and wait-freedom when the server is correct, and fork sequential consistency otherwise.  ... 
arXiv:0805.2068v1 fatcat:t7y2qqye6jbatclqgybv5trjqq

Executing PRAM Programs on GPUs

Jurgen Brenner, Jorg Keller, Christoph Kessler
2012 Procedia Computer Science  
The resulting CUDA code is almost 100 times faster than the previous simulator for compiled Fork programs and allows to handle larger data sizes.  ...  We explain the design decisions and evaluate a prototype implementation consisting of a runtime library and a set of rules to transform simple Fork programs which we for now apply by hand.  ...  This means that the grid must consist of more than one block, with the possibility that two blocks are executed simultaneously on two different SMs.  ... 
doi:10.1016/j.procs.2012.04.198 fatcat:cakxdtaqrvdzbndoowvdjcfhsu

Efficient fork-linearizable access to untrusted shared memory

Christian Cachin, Abhi Shelat, Alexander Shraer
2007 Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing - PODC '07  
Furthermore, we give novel characterizations of fork-linearizability and prove that it is neither stronger nor weaker than sequential consistency.  ...  When data is stored on a faulty server that is accessed concurrently by multiple clients, the server may present inconsistent data to different clients.  ...  that fork-linearizability is incomparable with sequential consistency.  ... 
doi:10.1145/1281100.1281121 dblp:conf/podc/CachinSS07 fatcat:urvwjr74evcfpalrl6ztj7kzda

Well-Structured Futures and Cache Locality [article]

Maurice Herlihy, Zhiyu Liu
2017 arXiv   pre-print
In fork-join parallelism, a sequential program is split into a directed acyclic graph of tasks linked by directed dependency edges, and the tasks are executed, possibly in parallel, in an order consistent  ...  That result is returned when some thread touches that future, blocking if necessary until the result is ready.  ...  In our model, a cache is fully associative and consists of multiple cache lines, each of which holds the data in a memory block. Each instruction can access only one memory block.  ... 
arXiv:1309.5301v3 fatcat:qzqu3pffzfhijhhwgwkbjjyqnm

Well-structured futures and cache locality

Maurice Herlihy, Zhiyu Liu
2014 Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '14  
In fork-join parallelism, a sequential program is split into a directed acyclic graph of tasks linked by directed dependency edges, and the tasks are executed, possibly in parallel, in an order consistent  ...  That result is returned when some thread touches that future, blocking if necessary until the result is ready.  ...  In our model, a cache is fully associative and consists of multiple cache lines, each of which holds the data in a memory block. Each instruction can access only one memory block.  ... 
doi:10.1145/2555243.2555257 dblp:conf/ppopp/HerlihyL14 fatcat:xvnnjnzhgndltgevb3e36uewpa

Blockchain Abstract Data Type

Emmanuelle Anceaume, Antonella Del Pozzo, Romaric Ludinard, Maria Potop-Butucaru, Sara Tucci-Piergiovanni
2019 The 31st ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '19  
Our work is based on an original oracle-based construction that, along with new consistency definitions, captures the eventual convergence process in blockchain systems.  ...  This paper is the first to specify blockchains as a composition of abstract data types all together with a hierarchy of consistency criteria that formally characterizes the histories admissible for distributed  ...  . it is a sequential history.  ... 
doi:10.1145/3323165.3323183 dblp:conf/spaa/AnceaumePLPP19 fatcat:6jpajvl5ybca5e36qqetbkno5u

Deterministic Consistency: A Programming Model for Shared Memory Parallelism [article]

Amittai Aviram, Bryan Ford
2010 arXiv   pre-print
We propose "deterministic consistency", a parallel programming model as easy to understand as the "parallel assignment" construct in sequential languages such as Perl and JavaScript, where concurrent threads  ...  DC supports common data- and task-parallel synchronization abstractions such as fork/join and barriers, as well as non-hierarchical structures such as producer/consumer pipelines and futures.  ...  Fork/Join: OpenMP's foundation is its parallel construct, which forks multiple threads to execute a parallel code block and then rejoins them.  ... 
arXiv:0912.0926v2 fatcat:zeg74gwos5h5zagkf4xsnl74um

A Task-driven Parallel Code Generation Scheme for Coarse Grain Parallelization on Android Platform

Akimasa Yoshida, Akira Kamiyama, Hiroki Oka
2017 Journal of Information Processing  
However, in the case of ordinary programs, it is difficult to implement a coarse-grain parallel code based on Fork/Join framework considering data-dependency.  ...  The Fork/Join framework provides the scheduling mechanism with work-stealing and it is mainly used for programs to implement the divide-and-conquer algorithm or the recursive algorithm.  ...  A macrotask is classified into one of three types: a basic block, a repetition block (e.g., a for-statement, a while-statement), and a subroutine block (e.g., a method).  ... 
doi:10.2197/ipsjjip.25.426 fatcat:so7x7r5huvbrxb27y33jzjsjgm

Fork-consistent constructions from registers

Matthias Majuntke, Dan Dobre, Neeraj Suri
2011 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11  
Fork-consistent emulations offer one way to protect the clients of a remote service, which is usually correct but may suffer from Byzantine faults.  ...  In this paper, we address the fundamental structure of a fork-consistent emulation and ask the question: Can one provide a fork-consistent emulation in which the service does not execute computation steps  ...  Weak fork-linearizability is the strongest known fork-consistency property that may be implemented in a wait-free manner.  ... 
doi:10.1145/1993806.1993837 dblp:conf/podc/MajuntkeDS11 fatcat:qcmsqak6ofhv3lejifypnvsdo4

Fork-Consistent Constructions from Registers [chapter]

Matthias Majuntke, Dan Dobre, Christian Cachin, Neeraj Suri
2011 Lecture Notes in Computer Science  
Fork-consistent emulations offer one way to protect the clients of a remote service, which is usually correct but may suffer from Byzantine faults.  ...  In this paper, we address the fundamental structure of a fork-consistent emulation and ask the question: Can one provide a fork-consistent emulation in which the service does not execute computation steps  ...  Weak fork-linearizability is the strongest known fork-consistency property that may be implemented in a wait-free manner.  ... 
doi:10.1007/978-3-642-25873-2_20 fatcat:zguzas3ctbbi7cjdctxpf6i7qq

A framework for quantitative evaluation of parallel control-flow obfuscation

Yu-Lun Huang, Hsin-Yi Tsai
2012 Computers & security  
By selecting target code blocks in the control flow graph and applying obfuscating transformations to the target code blocks, the original program is then obfuscated.  ...  Software obfuscation is intended to protect a program by thwarting reverse engineering.  ...  If no forks exist in j, i.e. j is a sequential program, then pcomp(j) ¼ 0.  ... 
doi:10.1016/j.cose.2012.08.003 fatcat:evxd6yugsbfpfiueqolny4mikq

Verifying the Consistency of Remote Untrusted Services with Commutative Operations [chapter]

Christian Cachin, Olga Ohrimenko
2014 Lecture Notes in Computer Science  
This paper presents the Conflict-free Operation verification Protocol (COP) that ensures linearizability when the server is correct and preserves fork-linearizability in any other case.  ...  If the server forks two clients by hiding an operation, these clients never again see operations of each other.  ...  If all operations are to proceed without blocking, though, it is necessary to weaken the consistency guarantees to weak fork-linearizability [5] , for instance.  ... 
doi:10.1007/978-3-319-14472-6_1 fatcat:ww5r322d5re7xiseosyd7pekla

Occam-pi as a High-Level Language for Coarse-Grained Reconfigurable Architectures

Zain-ul-Abdin, Bertil Svensson
2011 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum  
This is made possible by extending the compiler framework to target the XPP architecture, including automatic floating to fixed-point conversion.  ...  The support from European Union Artemis Project SMECY is also acknowledged.  ...  This research is part of the CERES research program funded by the Knowledge Foundation and the ELLIIT strategic research initiative funded by the Swedish government.  ... 
doi:10.1109/ipdps.2011.147 dblp:conf/ipps/Zain-ul-AbdinS11 fatcat:dq6luivjlfekbdzeuerwvlq424

Fine-grain multithreading with minimal compiler support---a cost effective approach to implementing efficient multithreading languages

Kenjiro Taura, Akinori Yonezawa
1997 SIGPLAN notices  
When a procedure suspends an execution, the context of the procedure, which is roughly a stack frame of the procedure, is saved into heap and resumed later.  ...  This paper presents an alternative cost-effective implementation strategy for multithreading languages which can maximally exploit current sequential C compilers.  ...  Our solution for this consists of two parts.  ... 
doi:10.1145/258916.258944 fatcat:zbyft77vqjc55f5kyypwhsxsyy
« Previous Showing results 1 — 15 out of 18,111 results