Sciweavers

776 search results - page 30 / 156
» Transaction Support for Ada
Sort
View
SIGOPSE
1996
ACM
14 years 24 days ago
How to scale transactional storage systems
Applications of the future will need to support large numbers of clients and will require scalable storage systems that allow state to be shared reliably. Recent research in distr...
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul ...
KIVS
2005
Springer
14 years 2 months ago
A Comparison of WS-BusinessActivity and BPEL4WS Long-Running Transaction
Although WS-BusinessActivity and BPEL4WS Long-Running Transaction (LRT) are conceptually very similar and are both designed to support the execution of complex business transaction...
Patrick Sauter, Ingo Melzer
IPPS
2006
IEEE
14 years 2 months ago
Wire-speed total order
— Many distributed systems may be limited in their performance by the number of transactions they are able to support per unit of time. In order to achieve fault tolerance and to...
Tal Anker, Danny Dolev, G. Greenman, I. Shnaiderma...
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 11 months ago
Harnessing the wisdom of the crowds for accurate web page clipping
Clipping Web pages, namely extracting the informative clips (areas) from Web pages, has many applications, such as Web printing and e-reading on small handheld devices. Although m...
Lei Zhang, Linpeng Tang, Ping Luo, Enhong Chen, Li...
PPOPP
2009
ACM
14 years 9 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha