226 Hits in 4.3 sec

Parallel database systems: Open problems and new issues

Patrick Valduriez
1993 Distributed and parallel databases  
Furthermore, it is still an open issue to decide which of the various architectures among sharedmemory, shared-disk, and shared-nothing, is best for database management under various conditions.  ...  These problems touch on issues ranging from those of parallel processing to distributed database management.  ...  As pioneered in [82] , most of the work in this area has focused on extending query processing to support the transitive closure of declustered relations in parallel.  ... 
doi:10.1007/bf01264049 fatcat:owb356rtkra5fplbwktkwogdfi

A survey of large-scale reasoning on the Web of data

Grigoris Antoniou, Sotiris Batsakis, Raghava Mutharaju, Jeff Z. Pan, Guilin Qi, Ilias Tachmazidis, Jacopo Urbani, Zhangquan Zhou
2018 Knowledge engineering review (Print)  
In this large and uncoordinated environment, reasoning can be used to check the consistency of the data and of associated ontologies, or to infer logical consequences which, in turn, can be used to obtain  ...  To address this problem, several high-performance reasoning systems, which mainly implement distributed or parallel algorithms, have been proposed in the last few years.  ...  Part of this work was done by Raghava Mutharaju when he was a PhD student at Wright State University during which time he acknowledges the support of the National Science Foundation under award 1017225  ... 
doi:10.1017/s0269888918000255 fatcat:bergc5uphbceznigppektgvzrm

FMona: A Tool for Expressing Validation Techniques over Infinite State Systems [chapter]

J.-P. Bodeveix, M. Filali
2000 Lecture Notes in Computer Science  
After a review of the basic results concerning transition systems, we show how abstraction can be expressed within FMona and used to build a reduced system with decidable properties.  ...  The FMona tool is used to express the validation steps leading to synthesis of a finite abstract system;then SMV and/or Mona validate its properties.  ...  Verification of Always True Properties Given a total abstraction relation ϕ, the validation of a formula on the concrete transition system relies on the deduction rules of theorem 3.  ... 
doi:10.1007/3-540-46419-0_15 fatcat:fftsaztvzjafvodmlmxwovkzcu

Modular Deductive Verification of Multiprocessor Hardware Designs [chapter]

Muralidaran Vijayaraghavan, Adam Chlipala, Arvind, Nirav Dave
2015 Lecture Notes in Computer Science  
As a demonstration, we verify a fairly realistic implementation of a multicore shared-memory system with two types of components: memory system and processor.  ...  Nonetheless, we prove that the combined system implements sequential consistency.  ...  Decomposing a Shared-Memory Multiprocessor System Any conventional multiprocessor system can be divided logically into 3 components as shown in Figure 1 .  ... 
doi:10.1007/978-3-319-21668-3_7 fatcat:ihhvsfhwgbhe7chf46hlw2jlpq

A Unified Theory of Shared Memory Consistency [article]

Robert C. Steinke, Gary J. Nutt
2002 arXiv   pre-print
Every consistency model previously described in the literature can be defined based on our four properties. Therefore, we present these properties as a unfied theory of shared memory consistency.  ...  Any subset of the four properties yields a set of rules which constitute a consistency model.  ...  Causal consistency depends on the causal relation which is the transitive closure of process order and writes-to order.  ... 
arXiv:cs/0208027v1 fatcat:oknkyhpagfahdclxv2xqtupi4a

Mixed programming metaphors in a shared dataspace model of concurrency

G.-C. Roman, H.C. Cunningham
1990 IEEE Transactions on Software Engineering  
In the programming language arena, there are numerous instances where data access is primarily by content rather than by name: logic programming, rule-based systems, and database languages.  ...  It is the first shared dataspace language to have an associated assertional-style proof system.  ...  In developing the Swarm model and logic, we have benefited from discussions with many colleagues at Washington University-Ken Cox, Wei Chen, Howard Lykins, Mike Ehlers, Jan Tijmen Udding, Dan Kimura, and  ... 
doi:10.1109/32.62445 fatcat:ny2xmfznp5evlldigu5tmag3u4

A fine-grained parallel completion procedure

Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin
1994 Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94  
We present a parallel Knuth-Bendiz completion algorithm where the inner loop, deriving the consequences of adding a new rule to the system, is multi-threaded.  ...  Our implementation, which is within the PARSA C-2 parallel symbolic computation system, exhibits good parallel speed-UPS on a standard multi-processor workstation.  ...  We also thank Michael Sperber for his implementation of the ALDES-to-C Compiler and Nick Nevin and Jeff Ward for their contributions to the S-threads system.  ... 
doi:10.1145/190347.190427 dblp:conf/issac/BundgenGK94 fatcat:m2dwt3dhtvg6haikc4bqjbtrre

Multiprocessor Real-Time Locking Protocols: A Systematic Review [article]

Björn B. Brandenburg
2019 arXiv   pre-print
We systematically survey the literature on analytically sound multiprocessor real-time locking protocols from 1988 until 2018, covering the following topics: progress mechanisms that prevent the lock-holder  ...  A special focus is placed on the suspension-oblivious and suspension-aware analysis approaches for semaphore protocols, their respective notions of priority inversion, optimality criteria, lower bounds  ...  More precisely, resource groups are defined by the transitive closure of the "may be held together" relation [33] . As a result, no task ever holds more than one group lock.  ... 
arXiv:1909.09600v1 fatcat:tmqcpiuxfbbd5jrcecgvoeanpm

The merge/purge problem for large databases

Mauricio A. Hernández, Salvatore J. Stolfo
1995 SIGMOD record  
Here we consider the opportunity to solve merge/purge on low cost shared- nothing multiprocessor architectures.  ...  The transitive closure, however, is executed on pairs of tuple id's, each at most 30 bits, and fast solutions to compute transitive closure exist [1], From observing real world scenarios  ... 
doi:10.1145/568271.223807 fatcat:wjokemzivjh4vm6yja7dk2yane

Integrity control in relational database systems — an overview

Paul W.P.J. Grefen, Peter M.G. Apers
1993 Data & Knowledge Engineering  
Second, a number of projects is described that have resulted in the realization of database management systems supporting integrity constraints; the various projects are compared with respect to a number  ...  of system characteristics.  ...  The referees of the DKE journal are thanked for their comments on the first submitted version of this paper.  ... 
doi:10.1016/0169-023x(93)90008-d fatcat:5jnsitez4fbfnhsgoqsfepc56y

A Separation Logic for Fictional Sequential Consistency [chapter]

Filip Sieczkowski, Kasper Svendsen, Lars Birkedal, Jean Pichon-Pharabod
2015 Lecture Notes in Computer Science  
When these libraries provide sufficient guarantees, the logic hides the underlying complexity and admits standard separation logic rules for reasoning about their more high-level clients.  ...  The logic supports reasoning about libraries that directly exploit the relaxed memory model to achieve maximum efficiency.  ...  Acknowledgements We thank Mark Batty, Aleš Bizjak, Susmit Sarkar, and Peter Sewell for helpful discussions on this work.  ... 
doi:10.1007/978-3-662-46669-8_30 fatcat:ivkfjgpyznat3f2hjomreeps7a

Partial Orders for Efficient Bounded Model Checking of Concurrent Software [chapter]

Jade Alglave, Daniel Kroening, Michael Tautschnig
2013 Lecture Notes in Computer Science  
formal verification of deployed concurrent systems code.  ...  The number of interleavings of a concurrent program makes automatic analysis of such software very hard. Modern multiprocessors' execution models make this problem even harder.  ...  If all three events share the same guards, i.e., stem from the same control-flow branch, the constraint c e1e3 is redundant, as it is in the transitive closure of existing constraints.  ... 
doi:10.1007/978-3-642-39799-8_9 fatcat:loacw7ab3bfxvpn6eh2rvqcoma

Automatic rate desynchronization of embedded reactive programs

Alain Girault, Xavier Nicollin, Marc Pouzet
2006 ACM Transactions on Embedded Computing Systems  
the global reaction time of the program.  ...  The motivation is to take into account long duration tasks inside the programs: these are tasks whose execution time is long compared to the other computations in the application, and whose maximal execution  ...  Edward Lee (UC Berkeley) for a very helpful explanation of Real-Time Workshop's distributed code generation, to Albert Benveniste and Paul Le Guernic (Inria/Irisa) for interesting discussions on the Signal  ... 
doi:10.1145/1165780.1165786 fatcat:3ghfmu64gfffpgwhanimwbtjmm

Concurrent object-oriented programming

Gul Agha
1990 Communications of the ACM  
Official and unofficial reviewers of the first-and second-edition manuscripts made helpful comments and suggestions on tight schedules. They include  ...  of the Silicon Valley Patterns Group performed similar valuable service for preliminary versions of the second edition.  ...  On multiprocessors, when multiple threads running on different CPUs share access to the same objects, cache consistency hardware and low-level system software must communicate the associated values across  ... 
doi:10.1145/83880.84528 fatcat:natymhbbtbh7zivohgmsjbwg3m

Composable scheduler activations for Haskell

2016 Journal of functional programming  
If more of the runtime system were in the high-level language, it would be far more modular and malleable.  ...  The approach relies on abstracting the interface to the user-implemented schedulers through scheduler activations, together with the use of Software Transactional Memory to promote safety in a multicore  ...  we are on the right track with the abstraction.  ... 
doi:10.1017/s0956796816000071 fatcat:w6zdte5jybamjhyii64lq6wtl4
« Previous Showing results 1 — 15 out of 226 results