An Efficient Checkpointing Protocol For The Minimal Characterization Of Operational Rollback-dependency Trackability

A checkpointing protocol that enforces rollback-dependency trackability (RDT) during the progress of a distributed computation must induce processes to take forced checkpoints to avoid the formation of non-trackable rollback dependencies. A protocol based on the minimal characterization of RDT tests only the smallest set of non-trackable dependencies. The literature indicated that this approach would require the processes to maintain and propagate O(n 2) control information, where n is the number of processes in the computation. In this paper, we present a protocol that implements this approach using only O(n) control information. © 2004 IEEE.126135Baldoni, R., Helary, J.M., Mostefaoui, A., Raynal, M., A communication-induced checkpoint protocol that ensures rollback dependency trackability (1997) IEEE Symposium on Fault Tolerant Computing (FTCS'97), pp. 68-77Baldoni, R., Helary, J.M., Raynal, M., Rollback-dependency trackability: Visible characterizations (1999) 18th Symposium on the Principles of Distributed Computing (PODC'99), , Atlanta (USA), MayBaldoni, R., Helary, J.M., Raynal, M., Rollback-dependency trackability: A minimal characterization and its protocol (2001) Information and Computation, 165 (2), pp. 144-173. , MarCao, G., Singhal, M., Checkpointing with mutable check-points (2003) Theoretical Computer Science, 209 (2), pp. 1127-1148Babaoǧlu, Ö., Marzullo, K., Consistent global states of distributed systems: Fundamental concepts and mechanisms (1993) Distributed Systems, pp. 55-96. , S. Mullender, editor. Addison-WesleyElnozahy, E.N., Alvisi, L., Wang, Y.M., Johnson, D.B., A survey of rollback-recovery protocols in message-passing systems (2002) ACM Computing Surveys, 34 (3), pp. 375-408. , SeptGarcia, I.C., Buzato, L.E., On the minimal characterization of rollback-dependency trackability property (2001) Proceedings of the 21th IEEE Int. Conf. on Distributed Computing Systems, , Phoenix, Arizona, EUA, AprGarcia, I.C., Vieira, G.M.D., Buzato, L.E., RDT-partner: An efficient checkpointing protocol that enforces rollback-dependency trackability (2001) Simpósio Brasileiro de Redes de Computadores, , Florianópolis, Santa Catarina, MayVenkatesh, T.R.K., Li, H.F., Optimal checkpointing and local recording for domino-free rollback recovery (1987) Information Processing Letters, 25 (5), pp. 295-303Lamport, L., Time, clocks, and the ordering of events in a distributed system (1978) Commun. ACM, 21 (7), pp. 558-565. , JulyManivannan, D., Singhal, M., Quasi-synchronous check-pointing: Models, characterization, and classification (1999) IEEE Trans, on Parallel and Distributed Systems, 10 (7). , JulyNetzer, R.H.B., Xu, J., Necessary and sufficient conditions for consistent global snapshots (1995) IEEE Trans. on Parallel and Distributed Systems, 6 (2), pp. 165-169Prakash, R., Singhal, M., Low-cost checkpointing and failure recovery in mobile computing systems (1996) IEEE Trans. on Parallel and Distributed Systems, 7 (10), pp. 1035-1048. , OctTsai, J., On properties of RDT communication-induced checkpointing protocols (2003) IEEE Trans. on Parallel and Distributed Systems, 14 (8). , AugTsai, J., Kuo, S.Y., Wang, Y.M., Theoretical analysis for communication-induced checkpointing protocols with rollback-dependency trackability (1998) IEEE Trans. on Parallel and Distributed Systems, , OctWang, Y.M., Consistent global checkpoints that contain a given set of local checkpoints (1997) IEEE Trans, on Computers, 46 (4), pp. 456-468. , Ap

On The Minimal Characterization Of The Rollback-dependency Trackability Property

Checkpoint and communication patterns that enforce rollback-dependency trackability (RDT) have only on-line trackable checkpoint dependencies and allow efficient solutions to the determination of consistent global checkpoints. Baldoni, Helary, and Raynal have explored RDT at the message level, in which checkpoint dependencies are represented by zigzag paths. They have presented many characterizations of RDT and conjectured that a certain communication pattern characterizes the minimal set of zigzag paths that must be tested on-line by a checkpointing protocol in order to enforce RDT. The contributions of this work are (i) a proof that their conjecture is false, (ii) a minimal characterization of RDT, and (iii) introduction of an original approach to analyze RDT checkpointing protocols.34234

Lab4ws: A Testbed For Web Services

Web services are increasingly being deployed in clusters located at geographically distributed datacenters linked via the Internet. Ideally, before the actual deployment of such a complex service, engineers would like to have a way to quantitatively analyze aspects such as performance, availability, and the load balancing achieved by the different solutions available. In this paper we present the Lab4WS, a testbed designed to reduce the difficulties associated with the evaluation of LAN and/or WAN deployed web services. The key features of Lab4WS are illustrated by using it to compare four WAN load balancing mechanisms (DNS-based, server-based, dispatcher-based, and client-based). © 2009 IEEE.(2002) TPC Benchmark W - Specification 1.8, , http://www.tpc.org/tpcw/spec/tpcwV1.8.pdf, FebruaryColajanni, M., Yu, P.S., A performance study of robust load sharing strategies for distributed heterogeneous web server systems (2002) IEEE Transactions on Knowledge and Data Engineering, 14 (2), pp. 398-414Cardellini, V., Colajanni, M., Yu, P.S., Dynamic load balancing on web-server systems (1999) IEEE Internet Computing, 3 (3), pp. 28-39Ye, X., Shen, Y., A middleware for replicated web services (2005) Proceedings - 2005 IEEE International Conference on Web Services, ICWS 2005, 2005, pp. 631-638. , DOI 10.1109/ICWS.2005.8, 1530855, Proceedings - 2005 IEEE International Conference on Web Services, ICWS 2005Salas, J., Perez-Sorrosal, F., Patio-Martnez, M., Jimnez-Peris, R., (2006) Wsreplication: A Framework for Highly Available Web Services, pp. 357-366. , WWW, L. Carr, D. D. Roure, A. Iyengar, C. A. Goble, and M. Dahlin, Eds.ACMFang, C.-L., Liang, D., Lin, F., Lin, C.-C., Fault tolerant Web Services (2007) Journal of Systems Architecture, 53 (1), pp. 21-38. , DOI 10.1016/j.sysarc.2006.06.001, PII S1383762106000609Osrael, J., Froihofer, L., Weghofer, M., Gschka, K.M., Axis2-based replication middleware forweb services (2007) Proceedings of the IEEE International Conference on Web Services 2007 (ICWS 2007), pp. 591-598. , IEEE Computer SocietyChatterjee, D., Tari, Z., Zomaya, A., A task-based adaptive TTL approach for Web server load balancing (2005) Proceedings - IEEE Symposium on Computers and Communications, pp. 877-884. , Proceedings - 10th IEEE Symposium on Computers and Communications, ISCC 2005Cardellini, V., Colajanni, M., Yu, P.S., Request redirection algorithms for distributed web systems (2003) IEEE Trans. Parallel Distrib. Syst., 14 (4), pp. 355-368Liu, L., Lu, Y., Dynamic traffic controls for web-server networks (2004) Comput. Networks, 45 (4), pp. 523-536Conti, M., Gregori, E., Lapenna, W., Client-side content delivery policies in replicated web services: Parallel access versus single server approach (2005) Perform. Eval., 59 (2-3), pp. 137-157Mendonça, N.C., Silva, J.A.F., Anido, R.O., Client-side selection of replicated web services: An empirical assessment (2008) The Journal of Systems and Software, 81, pp. 1346-136

Dynamic Content Web Applications: Crash, Failover, And Recovery Analysis

This work assesses how crashes and recoveries affect the performance of a replicated dynamic content web application. RobustStore is the result of retrofitting TPC-W's on-line bookstore with Treplica, a middleware for building dependable applications. Implementations of Paxos and Fast Paxos are at the core of Treplica's efficient and programmer-friendly support for replication and recovery. The TPC-W benchmark, augmented with faultloads and dependability measures, is used to evaluate the behaviour of RobustStore. Experiments apply faultloads that cause sequential and concurrent replica crashes. RobustStore's performance drops by less than 13% during the recovery from two simultaneous replica crashes. When subject to an identical faultload and a shopping workload, a five-replicas RobustStore maintains an accuracy of 99.999%. Our results display not only good performance, total autonomy and uninterrupted availability, they also show that it is simple to develop efficient recovery-oriented applications using Treplica. ©2009 IEEE.229238Amza, C., Cox, A.L., Zwaenepoel, W., Distributed versioning: Consistent replication for scaling back-end databases of dynamic content web sites (2003) MiddlewareBurrows, M., The Chubby lock service for loosely-coupled distributed systems (2006) 7th USENIX Symp. on Operating Systems Design and ImplementationCain, H.W., Rajwar, R., Marden, M., Lipasti, M.H., An architectural evaluation of Java TPC-W (2001) Proc. of 7th Int. Symp. on High-Performance Computer ArchitectureCamargos, L., Pedone, F., Weiloch, M., Sprint: A middleware for high-performance transaction processing (2007) Proc. of 2nd European Conf. on Computer SystemsChang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Gruber, R.E., Bigtable: A distributed storage system for structured data (2008) ACM Trans. Comput. Syst, 26 (2), pp. 1-26T. P. Council. TPC-W Specification, Feb. 2002DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vogels, W., Dynamo: Amazon's highly available key-value store (2007) Proc. of 21st ACM SIGOPS Symp. on Operating Systems Principles, pp. 205-220X. De7acute;fago, A. Schiper, and P. Urbán. Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Comput. Surv., 36(4):372-421, 2004Durães, J., Vieira, M., Madeira, H., Dependability bench-marking of web-servers (2004) Proc. of 23rd Computer Safety, Reliability, and Security Int. Conf, pp. 297-310Elnikety, S., Dropsho, S., Pedone, F., Tashkent: Uniting durability with transaction ordering for high-performance scalable database replication (2006) Proc. of 1st European Conference on Computer Systems (EuroSys)Elnikety, S., Dropsho, S., Zwaenepoel, W., Tashkent+: Memory-aware load balancing and update filtering in replicated databases (2007) Proc. of the 2nd European Conference on Computer Systems (EuroSys)Isard, M., Autopilot: Automatic data center management (2007) Oper. Syst. Rev, 41, pp. 60-67Jiang, Y., Xue, G., You, J., Toward fault-tolerant atomic data access in mutable distributed hash tables (2006) Proc. of First Int. Multi-Symp. on Computer and Computational SciencesLamport, L., Time, Clocks, and the Ordering of Events in a Distributed System (1978) CACM, 21 (7), pp. 558-565Lamport, L., The part-time parliament (1998) ACM Trans. Comput. Syst, 16 (2), pp. 133-169Lamport, L., Paxos, F., (2006) Distrib. Comput, 19 (2), pp. 79-103. , OctLiang, W., Kemme, B., Online recovery in cluster databases (2008) EDBT '08: Proceedings of the 11th international conference on Extending database technology, pp. 121-132. , New York, NY, USA, ACMMacCormick, J., Murphy, N., Najork, M., Thekkath, C.A., Zhou, L., Boxwood: Abstractions as the foundation for storage infrastructure (2004) Proc. of 6th USENIX Symp. on Operating Systems Design and ImplementationManassiev, K., Amza, C., Scaling and continuous availability in database server clusters through multiversion replication (2007) Int. Conf. on Dependable Systems and NetworksOstell, J., Databases of discovery (2005) Queue, 3 (3), pp. 40-48Saito, Y., Frolund, S., Veitch, A., Merchant, A., Spence, S., Fab: Building distributed enterprise disk arrays from commodity components (2004) SIGPLAN Not, 39 (11). , 48-58Vieira, G.M.D., Buzato, L.E., Treplica: Ubiquitous replication (2008) Proc. of 26th Brazilian Symp. on Computer Networks and Distributed SystemsWu, S., Kemme, B., Postgres-R (SI): Combining Replica Control with Concurrency Control Based on Snapshot Isolation (2005) Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on, pp. 422-43

Load Balancing For Internet Distributed Services Using Limited Redirection Rates

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)The Internet has become the universal support for computer applications. This increases the need for solutions that provide dependability and QoS for web applications. The replication of web servers on geographically distributed data centers allows the service provider to tolerate disastrous failures and to improve the response times perceived by clients. A key issue for good performance of worldwide distributed web services is the efficiency of the load balancing mechanism used to distribute client requests among the replicated servers. Load balancing can reduce the need for over-provision of resources, and help tolerate abrupt load peaks and/or partial failures through load conditioning. In this paper, we propose a new load balancing solution that reduces service response times by redirecting requests to the closest remote servers without overloading them. We also describe a middle ware that implements this protocol and present the results of a set of simulations that show its usefulness. © 2011 IEEE.156165Brazilian Computer Society (SBC),IEEE Computer Society,Agencia Espacial Brasileira (AEB),Coordenacao Aperfeicoamento Pessoal Nivel Super. (CAPES),Cons. Nac. Desenvolv. Cient. Tecnol. (CNPq),Fundacao de Amparo a Pesquisa do Estado de Sao Paulo (FAPESP)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Packmime-http: Web Traffic Generation in ns-2, , http://www.cs.odu.edu/mweigle/research/netsim/packmimensdoc.pdfBarroso, L.A., Dean, J., Hólzle, U., Web search for a planet: The google cluster architecture (2003) IEEE Micro, 23 (2), pp. 22-28Brewer, E.A., Lessons from giant-scale services (2001) IEEE Internet Computing, 5 (4), pp. 46-55. , DOI 10.1109/4236.939450Cao, J., Cleveland, W.Y.G., Jeffay, K., Smith, F., Weigle, M., Stochastic models for generating synthetic http source traffic Proceedings of INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, 2004Cardellini, V., Colajanni, M., Yu, P.S., Dynamic load balancing on web-server systems (1999) IEEE Internet Computing, 3 (3), pp. 28-39Cardellini, V., Colajanni, M., Yu, P.S., Request redirection algorithms for distributed web systems (2003) IEEE Trans. Parallel Distrib. Syst., 14 (4), pp. 355-368Cardwell Neal, Savage Stefan, Anderson Thomas, Modeling TCP latency (2000) Proceedings - IEEE INFOCOM, 3, pp. 1742-1751Chatterjee, D., Tari, Z., Zomaya, A.Y., A task-based adaptive ttl approach for web server load balancing Proceedings. 10th IEEE Symposium on Computers and Communications 2005. ISCC 2005., 2005, pp. 877-884. , IEEE Computer SocietyColajanni, M., Yu, P.S., A performance study of robust load sharing strategies for distributed heterogeneous web server systems (2002) IEEE Transactions on Knowledge and Data Engineering, 14 (2), pp. 398-414Conti, M., Gregori, E., Lapenna, W., Client-side content delivery policies in replicated web services: Parallel access versus single server approach (2005) Perform. Eval., 59 (2-3), pp. 137-157Defago, X., Schiper, A., Urban, P., Total order broadcast and multicast algorithms: Taxonomy and survey (2004) ACM Computing Surveys, 36 (4), pp. 372-421. , DOI 10.1145/1041680.1041682Liu, L., Lu, Y., Dynamic traffic controls for web-server networks (2004) Comput. Networks, 45 (4), pp. 523-536Mendonça, N.C., Silva, J.A.F., Anido, R.O., Client-side selection of replicated web services: An empirical assessment (2008) The Journal of Systems and Software, 81, pp. 1346-1363Moon, J.-B., Kim, M.-H., Dynamic load balancing method based on DNS for distributed Web systems (2005) Lecture Notes in Computer Science, 3590, pp. 238-247. , E-Commerce and Web Technologies: 6th International Conference, EC-Web 2005. ProceedingsNakai, A.M., Madeira, E., Buzato, L.E., DNS-based load balancing for web services (2009) Proceedings of the 6th International Conference on Web Information Systems and TechnologiesNakai, A.M., Madeira, E., Buzato, L.E., Lab4WS: A testbed for web services (2009) Proceedings of the 2nd IEEE International Workshop on Internet and Distributed Computing Systems (IDCS'09)Pathan, M., Buyya, R., Resource discovery and requestredirection for dynamic load sharing in multi-provider peering content delivery networks (2009) J. Netw. Comput. Appl., 32 (5), pp. 976-990Ranjan, S., Knightly, E., High-performance resource allocation and request redirection algorithms for web clusters (2008) IEEE Trans. Parallel Distrib. Syst., 19 (9), pp. 1186-1200(1981) Transmission Control Protocol, , RFC793Yokota, H., Kimura, S., Ebihara, Y., A proposal of dnsbased adaptive load balancing method for mirror server systems and its implementation (2004) Advanced Information Networking and Applications 2004. AINA 2004. 18th International Conference on, 2, pp. 208-213. , Vol.2, 29-3

