TITLE

Using Discrete Event Simulation to Analyze Contention Managers

AUTHOR(S)
Demsky, Brian
PUB. DATE
December 2011
SOURCE
International Journal of Parallel Programming;Dec2011, Vol. 39 Issue 6, p783
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Understanding the behavior and benefits of contention managers is important for designing transactional memory implementations. Contention manager design is closely tied to other design decisions in a transaction memory implementation, and therefore experiments to compare the behaviors of contention managers are difficult. This paper presents a discrete event simulator that allows researchers to explore the behavior of contention managers and even to perform experiments that compare lazy conflict detection without contention management to eager detection combined with a contention manager. For our benchmarks, we found that lazy conflict detection was competitive with the best contention managers. Our experiments confirm that contention management design is critical for transactional memories that use eager validation. We used the simulator to explore new tiered contention managers that combine livelock-prone contention managers with livelock-free contention managers to provide the benefits of the livelock-prone contention manager while avoiding its pathological behaviors under contention.
ACCESSION #
63995373

 

Related Articles

  • Transaction Scheduling Using Dynamic Conflict Avoidance. Nicácio, Daniel; Baldassin, Alexandro; Araújo, Guido // International Journal of Parallel Programming;Feb2013, Vol. 41 Issue 1, p89 

    Software transaction memory (STM) systems have been used as an approach to improve performance, by allowing the concurrent execution of atomic blocks. However, under high-contention workloads, STM-based systems can considerably degrade performance, as transaction conflict rate increases....

  • An Improved Contention Access Mechanism for FPRP to Increase Throughput. Qi Yang; Yuxiang Zhuang; Jianghong Shi // ETRI Journal;Feb2013, Vol. 35 Issue 1, p58 

    Five-phase reservation protocol (FPRP) is a contention-based media access control protocol for wireless ad hoc networks. FPRP uses a five-phase reservation process to establish slot assignments based on time division multiple access. It allows a node to reserve only one slot in an information...

  • A Minimum Interference Cross-Layer Routing Protocol for Mobile Ad Hoc Networks. Gu, Chao; Zhu, Qi // Wireless Personal Communications;Nov2013, Vol. 72 Issue 4, p2741 

    In mobile ad hoc networks (MANETs), channel contention and packet collision can seriously affect the performance of routing protocols, which will eventually affect the performance of the whole network. Besides, the arbitrary mobility of nodes makes contention and collision ever-changing and more...

  • SHIFTING the FOCUS to Science. Blake, Bill // Scientific Computing;Mar2007, Vol. 24 Issue 4, p22 

    The article discusses the gains in productivity that multi-core, multi-processor systems with parallel programming capabilities will bring to scientific computing. As more complex phenomena are modeled and tested, it becomes impossible to simulate these phenomena in the laboratory. Scientists...

  • Restricted admission control in view-oriented transactional memory. Leung, Kai-Cheung; Chen, Yawen; Huang, Zhiyi // Journal of Supercomputing;Feb2013, Vol. 63 Issue 2, p348 

    This paper proposes a Restricted Admission Control (RAC) scheme for View-Oriented Transactional Memory. The scheme can control the number of threads concurrently accessing a view in order to reduce the number of aborts of transactions. The RAC scheme has the merits of both the locking mechanism...

  • Natural Load Indices (NLI) for scientific simulation. Muszala, Stefan; Alaghband, Gita; Hack, James; Connors, Daniel // Journal of Supercomputing;Jan2012, Vol. 59 Issue 1, p392 

    We present Natural Load Indices (NLIs) as an alternative to measurement-based load indices. NLIs facilitate further performance improvement and better resource usage. Example NLIs are rainfall amounts in a climate simulation, mass of an atom in a Molecular Dynamics (MD) code and surface fluxes...

  • Maintaining mobile transactional consistency in hybrid broadcast environments. SungSuk Kim; Sun Ok Yang; SangKeun Lee // Acta Informatica;Dec2004, Vol. 41 Issue 2/3, p65 

    Recently there have been attempts in several research areas at efficiently utilizing the resources of mobile computers. Considering the properties in mobile computing environments, push-based data dissemination systems have lately attracted considerable attention. However, skewed access patterns...

  • Transaction Encoding Algorithm (TEA) for Distributed Data.  // International Journal of Computer Applications;Feb2011, Vol. 16, p43 

    The article discusses the use of transaction encoding algorithm (TEA) to reduce the data transaction size and communication cost as well. It says that randomly generated sample data has been employed to simulate TEA for 100 transactions showing that TEA is dependent on the number of transactions...

  • Low-latency atomic broadcast in the presence of contention. Zielinski, Piotr // Distributed Computing;Apr2008, Vol. 20 Issue 6, p435 

    The Atomic Broadcast algorithm described in this paper can deliver messages in two communication steps, even if multiple processes broadcast at the same time. It tags all broadcast messages with the local real time, and delivers all messages in the order of these timestamps. Both positive and...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics