11,368 Hits in 7.1 sec

Distributed computing column 54 transactional memory: models and algorithms

Jennifer L. Welch
2014 ACM SIGACT News  
This issue's column consists of a review article by Gokarna Sharma and Costas Busch on models and algorithms for transactional memory (TM), with particular emphasis on scheduling.  ...  The authors cover three main models. First, work on transaction scheduling algorithms for tightly-coupled systems are surveyed.  ...  We compared the performance of MultiBend with existing algorithms Arrow [25] and Ballistic [46] .  ... 
doi:10.1145/2636805.2636823 fatcat:xnjbxycmfbfkdop6eyzrbbj4nq

Cartesian Partitioning Models for 2D and 3D Parallel SpGEMM Algorithms

Gunduz Demirci, Cevdet Aykanat
2020 IEEE Transactions on Parallel and Distributed Systems  
The focus is distributed-memory parallelization of sparse-general-matrix-multiplication (SpGEMM).  ...  We propose hypergraph models for 2D and 3D cartesian partitioning of the workcube for further reducing the communication overheads of these 2D-and 3D-parallel SpGEMM algorithms.  ...  Computing resources used were provided by the National Center for High Performance Computing of Turkey (UHeM) under Grant 4005992019.  ... 
doi:10.1109/tpds.2020.3000708 fatcat:dfpvmzel35d4jdiukz7frimib4

A general hierarchical circuit modeling and simulation algorithm

S.X.-D. Tan
2005 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Tan (S'96-M'99) received his B.S. and M.S. degrees in electrical engineering from Fudan University, Shanghai, China in 1992 and 1995, respectively and the Ph.D. degree in electrical and computer engineering  ...  It can derive the exact or approximate admittances in the reduced circuit matrix and compute the circuit characteristics in rational function forms for very large linear analog and interconnect circuits  ...  Chung-Kuan Cheng for discussions on the Y − ∆ transformation algorithm and Weikun Guo for implementing the MMDbased clustering algorithm and Junjie Yang for implementing the Hurwitz approximation algorithm  ... 
doi:10.1109/tcad.2004.842815 fatcat:bgfwsrfu2jbhnk7553ul53jsym