Message From The Special Issue Editors

[No abstract available]1811

On The Use Of Resource Reservation For Web Services Load Balancing

A key issue for good performance of worldwide distributed web services is the efficiency of the load balancing mechanism used to distribute client requests among the replicated servers. The load balancing solution allows providers to make better use of their resources, soften the need for over-provision, and help tolerate abrupt load peaks. In this paper, we propose a new load balancing solution that reduces service response times by applying a protocol for the reservation of remote resources. This protocol prevents the overload of remote servers by limiting the amount of load each server can redirect to the others. We describe a middleware that supports this protocol by managing the trade of resources among a set of servers, allowing them to share their spare capacity in a transparent way. We also present the results of a large set of simulations that encompass an exhaustive set of workload scenarios based on realistic internet traffic models. © 2014 Springer Science+Business Media New York.13

Evaluation Of A Read-optimized Database For Dynamic Web Applications

In this paper we investigate the use of a specialized data warehousing database management system as a data back-end for web applications and assess the performance of this solution. We have used the Monet database as a drop-in replacement for traditional databases, and performed benchmarks comparing its performance to the performance of two of the most commonly used databases for web applications: MySQL and PostgreSQL. Our main contribution is to show for the first time how a read-optimized database performs in comparison to established general purpose database management systems for the domain of web applications. Monet's performance in relation to MySQL and PostgresSQL allows us to affirm that the widely accepted assumption that relational database management systems are fit for all applications can be reconsidered in the case of dynamic web applications.17380Amza, C., Chanda, A., Cox, A.L., Elnikety, S., Gil, R., Rajamani, K., Zwaenepoel, W., Marguerite, J., Specification and implementation of dynamic web site benchmarks (2002) WWC-5: Proceedings of the IEEE International Workshop on Workload Characterization, pp. 3-13Boncz, P.A., (2002) Monet: A Next-Generation DBMS Kernel For Query-Intensive Applications, , Ph.d. thesis, Universiteit van Amsterdam, Amsterdam, The NetherlandsBoncz, P.A., Zukowski, M., Nes, N., Mon-etDB/XlOO: Hyper-pipelining query execution (2005) CIDR 2005: Proceedings of the Second Biennial Conference on Innovative Data Systems Research, pp. 225-237Cain, H.W., Rajwar, R., Marden, M., Lipasti, M.H., An architectural evaluation of Java TPC-W (2001) HPCA '01: Proceedings of the Seventh International Symposium on High-Performance Computer Architecture, pp. 229-240. , Monterrey, MexicoGarcia, D.F., Garcia, J., TPC-W e-commerce benchmark evaluation (2003) Computer, 36 (2), pp. 42-48Harizopoulos, S., Liang, V., Abadi, D.J., Madden, S., Performance tradeoffs in read-optimized databases (2006) VLDB 2006: Proceedings of the 32nd international conference on Very large data bases, pp. 487-498. , VLDB EndowmentMenascé, D.A., TPC-W: A benchmark for e-commerce (2002) IEEE Internet Computing, 6 (3), pp. 83-87Stonebraker, M., Abadi, D.J., Batkin, A., Chen, X., Cherniack, M., Ferreira, M., Lau, E., Zdonik, S., C-Store: A column-oriented dbms (2005) VLDB '05: Proceedings of the 31st international conference on Very large data bases, pp. 553-564. , VLDB EndowmentStonebraker, M., Bear, C., Çetintemel, U., Cherniack, M., Ge, T., Hachem, N., Harizopoulos, S., Zdonik, S., One size fits all? Part 2: Benchmarking studies (2007) CIDR 2007: Proceedings of the Third Biennial Conference on Innovative Data Systems ResearchStonebraker, M., Çetintemel, U., One size fits all: An idea whose time has come and gone (2005) ICDE '05: Proceedings of the 21st International Conference on Data Engineering, pp. 2-11. , Washington, DC, USA. IEEE Computer Society(2002) TPC Benchmark W Specification, , TPC(2006) TPC Benchmark H Specification, , TP

