Sciweavers

906 search results - page 29 / 182
» Linking Theories of Concurrency
Sort
View
89
Voted
ASIAN
2004
Springer
150views Algorithms» more  ASIAN 2004»
15 years 3 months ago
Concurrent Constraint-Based Memory Machines: A Framework for Java Memory Models
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
Vijay A. Saraswat
FOSSACS
2006
Springer
15 years 1 months ago
Processes for Adhesive Rewriting Systems
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
ICDT
2010
ACM
163views Database» more  ICDT 2010»
15 years 1 months ago
A Theoretical Study of 'Snapshot Isolation'
Snapshot Isolation is a popular and efficient protocol for concurrency control. In this paper we discuss Snapshot Isolation in view of the classical theory for transaction process...
Ragnar Normann, Lene T. Østby
3DPVT
2006
IEEE
187views Visualization» more  3DPVT 2006»
15 years 1 months ago
Linking Feature Lines on 3D Triangle Meshes with Artificial Potential Fields
We propose artificial potential fields as a support theory for a feature linking algorithm. This algorithm operates on 3D triangle meshes derived from multiple range scans of an o...
David L. Page, Andreas Koschan, Mongi A. Abidi
FCS
2006
14 years 11 months ago
From Sequential Processes to Grid Computation
: We introduce an extended model for view-centric reasoning, EVCR, that provides more nsive and flexible abstractions for representing actual concurrency. The theory of Communicati...
Mark Burgin, Marc Smith