D2.3 Power models, energy models and libraries for energy-efficient concurrent data structures and algorithms [article]

Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Aras Atalar, Anders Gidenstam, Paul Renaud-Goud, Philippas Tsigas, Ivan Walulya
2018 arXiv   pre-print
2.1 on investigating and modeling the trade-off between energy and performance of concurrent data structures and algorithms.  ...  This deliverable reports the results of the power models, energy models and libraries for energy-efficient concurrent data structures and algorithms as available by project month 30 of Work Package 2 (  ...  Concurrency control techniques such as transactional memory [57, 54] and multi-word synchronization [55, 47, 71] do not take into account fine-grained locality while fine-grained locality-aware techniques  ... 
arXiv:1801.10556v2 fatcat:y5n53z4gz5de3lzrmvd7soa26y

Optimal and near-optimal test sequencing algorithms with realistic test models

V. Raghavan, M. Shakeri, K. Pattipati
1999 IEEE transactions on systems, man and cybernetics. Part A. Systems and humans  
We develop various AO 3 and information heuristic-based algorithms to solve these practical test sequencing problems.  ...  We also discuss the issues involved in implementation of the test sequencing algorithms for solving large problems efficiently, and show that our preprocessing techniques result in considerable speed-ups  ...  Thus, the above equations reduce to for (54) and (55) Weibull Distribution: In this case, .  ... 
doi:10.1109/3468.736357 fatcat:hmhtmu3xdbgqnp4xk5prvcehpm

Hypergraph Models and Algorithms for Data-Pattern-Based Clustering

Muhammet Mustafa Ozdal, Cevdet Aykanat
2004 Data mining and knowledge discovery  
The success of existing hypergraph partitioning based algorithms in other domains depend on sparsity of the hypergraph and explicit objective metrics.  ...  In traditional approaches for clustering market basket type data, relations among transactions are modeled according to the items occurring in these transactions.  ...  Acknowledgements We thank Vipin Kumar and Micheal Steinbach for supplying the source codes of ROCK.  ... 
doi:10.1023/b:dami.0000026903.59233.2a fatcat:scgutyr6pzbw5bwszuuj3abgy4

Variational Viewpoint of the Quadratic Markov Measure Field Models: Theory and Algorithms

M. Rivera, O. Dalmau
2012 IEEE Transactions on Image Processing  
We also present efficient optimization algorithms.  ...  In the QMMFs the uncertainty in the computed regularized probability measure field is controlled by penalizing the Gini's coefficient and hence it affects the convexity of the QP problem.  ...  The algorithms here presented are simpler, require less memory and have faster convergence than the original QMMF algorithm reported in [1] .  ... 
doi:10.1109/tip.2011.2168409 pmid:21926023 fatcat:opafehiq3vgtdef75fh4avfisu

Asymmetric Memory Fences

Yuelu Duan, Nima Honarmand, Josep Torrellas
2015 SIGPLAN notices  
The two main designs presented (WS+ and W+) speed-up workloads under TSO by an average of 13% and 21%, respectively, over conventional fences.  ...  The most aggressive designs allow postfence accesses to retire and complete before the fence completes.  ...  Acknowledgments We thank Hans Boehm and the anonymous reviewers.  ... 
doi:10.1145/2775054.2694388 fatcat:u3crywms4bbu5lud42uejds5si

Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm [article]

Filip B. Maciejewski, Flavio Baccari, Zoltán Zimborás, Michał Oszmaniec
2021 arXiv   pre-print
We introduce a correlated measurement noise model that can be efficiently described and characterized, and which admits effective noise-mitigation on the level of marginal probability distributions.  ...  We perform experiments on 15 (23) qubits using IBM's (Rigetti's) devices to test both the noise model and the error-mitigation scheme, and obtain an average reduction of errors by a factor $>22$ ($>5.5  ...  Indeed, the standard method of reconstructing Λ is to create all the 2 n computational basis and estimate the resulting probability distributions (which constitute the columns of Λ).  ... 
arXiv:2101.02331v3 fatcat:oqd4g6yvdjd67a3cvfnmp6yl5a

AI Modeling to Combat COVID-19 Using CT Scan Imaging Algorithms and Simulations: A Study [chapter]

Naser Zaeri
2021 Simulation Modelling [Working Title]  
the related data into a meaningful knowledge through computational-based models, for the task of containment the virus, diagnosis and providing treatment.  ...  In this study, we will provide recent developments and practical implementations of artificial intelligence modeling and machine learning algorithms proposed by researchers and practitioners during the  ...  Acknowledgements The author would like to express his gratitude and grateful appreciation to the Kuwait Foundation for the Advancement of Sciences (KFAS) for financially supporting this project.  ... 
doi:10.5772/intechopen.99442 fatcat:eniarjcqdba55csjcqrox6c7zu

A SA-ANN-Based Modeling Method for Human Cognition Mechanism and the PSACO Cognition Algorithm

Shuting Chen, Dapeng Tan
2018 Complexity  
Then, based on the inference model, a Powell SA with combinatorial optimization (PSACO) algorithm is proposed to improve the clustering efficiency and recognition accuracy for the cognition process.  ...  machine (RBM-ELM) algorithms.  ...  Each sample consists of four columns corresponding to the four animals (horse, mule, donkey, and goat), and a column contains 30 images.  ... 
doi:10.1155/2018/6264124 fatcat:xcpqhunacfa6dpj3w7s4ju4s3q

Efficient Algorithms and Cost Models for Reverse Spatial-Keywordk-Nearest Neighbor Search

Ying Lu, Jiaheng Lu, Gao Cong, Wei Wu, Cyrus Shahabi
2014 ACM Transactions on Database Systems  
Efficient algorithms and cost models for reverse spatial-keyword k-nearest neighbor search.  ...  We also provide a theoretical cost model to analyze the efficiency of our algorithms. Our empirical studies show that the proposed algorithms are efficient and scalable. . 2014.  ...  TODS3902-13 ACM-TRANSACTION April 23, 2014 14:54 Efficient Algorithms and Cost Models for Reverse Spatial-Keyword k-NN Search13:17 TODS3902-13 ACM-TRANSACTION April 23, 2014 14:54 ALGORITHM  ... 
doi:10.1145/2576232 fatcat:ucw52avvlnck5bbwzgkpunwm64

Evaluation of session-based recommendation algorithms

Malte Ludewig, Dietmar Jannach
2018 User modeling and user-adapted interaction  
In this work, we present the results of an in-depth performance comparison of a number of such algorithms, using a variety of datasets and evaluation measures.  ...  Our comparison includes the most recent approaches based on recurrent neural networks like GRU4REC, factorized Markov model approaches such as FISM or FOSSIL, as well as simpler methods based, e.g., on  ...  Computational Complexity & Memory Usage The methods included in our comparison vary largely in terms of the computational complexity and their memory requirements.  ... 
doi:10.1007/s11257-018-9209-6 fatcat:pvg2sgjim5g3lcpri6xiaq3oki

Breaking the memory wall in MonetDB

Peter A. Boncz, Martin L. Kersten, Stefan Manegold
2008 Communications of the ACM  
a MonetDB is distributed using a nonrestrictive open-source license, see  ...  On the other hand, it should model the memory access cost of query processing operators given a value distribution estimate and tuning parameters (such as B).  ...  exploit CPU data caches; (iii) the design of new cache-conscious query processing algorithms; and (iv) the design and automatic calibration of memory cost models to choose and tune these cache-conscious  ... 
doi:10.1145/1409360.1409380 fatcat:ioi2qrcty5ho5ji5kwbvx3nub4

Simulation of partial replication in Distributed Transactional Memory

Diogo Lima, Hugo Miranda, Francois Taiani
2017 2017 Wireless Days  
Distributed Transactional Memory (DTM) is a concurrency mechanism aimed at simplifying distributed programming by allowing operations to execute atomically, mirroring the well-known transaction model of  ...  DTM can play a fundamental role in the coordination of participants in mobile distributed applications.  ...  Distributed Transactional Memory (DTM) [4] - [11] has been motivated as an extension of STM to distributed systems, addressing new issues such as data replication and node failure.  ... 
doi:10.1109/wd.2017.7918115 dblp:conf/wd/LimaMT17 fatcat:cuxt7jtv3rbk3dypytu2s7ehjq
« Previous Showing results 1 — 15 out of 11,368 results