Transaction Scheduling Using Conflict Avoidance And Contention Intensity

In the last few years, Transactional Memories (TMs) have been shown to be a parallel programming model that can effectively combine performance improvement with ease of programming. Moreover, the recent introduction of TM-based ISA extensions, by major microprocessor manufacturers, also seems to endorse TM as a programming model for today's parallel applications. One of the central issues in designing Software TM (STM) systems is to identify mechanisms/heuristics that can minimize contention arising from conflicting transactions. Although a number of mechanisms have been proposed to tackle contention, such techniques have a limited scope, as conflict is avoided by either interrupting or serializing transaction execution, thus considerably impacting performance. To deal with this limitation, we have proposed a new effective transaction scheduler, along with a conflict-avoidance heuristic, that implements a fully cooperative scheduler that switches a conflicting transaction by another with a lower conflicting probability. This paper extends such framework and introduces a new heuristic, built from the combination of our previous conflict avoidance technique with the Contention Intensity heuristic proposed by Yoo and Lee. Experimental results, obtained using the STMBench7 and STAMP benchmarks atop tinySTM, show that the proposed heuristic produces significant speedups when compared to other four solutions. © 2013 IEEE.236245IEEE Computer Society's Technical',ACM,Committee on Parallel Processing (TCPP),et al.,Shell IndiaHerlihy, M., Moss, J.E.B., Transactional memory: Architectural support for lock-free data structures (1993) Proceedings of the 20th Annual International Symposium on Computer Architecture, pp. 289-300. , JunWang, A., Gaudet, M., Wu, P., Amaral, J.N., Ohmacht, M., Barton, C., Silvera, R., Michael, M., Evaluation of blue gene/q hardware support for transactional memories (2012) Proceedings of the 21st International Conference on Parallel Architectures and Compilation Techniques, pp. 127-136Christie, D., Chung, J.-W., Diestelhorst, S., Hohmuth, M., Pohlack, M., Fetzer, C., Nowack, M., Rivière, E., Evaluation of amd's advanced synchronization facility within a complete transactional memory stack (2010) Proceedings of the 5th European Conference on Computer Systems, pp. 27-40Chung, J., Yen, L., Diestelhorst, S., Pohlack, M., Hohmuth, M., Christie, D., Grossman, D., ASF: AMD64 extension for lock-free data structures and transactional memory (2010) Proceedings of the 43rd ACM/IEEE International Symposium on Microarchitecture, pp. 39-50. , Dec(2012) Intel Architecture Instruction Set Extensions Programming Reference, , Intel, FebHarris, T., Larus, J., Rajwar, R., (2010) Transactional Memory, , 2nd ed. Morgan & Claypool Publishers, JunGuerraoui, R., Herlihy, M., Pochon, B., Towards a theory of transactional contention managers (2006) Proceedings of the Twenty-fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 316-317Ansari, M., Lujan, M., Kotselidis, C., Jarvis, K., Kirkham, C., Watson, I., Steal-on-Abort: Improving transactional memory performance through dynamic transaction reordering (2009) Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers, pp. 4-18. , JanDolev, S., Hendler, D., Suissa, A., CAR-STM: Scheduling-based collision avoidance and resolution for software transactional memory (2008) Proceedings of the 27th Annual Symposium on Principles of Distributed Computing, pp. 125-134. , AugYoo, R.M., Lee, H.-H.S., Adaptive transaction scheduling for transactional memory systems (2008) Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 169-178. , JunDragojevic, A., Guerraoui, R., Singh, A.V., Singh, V., Preventing versus curing: Avoiding conflicts in transactional memories (2009) Proceedings of the 28th Annual Symposium on Principles of Distributed Computing, pp. 7-16. , AugNicácio, D., Baldassin, A., Araújo, G., LUTS: A lightweight userlevel transaction scheduler (2011) Proceedings of the 11th International Conference on Algorithms and Architectures for Parallel Processing, pp. 144-157. , OctNicácio, D., Baldassin, A., Araujo, G., Transaction scheduling using dynamic conflict avoidance (2013) International Journal of Parallel Programming, 41 (1), pp. 89-110Guerraoui, R., Kapalka, M., Vitek, J., STMBench7: A benchmark for software transactional memory (2007) Proceedings of the 2nd European Conference on Computer Systems, pp. 315-324. , MarMinh, C.C., Chung, J., Kozyrakis, C., Olukotun, K., STAMP: Stanford transactional applications for multi-processing (2008) Proceedings of the IEEE International Symposium on Workload Characterization, pp. 35-46. , SepChristie, D., Chung, J.-W., Diestelhorst, S., Hohmuth, M., Pohlack, M., Fetzer, C., Nowack, M., Riviere, E., Evaluation of AMD's advanced synchronization facility within a complete transactional memory stack (2010) Proceedings of the 5th European Conference on Computer Systems, pp. 27-40. , AprHerlihy, M., Luchangco, V., Moir, M., Scherer, W.N., Software transactional memory for dynamic-sized data structures (2003) Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, pp. 92-101. , JulGuerraoui, R., Herlihy, M., Pochon, B., Polymorphic contention management (2005) 19th International Symposium on Distributed Computing, pp. 303-323. , SepScherer, W.N., Scott, M.L., Advanced contention management for dynamic software transactional memory (2005) Proceedings of the 24th Annual Symposium on Principles of Distributed Computing, pp. 240-248Attiya, H., Epstein, L., Shachnai, H., Tamir, T., Transactional contention management as a non-clairvoyant scheduling problem (2006) Proceedings of the 25th Annual Symposium on Principles of Distributed Computing, pp. 308-315. , JulSpear, M.F., Dalessandro, L., Marathe, V.J., Scott, M.L., A comprehensive strategy for contention management in software transactional memory (2009) Proceedings of the 14th Symposium on Principles and Practice of Parallel Programming, pp. 141-150. , FebSharma, G., Busch, C., Window-based greedy contention management for transactional memory: Theory and practice (2012) Distributed Computing, 25 (3), pp. 225-248. , JunAttiya, H., Milani, A., Transactional scheduling for read-dominated workloads (2012) Journal of Parallel and Distributed Computing, 72 (10), pp. 1386-1396. , OctMaldonado, W., Marlier, P., Felber, P., Suissa, A., Hendler, D., Fedorova, A., Lawall, J.L., Muller, G., Scheduling support for transactional memory contention management (2010) Proceedings of the 15th Symposium on Principles and Practice of Parallel Programming, pp. 79-90. , JanBlake, G., Dreslinski, R.G., Mudge, T., Proactive transaction scheduling for contention management (2009) Proceedings of the 42nd ACM/IEEE International Symposium on Microarchitecture, pp. 156-167. , DecAtoofian, E., Improving performance of software transactional memory through contention locality (2013) The Journal of Supercomputing, 64 (2), pp. 527-547. , MayHeber, T., Hendler, D., Suissa, A., On the impact of serializing contention management on stm performance (2012) Journal of Parallel and Distributed Computing, 72 (6), pp. 739-750. , Ju