Results 41 to 50 of about 1,911,273 (156)

An Efficient Spark-Based Hybrid Frequent Itemset Mining Algorithm for Big Data

open access: yesData, 2022
Frequent itemset mining (FIM) is a common approach for discovering hidden frequent patterns from transactional databases used in prediction, association rules, classification, etc. Apriori is an FIM elementary algorithm with iterative nature used to find
Mohamed Reda Al-Bana   +2 more
doaj   +1 more source

Hardware transactional memory : a systems perspective [PDF]

open access: yes, 2009
textThe increasing ubiquity of chip multiprocessor machines has made the need for accessible approaches to parallel programming all the more urgent. The current state of the art, based on threads and locks, requires the programmer to use mutual exclusion
Rossbach, Christopher John
core  

Discovery of Frequent Itemsets: Frequent Item Tree-Based Approach

open access: yesJournal of ICT Research and Applications, 2013
Mining frequent patterns in large transactional databases is a highly researched area in the field of data mining. Existing frequent pattern discovering algorithms suffer from many problems regarding the high memory dependency when mining large amount of
A. V. Senthil Kumar, R. S. D. Wahidabanu
doaj  

Modular transactional memory [PDF]

open access: yes, 2010
Software transactional memory has the potential to greatly simplify development of concurrent software, by supporting safe composition of concurrent shared-state abstractions.
Brecknell, Matthew, Roe, Paul
core  

Transactional Memory in a Dynamic Language [PDF]

open access: yes, 2009
Concurrency control is mostly based on locks and is therefore notoriously difficult to use. Even though some programming languages provide high-level constructs, these add complexity and potentially hard-to-detect bugs to the application.
Renggli, Lukas, Nierstrasz, Oscar
core   +1 more source

Towards Composable Concurrency Abstractions [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2014
In the past decades, many different programming models for managing concurrency in applications have been proposed, such as the actor model, Communicating Sequential Processes, and Software Transactional Memory.
Janwillem Swalens   +3 more
doaj   +1 more source

A Lock Free Approach To Parallelize The Cellular Potts Model: Application To Ductal Carcinoma In Situ

open access: yesJournal of Integrative Bioinformatics, 2020
In the field of computational biology, in order to simulate multiscale biological systems, the Cellular Potts Model (CPM) has been used, which determines the actions that simulated cells can perform by determining a hamiltonian of energy that takes into ...
Tomeu Antonio J., Salguero Alberto G.
doaj   +1 more source

Store Atomicity for Transactional Memory [PDF]

open access: yes, 2007
We extend the notion of Store Atomicity [Arvind and Jan-Willem Maessen. Memory model = instruction reordering + store atomicity. In ISCA '06: Proceedings of the 33rd annual International Symposium on Computer Architecture, 2006] to a system with atomic ...
Maessen, Jan-Willem, Arvind,
core   +1 more source

High Performance Frequent Subgraph Mining on Transaction Datasets: A Survey and Performance Comparison

open access: yesBig Data Mining and Analytics, 2019
Graph data mining has been a crucial as well as inevitable area of research. Large amounts of graph data are produced in many areas, such as Bioinformatics, Cheminformatics, Social Networks, etc.
Bismita S. Jena   +2 more
doaj   +1 more source

08241 Summary – Transactional Memory : From Implementation to Application [PDF]

open access: yes, 2008
A goal of current multiprocessor software design is to introduce parallelism into software applications by allowing operations that do not conflict in accessing memory to proceed concurrently. The key tool in designing concurrent data structures has been
Herlihy, Maurice   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy