Filters








14,841 Hits in 8.1 sec

FAILURE-SENSITIVE ANALYSIS OF PARALLEL ALGORITHMS WITH CONTROLLED MEMORY ACCESS CONCURRENCY

CHRYSSIS GEORGIOU, ALEXANDER RUSSELL, ALEXANDER A. SHVARTSMAN
2007 Parallel Processing Letters  
Another contribution in this paper is the new failure-sensitive analysis for iterative Write-All with controlled memory access concurrency.  ...  The results herein give a new analysis of the algorithm [16] that obtain failure-sensitive work bounds, while retaining the known memory access concurrency bounds.  ...  Failure- Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency Failure- Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency 01 forall processors  ... 
doi:10.1142/s0129626407002946 fatcat:ivgdpkgcprdmbcsy7imcdva3la

MODC: Resilience for disaggregated memory architectures using task-based programming [article]

Kimberly Keeton and Sharad Singhal and Haris Volos and Yupu Zhang and Ramesh Chandra Chaurasiya and Clarete Riana Crasta and Sherin T George and Nagaraju K N and Mashood Abdulla K and Kavitha Natarajan and Porno Shome and Sanish Suresh
2021 arXiv   pre-print
To demonstrate the potential benefit of these architectures for resilience, we develop Memory-Oriented Distributed Computing (MODC), a framework for programming disaggregated architectures that borrows  ...  They also provide an independent failure model, where computations or the compute nodes they run on may fail independently of the disaggregated memory; thus, data that's resident in the disaggregated memory  ...  Sensitivity to task size We begin our analysis by exploring the sensitivity of the MODC PageRank implementation to the task size.  ... 
arXiv:2109.05329v1 fatcat:xq6o5reg3nhndmvgooht2m3d74

Pointer analysis for structured parallel programs

Radu Rugina, Martin C. Rinard
2003 ACM Transactions on Programming Languages and Systems  
This paper presents a novel interprocedural, flow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers.  ...  The algorithm is designed to handle programs with structured parallel constructs, including fork-join constructs, parallel loops, and conditionally spawned threads.  ...  This paper makes the following contributions: -Algorithm: It presents a novel flow-sensitive, context-sensitive, interprocedural pointer analysis algorithm for multithreaded programs with structured parallelism  ... 
doi:10.1145/596980.596982 fatcat:vrjx4lncvrdcphrb7unkkfhvee

Distributed and parallel database systems

M. Tamer Özsu, Patrick Valduriez
1996 ACM Computing Surveys  
the functions provided by such a system, which also provides functions such as query processing, structured organization of data, and others that transaction processing systems do not necessarily deal with  ...  The most popular concurrency control algorithms are locking-based.  ...  Concurrency control algorithm: Algorithms that synchronize the operations of concurrent transactions that execute on a shared database.  ... 
doi:10.1145/234313.234368 fatcat:twwvplp3gvf2tg5fjqcgdvrcjy

Distributed and Parallel Database Systems [chapter]

M Özsu, Patrick Valduriez
2014 Computing Handbook, Third Edition  
the functions provided by such a system, which also provides functions such as query processing, structured organization of data, and others that transaction processing systems do not necessarily deal with  ...  The most popular concurrency control algorithms are locking-based.  ...  Concurrency control algorithm: Algorithms that synchronize the operations of concurrent transactions that execute on a shared database.  ... 
doi:10.1201/b16768-16 fatcat:ula52uqbt5arbnbbxhzoayfqsu

Pointer analysis for multithreaded programs

Radu Rugina, Martin Rinard
1999 Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation - PLDI '99  
This paper present s a n o vel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers.  ...  For each pointer and each program point, the algorithm computes a conservative approximation of the memory locations to which that pointer may point.  ...  This algorithm is, to our knowledge, the rst ow-sensitive pointer analysis algorithm for multithreaded programs.  ... 
doi:10.1145/301618.301645 dblp:conf/pldi/RuginaR99 fatcat:kzk6qmaz25hl3nsqbsewrcj4vi

Pointer analysis for multithreaded programs

Radu Rugina, Martin Rinard
1999 SIGPLAN notices  
This paper present s a n o vel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers.  ...  For each pointer and each program point, the algorithm computes a conservative approximation of the memory locations to which that pointer may point.  ...  This algorithm is, to our knowledge, the rst ow-sensitive pointer analysis algorithm for multithreaded programs.  ... 
doi:10.1145/301631.301645 fatcat:cdv6gssyb5a5bi3aonb3u2taci

PERFORMANCE ANALYSIS OF VARIOUS CONCURRENCY TECHNIQUES ON THE DISTRIBUTED TRANSACTIONS [article]

V. Vasanthraj, Dr.K.Ravikumar
2021 Zenodo  
Concurrency control is the major role to govern the multi user transaction in the database .The concurrency property of the distributed computing is executing simultaneously such that collection of manipulated  ...  The computation time among the multiple transactions is fast which compared with the existing model.  ...  Concurrency Control Algorithm Access: the concurrency management like shared lock, Exclusive lock, The concurrency control algorithm improves the performance Time stamp and so on.  ... 
doi:10.5281/zenodo.5771389 fatcat:uehcddqkdfhkdbfhmj4yuyzzna

Built-in self-testing of random-access memories

M. Franklin, K.K. Saluja
1990 Computer  
We thank the referees for their comments and suggestions, which greatly enhanced the quality of presentation of this work.  ...  For example, for reads and writes the BIST logic may be able to access multiple bits of an array in parallel if the technology and test algorithm allow, instead of accessing the bits serially.  ...  DRAM Restricted PSF test MAMB Parallel test for VLSl memories Marching test SAMB Parallel test for PSFs PSF test SAMB Built-in processor for self-test Not specified SAMB CMOS DRAM with  ... 
doi:10.1109/2.58236 fatcat:bt6vpurmrrbslh24hzoomqjjem

Comparative Analysis of Distributed Concurrency Control Protocols

S. Kiran
2019 International Journal for Research in Applied Science and Engineering Technology  
In this paper we do a comparative analysis of the various concurrency control protocols used for distributed databases with their advantages and disadvantages.  ...  Concurrency control algorithms have traditionally been based on locking and timestamp ordering mechanisms.  ...  Optimistic Concurrency Control Protocol with Locking Systems (OCCL) To overcome the problems of optimistic concurrency control protocols we have locking systems attached to them where each transaction  ... 
doi:10.22214/ijraset.2019.3446 fatcat:t2vntarg6jdhpesno34bbhflom

Predicting Concurrency Failures in the Generalized Execution Traces of x86 Executables [chapter]

Chao Wang, Malay Ganai
2012 Lecture Notes in Computer Science  
We then present a unified runtime analysis platform for detecting concurrency related program failures in the x86 executables of sharedmemory multithreaded applications.  ...  In this tutorial, we first provide a brief overview of the latest development in SMT based symbolic predictive analysis techniques and their applications to runtime verification.  ...  memory accesses.  ... 
doi:10.1007/978-3-642-29860-8_2 fatcat:kaqq5byfqzfkngfws5lm7yyur4

Designing a Software Transactional Memory for Peer-To-Peer Systems

Aurel Paulovič, Peter Lacko
2013 Foundations of Computing and Decision Sciences  
Transactional memory is a rather novel approach to concurrency control in parallel computing, that has just recently found its way into distributed systems research.  ...  In this paper we argue, that peer-to-peer systems would require a different design of transactional memory because of the increased failure-rate of nodes, slower network and possibility of network splits  ...  TM uses the notion of transactions as a concurrency primitive for memory operations and is often implemented as a form of optimistic concurrency control.  ... 
doi:10.2478/fcds-2013-0003 fatcat:wianlj42kjg3bh4dur4wsvv6qy

Exploiting coarse-grain speculative parallelism

Hari K. Pyla, Calvin Ribbens, Srinidhi Varadarajan
2011 SIGPLAN notices  
., codeblocks, methods, algorithms) offers a promising programming model for exploiting parallelism on modern architectures.  ...  Anumita can be used to improve the performance of hard to parallelize algorithms whose performance is highly dependent on input data.  ...  In addition to this sensitivity to the input, algorithms for the graph coloring problem are hard to parallelize due to inherent data dependancies.  ... 
doi:10.1145/2076021.2048110 fatcat:rsyjze662nh4pf62mi26rirdwu

Exploiting coarse-grain speculative parallelism

Hari K. Pyla, Calvin Ribbens, Srinidhi Varadarajan
2011 Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications - OOPSLA '11  
., codeblocks, methods, algorithms) offers a promising programming model for exploiting parallelism on modern architectures.  ...  Anumita can be used to improve the performance of hard to parallelize algorithms whose performance is highly dependent on input data.  ...  In addition to this sensitivity to the input, algorithms for the graph coloring problem are hard to parallelize due to inherent data dependancies.  ... 
doi:10.1145/2048066.2048110 dblp:conf/oopsla/PylaRV11 fatcat:tgatnmdn3zekhmo4say74qibua

In-Memory Big Data Management and Processing: A Survey

Hao Zhang, Gang Chen, Beng Chin Ooi, Kian-Lee Tan, Meihui Zhang
2015 IEEE Transactions on Knowledge and Data Engineering  
Many of these researches have focused along several dimensions: modern CPU and memory hierarchy utilization, time/space efficiency, parallelism and concurrency control.  ...  However, in-memory systems are much more sensitive to other sources of overhead that do not matter in traditional I/O-bounded disk-based systems.  ...  We would like to thank the anonymous reviewers, and also Bingsheng He, Eric Lo and Bogdan Marius Tudor, for their insightful comments and suggestions.  ... 
doi:10.1109/tkde.2015.2427795 fatcat:u7r3rtvhxbainfeazfduxcdwrm
« Previous Showing results 1 — 15 out of 14,841 results