212 Hits in 3.2 sec

Coordinating Multicore Computing [chapter]

Farhad Arbab, Sung-Shik T. Q. Jongmans
2015 Lecture Notes in Computer Science  
Simple mutual exclusion (put-put) Concurrency in Reo  Reo embodies a non-conventional model of concurrency:  Reo is more expressive than Petri nets, workflow, and dataflow models.  Reo is more expressive  ...  asynchrony. o Relational constraints between input and output.  Conventional o action based o process as primitive o imperative o functional o imperative programming o protocol implicit in processes  ... 
doi:10.1007/978-3-319-18941-3_2 fatcat:63uhuclusvd7nhzdnca5subdti

Combining Design and Performance in a Data Visualization Management System

Eugene Wu, Fotis Psallidas, Zhengjie Miao, Haoci Zhang, Laura Rettig
2017 Conference on Innovative Data Systems Research  
In this paper, we describe the status of our progress towards an end-to-end relational approach in our data visualization management system (DVMS).  ...  These include (a) the use of provenance queries to express and optimize interactions, (b) the application of concurrency control ideas to interactions, (c) a streaming framework to improve near-interactive  ...  To this end, we have designed a series of user studies to understand the design constraints around asynchrony in interactive visualizations; the results will be used to develop a declarative asynchrony  ... 
dblp:conf/cidr/WuPMZR17 fatcat:maxcwvkawvcspmcwy67ndsehty

An Evaluation of Intra-Transaction Parallelism in Actor-Relational Database Systems [article]

Vivek Shah, Marcos Antonio Vaz Salles
2022 arXiv   pre-print
designed with task-level parallelism in mind, and with the system running on a multi-core machine.  ...  Over the past decade, we have witnessed a dramatic evolution in main-memory capacity and multi-core parallelism of server hardware.  ...  asynchrony, while maintaining insulation from concurrency and failure issues.  ... 
arXiv:2204.10743v1 fatcat:evtuizlhkvemnejbxuzcwyb6om

PrDK: Protocol Programming with Automata [chapter]

Sung-Shik T. Q. Jongmans, Farhad Arbab
2016 Lecture Notes in Computer Science  
Prdk is based on syntactic separation of process code, presumably written in an existing general-purpose language, and protocol code, written in a domain-specific language with explicit, high-level elements  ...  As a tool for construction of systems, Prdk consists of syntax editors, a translator, a parser, an interpreter, and a compiler into Java. Performance in the Nas Parallel Benchmarks is promising.  ...  One fundamental difference between Scribble and our approach is that in Scribble, all interaction is asynchronous, order-preserving, and reliable, whereas our automata allow for mixing synchrony and asynchrony  ... 
doi:10.1007/978-3-662-49674-9_33 fatcat:grxq4yj2ubfd3kr2jxotd2ykey

Migrating objects in electronic commerce applications [chapter]

Marko Boger
1998 Lecture Notes in Computer Science  
Its aim is to simplify the design and development of such distributed systems. Concurrency and distribution are expressed using the same mechanism, virtual processors.  ...  Electronic Commerce is a field of application that is distributed by nature where different parties share information and work concurrently and cooperatively on objects, potentially distributed over a  ...  To simulate asynchrony in Java a new thread needs to be spawned to handle the call and await the result. This makes asynchronous calls tedious and error-prone to develop.  ... 
doi:10.1007/bfb0053414 fatcat:srt3qya2ijfb5el3vdv52tzcsq

Serverless is More: From PaaS to Present Cloud Computing

Erwin van Eyk, Lucian Toader, Sacheendra Talluri, Laurens Versluis, Alexandru Uta, Alexandru Iosup
2018 IEEE Internet Computing  
ACKNOWLEDGMENTS This work is supported by the Dutch projects Vidi MagnaData, by the Dutch Commit and the Commit project Commissioner, and by generous donations from Oracle Labs, USA.  ...  Over the past two decades, we have moved towards a declarative form of expressing concurrency.  ...  Workflows declare the structure of applications, leaving the concrete execution and synchro-nization of workflow-tasks to the runtime system; this model has a multitude of applications 13 and underlies  ... 
doi:10.1109/mic.2018.053681358 fatcat:niayqqghojcedlr6yppfacqftm

Toward Design, Modelling and Analysis of Dynamic Workflow Reconfigurations [chapter]

Manuel Mazzara, Faisal Abouzaid, Nicola Dragoni, Anirban Bhattacharyya
2012 Lecture Notes in Computer Science  
We state the requirements on a system implementing the workflow and its reconfiguration, and describe the system's design in BPMN.  ...  In the process, we evaluate the formalisms for their suitability for the modelling and analysis of dynamic reconfiguration of dependable systems.  ...  We also want to thank members of the Reconfiguration Interest Group (in particular, Kamarul Abdul Basit, Carl Gamble and Richard Payne), the Dependability Group (at Newcastle University) and the EU FP7  ... 
doi:10.1007/978-3-642-29834-9_6 fatcat:4azm3jd3lrfmta46xdkf6vir5y

