Sciweavers

6031 search results - page 139 / 1207
» Communicating Transaction Processes
Sort
View
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
16 years 3 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SIGMOD
2009
ACM
130views Database» more  SIGMOD 2009»
16 years 3 months ago
FlashLogging: exploiting flash devices for synchronous logging performance
Synchronous transactional logging is the central mechanism for ensuring data persistency and recoverability in database systems. Unfortunately, magnetic disks are ill-suited for t...
Shimin Chen
HASKELL
2009
ACM
15 years 9 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
HPDC
2010
IEEE
15 years 4 months ago
Scalability of communicators and groups in MPI
As the number of cores inside compute clusters continues to grow, the scalability of MPI (Message Passing Interface) is important to ensure that programs can continue to execute o...
Humaira Kamal, Seyed M. Mirtaheri, Alan Wagner
ICIAR
2005
Springer
15 years 8 months ago
A Step Towards Practical Steganography Systems
There has been many hidden communication techniques proposed in the last few years. The focus was given to steganography to build such techniques. Utilizing stego-key(s) to hide se...
Abdelkader H. Ouda, Mahmoud R. El-Sakka