Filters








70,035 Hits in 5.0 sec

Progressive Transactional Memory in Time and Space [article]

Petr Kuznetsov, Srivatsan Ravi
2015 arXiv   pre-print
In this paper, we explore inherent time and space complexity of lock-based TMs, with a focus of the most popular class of progressive lock-based TMs.  ...  We derive that a progressive TM might enforce a read-only transaction to perform a quadratic (in the number of the data items it reads) number of steps and access a linear number of distinct memory locations  ...  Rφ (X1) · · · Rφ (Xi−1) i − 1 t-reads Rφ (Xi) → nv Wi(Xi, nv) Ti commits Tφ Ti (a) R φ (X i ) must return nv by strict serializability Rφ (X1) · · · Rφ (Xi−1) i − 1 t-reads Time and space complexity  ... 
arXiv:1502.04908v2 fatcat:wft55kgrzbep7lrhysqzcwqlfm

Using Transactional Memory to Synchronize an Adaptive Garbage Collector in Real-Time Java

M. Teresa Higuera-Toledano
2011 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops  
Hardware Transactional Memory (TM) is a new synchronization paradigm for this architecture, allowing problems of lock-based methods and making easer programming.  ...  Since in the context of real-time systems, a collector must guarantee a worst-case in it performance, the worst-case time for a committed transaction must be limited; we achieve this by limiting its size  ...  ACKNOWLEDGMENT This research was supported by Consejería de Educación de Comunidad de Madrid, through Research Program S2009/TIC -1468, and by Ministerio de Educación y Ciencia, through the research grant  ... 
doi:10.1109/isorcw.2011.24 dblp:conf/isorc/Higuera-Toledano11 fatcat:xaftln4jnzhtvjee7hg55fhsnu

The sweep-line state space exploration method

Kurt Jensen, Lars M. Kristensen, Thomas Mailund
2012 Theoretical Computer Science  
The concept of progress makes it possible to delete states from the memory during state space exploration and thereby reduce peak memory usage. The contribution of this paper is twofold.  ...  The sweep-line method exploits intrinsic progress in concurrent systems to alleviate the state explosion problem in explicit state model checking.  ...  In particular, we acknowledge the contributions of Jonathan Billington, Søren Christensen, Guy E. Gallasch, and Michael Westergaard.  ... 
doi:10.1016/j.tcs.2011.12.036 fatcat:ajwaohtrgzffzkrngki7vcjgcm

RobuSTM: A Robust Software Transactional Memory [chapter]

Jons-Tobias Wamhoff, Torvald Riegel, Christof Fetzer, Pascal Felber
2010 Lecture Notes in Computer Science  
For software transactional memory (STM) to be usable in large applications such as databases, it needs to be robust, i.e., live, efficient, tolerant of crashed and non-terminating transactions, and practical  ...  We show how to implement a robust software transactional memory (RobuSTM) in MSM.  ...  This work is supported in part by the European Commission FP7 VELOX project (ICT-216852).  ... 
doi:10.1007/978-3-642-16023-3_32 fatcat:evqrenmfsvbgfcklwkmjdgmmna

Transactional programming in a multi-core environment

Ali-Reza Adl-Tabatabai, Christos Kozyrakis, Bratin Saha
2007 Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '07  
, Transactional Memory Tutorial Both transactions make progress independently PACT 2007, Transactional Memory Tutorial Transaction T1 is now ready to commit PACT 2007, Transactional Memory Tutorial T1  ...  Closed Nested Transactions X 1 Time xbegin . . .  ...  HTM Virtualization Space virtualization What if caches overflow? •  ... 
doi:10.1145/1229428.1229484 dblp:conf/ppopp/Adl-TabatabaiKS07 fatcat:7nxjwm7he5g4vd3oafyolla4jq

PCMLogging

Shen Gao, Jianliang Xu, Bingsheng He, Byron Choi, Haibo Hu
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
In this paper, we present PCMLogging, a novel logging scheme that exploits PCM devices for both data buffering and transaction logging in disk-based databases.  ...  Different from the traditional approach where buffered updates and transaction logs are completely separated, they are integrated in the new logging scheme.  ...  This work is partially supported by GRF Grants HKBU210808 and HKBU211510.  ... 
doi:10.1145/2063576.2063977 dblp:conf/cikm/GaoXHCH11 fatcat:pwqcnwwbijaahagilh6kqwaflq

Survey on Sequential Pattern Mining Algorithms

V. ChandraShekharRao, P. Sammulal
2013 International Journal of Computer Applications  
It is obvious time stamp as an important attribute of each dataset, also it is important in the process of data mining and it can gives us more accurate and useful information.  ...  The information achieved from sequential pattern mining can be used in marketing, medical records, sales analysis, and so on.  ...  and scalability [31] . a set of customer transactions where each transaction T consists of a customer-id, a transaction time and a set of items involved in the transaction.  ... 
doi:10.5120/13301-0782 fatcat:eee6r7dtbffmfphbb4y4shh3be

An Efficient Technique for Indexing Temporal Databases

Mohammed M., Mostafa G.M.
2015 International Journal of Computer Applications  
This dimension is the life time of each item, i.e. exhibition period, starting from the partition when this item appears in the transaction database to the partition when this item no longer exists.  ...  The results show that the proposed indexing technique saves a lot of running time and works efficiently with different databases characteristics.  ...  Memory Space for TIndex and TIndex2 Figure 4 shows overall comparison between TIndex and TIndex2 required memory.  ... 
doi:10.5120/ijca2015906590 fatcat:ctui3ht7gndoxglvoiazyspbvm

Playing with Fire

Dimitra Papagiannopoulou, Andrea Marongiu, Tali Moreshet, Luca Benini, Maurice Herlihy, Iris Bahar
2015 Proceedings of the 25th edition on Great Lakes Symposium on VLSI - GLSVLSI '15  
In this paper, we propose a novel scheme that allows to dynamically adjust to an evolving COP and operate at highly reduced margins, while guaranteeing forward progress.  ...  Memory (HTM) for error recovery.  ...  However, due to static and dynamic variations, the COP may actually change over space and time.  ... 
doi:10.1145/2742060.2742090 dblp:conf/glvlsi/Papagiannopoulou15 fatcat:uqtlvw3vfncvbhazyrapnciqsq

Closing the window of vulnerability in multiphase memory transactions

John Kubiatowicz, David Chaiken, Anant Agarwal
1992 Proceedings of the fifth international conference on Architectural support for programming languages and operating systems - ASPLOS-V  
Multiprocessor architects have begun to explore several mechanisms such as prefetching, context-switching and softwsreassisted dynamic cache-coherence, which transform single-phase memory transactions  ...  in conventional memory systems into multiphase operations.  ...  Each of the 16 transaction buffers contains an address, state bits, and space for a complete memory-line. The transaction buffers record the state of all outstanding memory transactions.  ... 
doi:10.1145/143365.143540 dblp:conf/asplos/KubiatowiczCA92 fatcat:tv2ohn7gpfh6dcficaggtty67a

Closing the window of vulnerability in multiphase memory transactions

John Kubiatowicz, David Chaiken, Anant Agarwal
1992 SIGPLAN notices  
Multiprocessor architects have begun to explore several mechanisms such as prefetching, context-switching and softwsreassisted dynamic cache-coherence, which transform single-phase memory transactions  ...  in conventional memory systems into multiphase operations.  ...  Each of the 16 transaction buffers contains an address, state bits, and space for a complete memory-line. The transaction buffers record the state of all outstanding memory transactions.  ... 
doi:10.1145/143371.143540 fatcat:n5iyq6e37zgtpaswpw2elhjjai

Making lock-free data structures verifiable with artificial transactions

Xinhao Yuan, David Williams-King, Junfeng Yang, Simha Sethumadhavan
2015 Proceedings of the 8th Workshop on Programming Languages and Operating Systems - PLOS '15  
We leverage hardware transactional memory support from Intel Haswell processors to enforce these artificial transactions.  ...  Further analysis shows that two inefficiencies in Haswell are the largest contributors to this overhead.  ...  If both threads are spinning, the second thread must have set flagA to true, so thread 1 will eventually make progress as soon as it gets a time step and sees this write.  ... 
doi:10.1145/2818302.2818309 dblp:conf/sosp/YuanWYS15 fatcat:62beyourzva45jmvja35jzd5ue

Making Lock-free Data Structures Verifiable with Artificial Transactions

Xinhao Yuan, David Williams-King, Junfeng Yang, Simha Sethumadhavan
2016 ACM SIGOPS Operating Systems Review  
We leverage hardware transactional memory support from Intel Haswell processors to enforce these artificial transactions.  ...  Further analysis shows that two inefficiencies in Haswell are the largest contributors to this overhead.  ...  If both threads are spinning, the second thread must have set flagA to true, so thread 1 will eventually make progress as soon as it gets a time step and sees this write.  ... 
doi:10.1145/2883591.2883603 fatcat:er4v433zqjcyfazm62zx52vlpa

Concurrent Prefix Recovery

Guna Prasaad, Badrish Chandramouli, Donald Kossmann
2019 Proceedings of the 2019 International Conference on Management of Data - SIGMOD '19  
We used CPR to make two systems durable: (1) a custom in-memory transactional database; and (2) Faster, our state-of-the-art, scalable, largerthan-memory key-value store.  ...  With increasing multi-core parallelism, modern databases and key-value stores are designed for scalability and presently yield very high throughput for the in-memory working set.  ...  We would like to thank Phil Bernstein, James Hunter, and the anonymous reviewers for their comments and suggestions.  ... 
doi:10.1145/3299869.3300090 dblp:conf/sigmod/PrasaadCK19 fatcat:rdl5cnsnqjcaflfwvcvyjwnub4

Indexed Enhancement on GenMax Algorithm for Fast and Less Memory Utilized Pruning of MFI and CFI

C. Sathya, C. Chandrasekar
2012 International Journal of Computer Applications  
Fast and less memory utilization for solving the problems of frequent item sets are highly required in transactional databases.  ...  The proposal in this paper present an improved index based enhancement on GenMax algorithm for effective fast and less memory utilized pruning of maximal frequent item sets and closed frequent item sets  ...  as memory utilization and pruning time.  ... 
doi:10.5120/5627-7952 fatcat:6bffkmflo5bajfetcqqx6o77ai
« Previous Showing results 1 — 15 out of 70,035 results