Composing semantic services in open sensor-rich environments

Jie Liu, Feng Zhao
2008 IEEE Network  
Major challenges remain on how concurrent users program and control such environments at the application level.  ...  This paper summarizes our research efforts in automatically composing semantics services to fulfill declarative user queries in resource efficient ways.  ...  This most abstract view tolerates asynchrony in the system, such as clock skewing among nodes.  ... 
doi:10.1109/mnet.2008.4579770 fatcat:5nlwd5hkdrblxkhasgksjnqcde

Fault tolerance via idempotence

Ganesan Ramalingam, Kapil Vaswani
2013 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '13  
We find that the monad has low runtime overheads and leads to more declarative applications.  ...  We have implemented the idempotence monad (and its variants) in F# and C# and used our implementation to build realistic applications on Windows Azure.  ...  Acknowledgments We would like to acknowledge Siddharth Agarwal, Nirmesh Malviya, Khilan Gudka, and Dheeraj Singh for their contributions.  ... 
doi:10.1145/2429069.2429100 dblp:conf/popl/RamalingamV13 fatcat:dj6fttugl5cyxkaumvemeefrty

Fault tolerance via idempotence

Ganesan Ramalingam, Kapil Vaswani
2013 SIGPLAN notices  
We find that the monad has low runtime overheads and leads to more declarative applications.  ...  We have implemented the idempotence monad (and its variants) in F# and C# and used our implementation to build realistic applications on Windows Azure.  ...  Acknowledgments We would like to acknowledge Siddharth Agarwal, Nirmesh Malviya, Khilan Gudka, and Dheeraj Singh for their contributions.  ... 
doi:10.1145/2480359.2429100 fatcat:kfe7mv3pfnfgziyhnwvj7o4iby

A Language for Task Orchestration and Its Semantic Properties [chapter]

David Kitchin, William R. Cook, Jayadev Misra
2006 Lecture Notes in Computer Science  
Orc is a new language for task orchestration, a form of concurrent programming with applications in workflow, business process management, and web service orchestration.  ...  Orc provides constructs to orchestrate the concurrent invocation of services -while managing timeouts, priorities, and failure of services or communication.  ...  Orchestration is well-suited to solving a range of concurrency problems, most notably workflow.  ... 
doi:10.1007/11817949_32 fatcat:px6lnwuctvawtlmifjpuonq2pa


Claudio Calabrese, Gabriele Salvati, Marco Tarini, Fabio Pellacini
2016 ACM Transactions on Graphics  
In our prototype, multiple artists concurrently sculpt a polygonal mesh on their local machines by changing its vertex properties, such as positions and material BRDFs.  ...  In computer graphics these workflows are still not well established, compared to what is done for text writing or software development.  ...  Acknowledgments We would like to thank Simone Filia for his work in the recorded modelling sessions and all the subjects interviewed in our user study.  ... 
doi:10.1145/2897824.2925956 fatcat:v6cjbef7y5b3bncyzo6m3oge4q

Synchronizing the Asynchronous

Bernhard Kragl, Shaz Qadeer, Thomas A. Henzinger, Michael Wagner
2018 International Conference on Concurrency Theory  
Modular verification is enabled via pending asynchronous calls in atomic summaries, and a complementary proof rule that eliminates pending asynchronous calls when components and their specifications are  ...  They are also difficult to verify because of the large number of possible interleavings of concurrent computation threads.  ...  applications, event-driven mobile applications, workflows, device drivers, and many embedded and cyber-physical systems.  ... 
doi:10.4230/lipics.concur.2018.21 dblp:conf/concur/KraglQH18 fatcat:7i2guxsgwjfcvadbv2tyqjkx5a

Pause 'n' Play: Formalizing Asynchronous C $^\sharp$ [chapter]

Gavin Bierman, Claudio Russo, Geoffrey Mainland, Erik Meijer, Mads Torgersen
2012 Lecture Notes in Computer Science  
The solution lies in using asynchronous operations that separate issuing a request from waiting for its completion. However, doing so in common object-oriented languages is difficult and error prone.  ...  properties to be identified and proved correct.  ...  We thank the C and Visual Basic teams for their collaboration, especially Lucian Wischik who led much of the design and implementation effort.  ... 
doi:10.1007/978-3-642-31057-7_12 fatcat:lafhxtqihbglxbndf46qvw2oqm

Hybrid Deterministic and Nondeterministic Execution of Transactions in Actor Systems

Yijian Liu, Li Su, Vivek Shah, Yongluan Zhou, Marcos Antonio Vaz Salles
2022 Proceedings of the 2022 International Conference on Management of Data  
In this paper, we present Snapper, a new transaction library on top of Orleans, a popular actor system.  ...  CCS CONCEPTS • Computing methodologies → Concurrent computing methodologies; • Information systems → Database transaction processing.  ...  in a transaction are pre-declared.  ... 
doi:10.1145/3514221.3526172 fatcat:hsfodjdq4fdd7l4gi7y444zcfm
« Previous Showing results 1 — 15 out of 212 results