Filters








61,738 Hits in 6.0 sec

SPRINT: A Tool to Generate Concurrent Transaction-Level Models from Sequential Code

Johan Cockx, Kristof Denolf, Bart Vanhoof, Richard Stahl
2007 EURASIP Journal on Advances in Signal Processing  
However, the creation of such a model starting from sequential code is a time-consuming and error-prone task. It is typically done only once, if at all, for a given design.  ...  To support our systematic C-based design flow, we have developed a tool to generate a concurrent SystemC transaction-level model for user-selected task boundaries.  ...  ACKNOWLEDGMENT The authors would like to thank Henk Corporaal for the insightful discussions and his valued contribution to this paper.  ... 
doi:10.1155/2007/75373 fatcat:trl4t3i4vrhgravxple4zln424

From sequential programming to flexible parallel execution

Arun Raman, Jae W. Lee, David I. August
2012 Proceedings of the 2012 international conference on Compilers, architectures and synthesis for embedded systems - CASES '12  
, and an accelerating push for ever-greater energy efficiency.  ...  This paper proposes to attract embedded systems programmers to a vertically integrated approach, comprising extensions to the sequential programming model, a parallelizing compiler, and an optimizing run-time  ...  The dependency on the seed variable across invocations of random prevents a compiler from scheduling iterations of the loop in main to execute concurrently and without synchronization 1 .  ... 
doi:10.1145/2380403.2380417 dblp:conf/cases/RamanLA12 fatcat:brrvp7hjqfebxhrdqijnvmlwp4

From Sequential Specifications to Eventual Consistency [chapter]

Radha Jagadeesan, James Riely
2015 Lecture Notes in Computer Science  
We define what it means for a replicated and distributed implementation satisfy the standard sequential specification of the data structure.  ...  We show that our definition simplifies the programmer task significantly for a class of clients who conform to the CALM principle [10] .  ...  If we can establish the necessary monotonicity properties, then we can reason with the sequential specifications of a and t in proving p correct.  ... 
doi:10.1007/978-3-662-47666-6_20 fatcat:hry6zleuzvhjtm3e7scyi7c3yy

Concurrent Geometric Multicasting

Jordan Adamek, Mikhail Nesterenko, James Scott Robinson, Sébastien Tixeuil
2018 Proceedings of the 19th International Conference on Distributed Computing and Networking - ICDCN '18  
Overall, all these multicasting algorithms use sequential face routing to recover from a local minimum.  ...  We present MCF R, a multicasting concurrent face routing algorithm that uses geometric routing to deliver a message from source to multiple targets.  ...  Efficiency Bounds Correctness proof.  ... 
doi:10.1145/3154273.3154314 dblp:conf/icdcn/AdamekNRT18 fatcat:2yxxdhg2wrbrnb2haf3mlmn72i

Concurrent Geometric Multicasting [article]

Jordan Adamek, Mikhail Nesterenko, James Robinson, Sébastien Tixeuil
2017 arXiv   pre-print
We present MCFR, a multicasting concurrent face routing algorithm that uses geometric routing to deliver a message from source to multiple targets.  ...  We describe the algorithm's operation, prove it correct, estimate its performance bounds and evaluate its performance using simulation.  ...  Efficiency Bounds Correctness proof.  ... 
arXiv:1706.05263v1 fatcat:fbzoyyy5rjeindtnnjolhrr3vy

Contracts for concurrency

Piotr Nienaltowski, Bertrand Meyer, Jonathan S. Ostroff
2008 Formal Aspects of Computing  
We propose a generalized semantics of preconditions, postconditions, and invariants that is applicable in concurrent and sequential contexts.  ...  The SCOOP model extends the Eiffel programming language to provide support for concurrent programming. The model is largely based on the principles of Design by Contract.  ...  reduces to the sequential semantics when no concurrency is involved.  ... 
doi:10.1007/s00165-007-0063-2 fatcat:vvyx5cjwefg4xn76dueg44kjia

Mathematizing C++ concurrency

Mark Batty, Scott Owens, Susmit Sarkar, Peter Sewell, Tjark Weber
2011 SIGPLAN notices  
We prove that a proposed x86 implementation of the concurrency primitives is correct with respect to the x86-TSO model, and describe our CPPMEM tool for exploring the semantics of examples, using code  ...  Having already motivated changes to the draft standard, this work will aid discussion of any further changes, provide a correctness condition for compilers, and give a much-needed basis for analysis and  ...  We acknowledge funding from EPSRC grants EP/F036345, EP/H005633, EP/H027351, and EP/F067909.  ... 
doi:10.1145/1925844.1926394 fatcat:nhbpkrhadndevmnwfg6v725p3a

Mathematizing C++ concurrency

Mark Batty, Scott Owens, Susmit Sarkar, Peter Sewell, Tjark Weber
2011 Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11  
We prove that a proposed x86 implementation of the concurrency primitives is correct with respect to the x86-TSO model, and describe our CPPMEM tool for exploring the semantics of examples, using code  ...  Having already motivated changes to the draft standard, this work will aid discussion of any further changes, provide a correctness condition for compilers, and give a much-needed basis for analysis and  ...  We acknowledge funding from EPSRC grants EP/F036345, EP/H005633, EP/H027351, and EP/F067909.  ... 
doi:10.1145/1926385.1926394 dblp:conf/popl/BattyOSSW11 fatcat:i4hrcm7yi5fgbj6kxhfsbv2kja

Compositional relaxed concurrency

Mark Batty
2017 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
I am grateful to Mike Dodds and John Wickerson for discussing the ideas presented here. Funding. This work is supported by the Royal Academy of Engineering and the Lloyd's Register Foundation.  ...  The first peculiarity extends from the desire to introduce concurrency without changing the sequential fragment of the language: neither the sequential behaviour, nor the compilation of sequential blocks  ...  And optimism because our tools and methods for verifying the correctness of concurrent codealthough built above an idealised model of concurrencyare becoming more mature.  ... 
doi:10.1098/rsta.2015.0406 pmid:28871054 fatcat:ue622mszkjesxjdk3cg5odoqou

Sketching concurrent data structures

Armando Solar-Lezama, Christopher Grant Jones, Rastislav Bodik
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
PSKETCH is based on a new counterexample-guided inductive synthesis algorithm (CEGIS) that generalizes the original sketch synthesis algorithm from [20] to cope efficiently with concurrent programs.  ...  The new algorithm produces a correct implementation by iteratively generating candidate implementations, running them through a verifier, and if they fail, learning from the counterexample traces to produce  ...  This work is supported in part by the National Science Foundation with grants CCF-0085949, CNS-0326577, and CNS-0524815, a generous gift from IBM Corporation, an IBM Fellowship, and the University of California  ... 
doi:10.1145/1375581.1375599 dblp:conf/pldi/Solar-LezamaJB08 fatcat:a2gezeanvvdbreirt3uljr3pdu

Fast Concurrent Data Sketches [article]

Arik Rinberg, Alexander Spiegelman, Edward Bortnikov, Eshcar Hillel, Idit Keidar, Lee Rhodes, Hadar Serviansky
2019 arXiv   pre-print
We present a generic approach to parallelising data sketches efficiently, while bounding the error that such parallelism introduces.  ...  Utilising relaxed semantics and the notion of strong linearisability we prove our algorithm's correctness and analyse the error it induces in two specific sketches.  ...  . , A n , taken uniformly from the interval [0, 1]. Note that A is the stream observed by the reference sequential sketch, and also by adversary that hides up to r elements from the relaxed sketch.  ... 
arXiv:1902.10995v2 fatcat:sg7p6rpqybgexbqn22iyzsy5ai

Sketching concurrent data structures

Armando Solar-Lezama, Christopher Grant Jones, Rastislav Bodik
2008 SIGPLAN notices  
PSKETCH is based on a new counterexample-guided inductive synthesis algorithm (CEGIS) that generalizes the original sketch synthesis algorithm from [20] to cope efficiently with concurrent programs.  ...  The new algorithm produces a correct implementation by iteratively generating candidate implementations, running them through a verifier, and if they fail, learning from the counterexample traces to produce  ...  This work is supported in part by the National Science Foundation with grants CCF-0085949, CNS-0326577, and CNS-0524815, a generous gift from IBM Corporation, an IBM Fellowship, and the University of California  ... 
doi:10.1145/1379022.1375599 fatcat:x5s6klcsgrfhrpvt5idyibqfea

Asynchronized Concurrency

Tudor David, Rachid Guerraoui, Vasileios Trigonakis
2015 Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS '15  
ASCY calls for the design of concurrent search data structures (CSDSs) to resemble that of their sequential counterparts.  ...  , such as readonly and read-write, and according to different performance metrics, including throughput, latency, and energy.  ...  Part of this work was funded from the SNSF projects 200021-143915 (Reusable Concurrent Data Types) and 200021-147067 (Scalable and Secure Computing in Social Networks).  ... 
doi:10.1145/2694344.2694359 dblp:conf/asplos/DavidGT15 fatcat:ieknmbpx6fg2how7f5ty74ikiu

Optimism for Boosting Concurrency [article]

Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi
2015 arXiv   pre-print
We treat a program's concurrency as its ability to accept a concurrent schedule, a metric inspired by the theories of both databases and transactional memory.  ...  Modern concurrent programming benefits from a large variety of synchronization techniques.  ...  This performance is due to the optimal concurrency of our algorithm (all correct schedules are accepted as shown by Theorem 3) and the low overhead of our algorithm (a valid schedule is efficiently identified  ... 
arXiv:1203.4751v8 fatcat:7pf6pognandedj47jwuts5yub4

Scalable concurrent computing

Nalini Venkatasubramanian, Shakuntala Miriyala, Gul Agha
1992 Sadhana (Bangalore)  
In order to execute an instruction at least three communications have to pass through the link-the instruction (control), operands (data from memory to processor) and results (stored back in memory).  ...  Issues in building systems architectures which efficiently represent and utilize parallel hardware resources are then discussed.  ...  The authors would like to acknowledge Chris Houck, Subrata Mitra and Rajendra Panwar for their comments on the paper.  ... 
doi:10.1007/bf02811343 fatcat:cx7b7rpe2zcylcai6vut7kddaa
« Previous Showing results 1 — 15 out of 61,738 results