Scalable hierarchical locking for distributed systems

Middleware components are becoming increasingly important as applications share computational resources in distributed environments, such as high-end clusters with ever larger number of processors, computational grids and increasingly large server farms. One of the main challenges in such environmen...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of parallel and distributed computing Vol. 64; no. 6; pp. 708 - 724
Main Authors:	Desai, Nirmit, Mueller, Frank
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.06.2004
Subjects:	Concurrency services Distributed agreement Distributed mutual exclusion Distributed resource allocation Distributed transactions Hierarchical locking Large-scale distributed computing Middleware services Peer-to-peer protocols Scalability Distributed agreement Peer-to-peer protocols Scalability Distributed mutual exclusion Large-scale distributed computing Hierarchical locking Middleware services Concurrency services Distributed transactions Distributed resource allocation
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Middleware components are becoming increasingly important as applications share computational resources in distributed environments, such as high-end clusters with ever larger number of processors, computational grids and increasingly large server farms. One of the main challenges in such environments is to achieve scalability of synchronization. In general, concurrency services arbitrate resource requests in distributed systems. But concurrency protocols currently lack scalability. Adding such guarantees enables resource sharing and computing with distributed objects in systems with a large number of nodes. The objective of our work is to enhance middleware services to provide scalability of synchronization and to support state replication in distributed systems. We have designed and implemented a middleware protocol in support of these objectives. Its essence is a peer-to-peer protocol for multi-mode hierarchical locking, which is applicable to transaction-style processing and distributed agreement. We demonstrate high scalability combined with low response times in high-performance cluster environments. Our technical contribution is a novel, fully decentralized, hierarchical locking protocol to enhance concurrency in distributed resource allocation following the specification of general concurrency services for large-scale data and object repositories. Our experiments on an IBM SP show that the number of messages approaches an asymptote at 15 node from which point on the message overhead is in the order of 3–9 messages per request, depending on system parameters. At the same time, response times increase linearly with a proportional increase in requests and, consequently, higher concurrency levels. Specifically, in the range of up to 80 nodes, response times under 10 ms are observed for critical sections that are one 25th the size of non-critical code. The high degree of scalability and responsiveness of our protocol is due in large to a high level of concurrency upon resolving requests combined with dynamic path compression for request propagation paths. Our approach is not only applicable to CORBA, its principles are shown to provide benefits to general distributed concurrency services and transaction models. Besides its technical strengths, our approach is intriguing due to its simplicity and its wide applicability, ranging from large-scale clusters to server-style computing.
AbstractList	Middleware components are becoming increasingly important as applications share computational resources in distributed environments, such as high-end clusters with ever larger number of processors, computational grids and increasingly large server farms. One of the main challenges in such environments is to achieve scalability of synchronization. In general, concurrency services arbitrate resource requests in distributed systems. But concurrency protocols currently lack scalability. Adding such guarantees enables resource sharing and computing with distributed objects in systems with a large number of nodes. The objective of our work is to enhance middleware services to provide scalability of synchronization and to support state replication in distributed systems. We have designed and implemented a middleware protocol in support of these objectives. Its essence is a peer-to-peer protocol for multi-mode hierarchical locking, which is applicable to transaction-style processing and distributed agreement. We demonstrate high scalability combined with low response times in high-performance cluster environments. Our technical contribution is a novel, fully decentralized, hierarchical locking protocol to enhance concurrency in distributed resource allocation following the specification of general concurrency services for large-scale data and object repositories. Our experiments on an IBM SP show that the number of messages approaches an asymptote at 15 node from which point on the message overhead is in the order of 3–9 messages per request, depending on system parameters. At the same time, response times increase linearly with a proportional increase in requests and, consequently, higher concurrency levels. Specifically, in the range of up to 80 nodes, response times under 10 ms are observed for critical sections that are one 25th the size of non-critical code. The high degree of scalability and responsiveness of our protocol is due in large to a high level of concurrency upon resolving requests combined with dynamic path compression for request propagation paths. Our approach is not only applicable to CORBA, its principles are shown to provide benefits to general distributed concurrency services and transaction models. Besides its technical strengths, our approach is intriguing due to its simplicity and its wide applicability, ranging from large-scale clusters to server-style computing.
Author	Desai, Nirmit Mueller, Frank
Author_xml	– sequence: 1 givenname: Nirmit surname: Desai fullname: Desai, Nirmit – sequence: 2 givenname: Frank surname: Mueller fullname: Mueller, Frank email: mueller@cs.ncsu.edu
BookMark	eNp9j01LxDAQQIOs4O7qH_DUP9A6aZt-gBdZ1BUWPKjnkEwmbmq3XZIq7L83ZT17GnjMG-at2GIYB2LslkPGgVd3XdYdDWY5QBFBBsAv2JJDW6XQlM2CLaEui7QuuLhiqxC6uMBF3SyZeEPVK91Tsnfklce9iyDpR_xyw2diR58YFybv9PdEJgmnMNEhXLNLq_pAN39zzT6eHt8323T3-vyyedilmAs-pQpyaGth69oUpcCcBFS6FVYBmKoFAabk1KjCIigwjTZcixLztgWsNEco1iw_30U_huDJyqN3B-VPkoOcw2Un53A5h88sdkXp_ixR_OwnVsmAjgYk4zzhJM3o_tN_AdsEYwk
Cites_doi	10.1007/s007780050013 10.1002/cpe.558 10.1109/69.485643 10.1006/jpdc.1996.0030 10.1109/REAL.1999.818861 10.1109/IPPS.1997.580904 10.1145/58564.59295 10.1145/227210.227227 10.1109/IPPS.1995.395942 10.1007/s002360050038 10.1007/3-540-46080-2_76 10.1109/71.595581 10.1006/jpdc.1996.0041 10.1109/12.24268 10.1145/359545.359563 10.1109/IPPS.1998.670018 10.1016/0743-7315(90)90114-5 10.1016/S0140-3664(97)00165-5 10.1145/75104.75105
ContentType	Journal Article
Copyright	2003 Elsevier Inc.
Copyright_xml	– notice: 2003 Elsevier Inc.
DBID	AAYXX CITATION
DOI	10.1016/j.jpdc.2003.10.001
DatabaseName	CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1096-0848
EndPage	724
ExternalDocumentID	10_1016_j_jpdc_2003_10_001 S0743731503001990
GroupedDBID	--K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD
ID	FETCH-LOGICAL-c251t-a020975f77d345c2e506b95fa00d69050d41e8a3fc0a0d8bd1b54c2990c6b1c03
ISICitedReferencesCount	2
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000222695400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0743-7315
IngestDate	Sat Nov 29 07:11:05 EST 2025 Fri Feb 23 02:27:55 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	6
Keywords	Distributed agreement Peer-to-peer protocols Scalability Distributed mutual exclusion Large-scale distributed computing Hierarchical locking Middleware services Concurrency services Distributed transactions Distributed resource allocation
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c251t-a020975f77d345c2e506b95fa00d69050d41e8a3fc0a0d8bd1b54c2990c6b1c03
PageCount	17
ParticipantIDs	crossref_primary_10_1016_j_jpdc_2003_10_001 elsevier_sciencedirect_doi_10_1016_j_jpdc_2003_10_001
PublicationCentury	2000
PublicationDate	2004-06-01
PublicationDateYYYYMMDD	2004-06-01
PublicationDate_xml	– month: 06 year: 2004 text: 2004-06-01 day: 01
PublicationDecade	2000
PublicationTitle	Journal of parallel and distributed computing
PublicationYear	2004
Publisher	Elsevier Inc
Publisher_xml	– name: Elsevier Inc
References	S. Fu, N. Tzeng, Z. Li, Empirical evaluation of distributed mutual exclusion algorithms, in: International Parallel Processing Symposium, 1997, pp. 255–259. Lee, Liou (BIB20) 1996; 8 Lee, Fekete (BIB19) 1996; 33 Naimi, Trehel, Arnold (BIB26) April 1996; 34 N. Desai, F. Mueller, Scalable distributed concurrency services for hierarchical locking, in: International Conference on Distributed Computing Systems, May 2003, accepted for publication. Raymond (BIB29) February 1989; 7 F. Mueller, Fault tolerance for token-based synchronization protocols, in: Workshop on Fault-Tolerant Parallel and Distributed Systems, April 2001. Li, Hudak (BIB21) November 1989; 7 530–537. Dolev, Malik (BIB9) April 1996; 39 N. Desai, F. Mueller, A log Chang (BIB4) March 1996; 33 Lamport (BIB18) July 1978; 21 Brunsch, O'Ryan, Schmidt (BIB2) 2001; Vol. 36(6) Sivasankaran, Stankovic, Towsley, Purimetla, Ramamritham (BIB32) January 1996; 5 DOC Group at Washington University, Tao: The ace orb Badrinath, Ramamritham (BIB1) June 1990; 19 T. Johnson, A performance comparison of fast distributed mutual exclusion algorithms, in: Proceedings of the 1995 International Conference on Parallel Processing, 1995, pp. 258–264. U. Kelter, Synchronizing shared abstract data types with intention locks, Technical Report, University of Osnabrueck, 1985. M. Naimi, M. Trehel, An improvement of the log Object Management Group, Concurrency service specification mutual exclusion algorithm for distributed processing, in: International Conference on Parallel Processing, Vol. 3, 1990, pp. 295–302. multi-mode locking protocol for distributed systems, in: International Parallel and Distributed Processing Symposium, April 2003, accepted for publication. Schmidt, Levine, Mungee (BIB30) April 1998; 21 April 2000. I. Foster, C. Kesselman (Eds.), The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, San Francisco, CA, 1999. O'Ryan, Schmidt, Kuhns, Spivak, Parsons, Pyarali, Levine (BIB28) June 2001; 13 C. Engelmann, S. Scott, G. Geist, Distributed peer-to-peer control in harness, in: International Conference on Computational Science, 2002. Goscinski (BIB14) May 1990; 9 Singhal (BIB31) May 1989; 38 distributed algorithm for mutual exclusion, in: International Conference on Distributed Computing Systems, 1987. Suzuki, Kasami (BIB34) December 1993; 18 Fu, Tzeng (BIB12) 1997; 8 F. Mueller, Priority inheritance and ceilings for distributed mutual exclusion, in: IEEE Real-Time Systems Symposium, December 1999, pp. 340–349. Y. Chang, M. Singhal, M. Liu, An improved O(log F. Mueller, Prioritized token-based mutual exclusion for distributed systems, in: International Parallel Processing Symposium, 1998, pp. 791–795. J.A. Stankovic, S.H. Son, Architecture and object model for distributed object-oriented real-time databases, in: Proceedings of the First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC), April 1998. Chang (BIB3) December 1994; 10 June 2002. Gray, Lorie, Putzolu, Traiger (BIB15) 1975 Top 500 list 10.1016/j.jpdc.2003.10.001_BIB5 10.1016/j.jpdc.2003.10.001_BIB23 10.1016/j.jpdc.2003.10.001_BIB22 Gray (10.1016/j.jpdc.2003.10.001_BIB15) 1975 10.1016/j.jpdc.2003.10.001_BIB27 O'Ryan (10.1016/j.jpdc.2003.10.001_BIB28) 2001; 13 10.1016/j.jpdc.2003.10.001_BIB8 10.1016/j.jpdc.2003.10.001_BIB7 10.1016/j.jpdc.2003.10.001_BIB25 10.1016/j.jpdc.2003.10.001_BIB6 10.1016/j.jpdc.2003.10.001_BIB24 Chang (10.1016/j.jpdc.2003.10.001_BIB4) 1996; 33 Lee (10.1016/j.jpdc.2003.10.001_BIB20) 1996; 8 Singhal (10.1016/j.jpdc.2003.10.001_BIB31) 1989; 38 Sivasankaran (10.1016/j.jpdc.2003.10.001_BIB32) 1996; 5 Suzuki (10.1016/j.jpdc.2003.10.001_BIB34) 1993; 18 Lamport (10.1016/j.jpdc.2003.10.001_BIB18) 1978; 21 Chang (10.1016/j.jpdc.2003.10.001_BIB3) 1994; 10 Badrinath (10.1016/j.jpdc.2003.10.001_BIB1) 1990; 19 Brunsch (10.1016/j.jpdc.2003.10.001_BIB2) 2001; Vol. 36(6) Raymond (10.1016/j.jpdc.2003.10.001_BIB29) 1989; 7 Naimi (10.1016/j.jpdc.2003.10.001_BIB26) 1996; 34 10.1016/j.jpdc.2003.10.001_BIB11 10.1016/j.jpdc.2003.10.001_BIB33 10.1016/j.jpdc.2003.10.001_BIB10 Goscinski (10.1016/j.jpdc.2003.10.001_BIB14) 1990; 9 10.1016/j.jpdc.2003.10.001_BIB16 Li (10.1016/j.jpdc.2003.10.001_BIB21) 1989; 7 10.1016/j.jpdc.2003.10.001_BIB13 10.1016/j.jpdc.2003.10.001_BIB35 Dolev (10.1016/j.jpdc.2003.10.001_BIB9) 1996; 39 10.1016/j.jpdc.2003.10.001_BIB17 Lee (10.1016/j.jpdc.2003.10.001_BIB19) 1996; 33 Fu (10.1016/j.jpdc.2003.10.001_BIB12) 1997; 8 Schmidt (10.1016/j.jpdc.2003.10.001_BIB30) 1998; 21
References_xml	– volume: 5 start-page: 19 year: January 1996 end-page: 34 ident: BIB32 article-title: Priority assignment in real-time active databases publication-title: VLDB J.: Very Large Data Bases – reference: Top 500 list, – volume: 38 start-page: 651 year: May 1989 end-page: 662 ident: BIB31 article-title: A heuristically-aided algorithm for mutual exclusion in distributed systems publication-title: IEEE Trans. Comput. – volume: 18 start-page: 94 year: December 1993 end-page: 101 ident: BIB34 article-title: A distributed mutual exclusion algorithm publication-title: ACM Trans. Comput. Systems – reference: N. Desai, F. Mueller, Scalable distributed concurrency services for hierarchical locking, in: International Conference on Distributed Computing Systems, May 2003, accepted for publication. – reference: N. Desai, F. Mueller, A log( – volume: 33 start-page: 131 year: 1996 end-page: 152 ident: BIB19 article-title: Multi-granularity locking for nested transactions publication-title: Acta Inform. – reference: T. Johnson, A performance comparison of fast distributed mutual exclusion algorithms, in: Proceedings of the 1995 International Conference on Parallel Processing, 1995, pp. 258–264. – reference: Object Management Group, Concurrency service specification, – volume: 19 start-page: 163 year: June 1990 end-page: 172 ident: BIB1 article-title: Performance evaluation of semantics-based multilevel concurrency control protocols publication-title: SIGMOD Record (ACM Special Interest Group on Management of Data) – reference: F. Mueller, Prioritized token-based mutual exclusion for distributed systems, in: International Parallel Processing Symposium, 1998, pp. 791–795. – reference: U. Kelter, Synchronizing shared abstract data types with intention locks, Technical Report, University of Osnabrueck, 1985. – reference: Y. Chang, M. Singhal, M. Liu, An improved O(log( – volume: 39 start-page: 64 year: April 1996 end-page: 70 ident: BIB9 article-title: The transits approach to high availability cluster communication publication-title: Commun. ACM – reference: ) multi-mode locking protocol for distributed systems, in: International Parallel and Distributed Processing Symposium, April 2003, accepted for publication. – reference: F. Mueller, Fault tolerance for token-based synchronization protocols, in: Workshop on Fault-Tolerant Parallel and Distributed Systems, April 2001. – volume: 8 start-page: 628 year: 1997 end-page: 639 ident: BIB12 article-title: A circular list-based mutual exclusion scheme for large shared-memory multiprocessors publication-title: IEEE Trans. Parallel Distrib. Systems – volume: 21 start-page: 558 year: July 1978 end-page: 565 ident: BIB18 article-title: Time, clocks and ordering of events in distributed systems publication-title: Commun. ACM – volume: 33 start-page: 107 year: March 1996 end-page: 121 ident: BIB4 article-title: A simulation study on distributed mutual exclusion publication-title: J. Parallel Distrib. Comput. – reference: J.A. Stankovic, S.H. Son, Architecture and object model for distributed object-oriented real-time databases, in: Proceedings of the First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC), April 1998. – reference: ) distributed algorithm for mutual exclusion, in: International Conference on Distributed Computing Systems, 1987. – reference: S. Fu, N. Tzeng, Z. Li, Empirical evaluation of distributed mutual exclusion algorithms, in: International Parallel Processing Symposium, 1997, pp. 255–259. – start-page: 428 year: 1975 end-page: 451 ident: BIB15 article-title: Granularity of locks in a large shared data base publication-title: Proceedings of the International Conference on Very Large Data Bases, Framingham, MA, 22–24 September 1975 – reference: M. Naimi, M. Trehel, An improvement of the log( – reference: F. Mueller, Priority inheritance and ceilings for distributed mutual exclusion, in: IEEE Real-Time Systems Symposium, December 1999, pp. 340–349. – reference: , June 2002. – volume: 21 year: April 1998 ident: BIB30 article-title: The design of the TAO real-time object request broker publication-title: Comput. Commun. – reference: C. Engelmann, S. Scott, G. Geist, Distributed peer-to-peer control in harness, in: International Conference on Computational Science, 2002. – volume: 7 start-page: 61 year: February 1989 end-page: 77 ident: BIB29 article-title: A tree-based algorithm for distributed mutual exclusion publication-title: ACM Trans. Comput. Systems – volume: 8 start-page: 144 year: 1996 end-page: 156 ident: BIB20 article-title: A multi-granularity locking model for concurrency control in object-oriented database systems publication-title: IEEE Transactions on Knowledge and Data Engineering – volume: 7 start-page: 321 year: November 1989 end-page: 359 ident: BIB21 article-title: Memory coherence in shared virtual memory systems publication-title: ACM Trans. Comput. Systems – reference: , April 2000. – volume: 9 start-page: 77 year: May 1990 end-page: 82 ident: BIB14 article-title: Two algorithms for mutual exclusion in real-time distributed computer systems publication-title: J. Parallel Distrib. Comput. – volume: Vol. 36(6) start-page: 223 year: 2001 end-page: 229 ident: BIB2 article-title: Designing an efficient and scalable server-side asynchrony model for CORBA publication-title: Proceeding of the Workshop on Optimization of Middleware and Distributed Systems (OM-01), June 18 2001 – reference: , 530–537. – reference: )) mutual exclusion algorithm for distributed processing, in: International Conference on Parallel Processing, Vol. 3, 1990, pp. 295–302. – volume: 10 start-page: 527 year: December 1994 end-page: 548 ident: BIB3 article-title: Design of mutual exclusion algorithms for real-time distributed systems publication-title: J. Inform. Sci. Eng. – reference: DOC Group at Washington University, Tao: The ace orb, – volume: 13 start-page: 507 year: June 2001 end-page: 541 ident: BIB28 article-title: Evaluating policies and mechanisms to support distributed real-time applications with CORBA publication-title: Concurrency Comput.: Practice Experience – volume: 34 start-page: 1 year: April 1996 end-page: 13 ident: BIB26 article-title: A log( publication-title: J. Parallel Distrib. Comput. – reference: I. Foster, C. Kesselman (Eds.), The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, San Francisco, CA, 1999. – volume: 10 start-page: 527 issue: 4 year: 1994 ident: 10.1016/j.jpdc.2003.10.001_BIB3 article-title: Design of mutual exclusion algorithms for real-time distributed systems publication-title: J. Inform. Sci. Eng. – volume: 5 start-page: 19 issue: 1 year: 1996 ident: 10.1016/j.jpdc.2003.10.001_BIB32 article-title: Priority assignment in real-time active databases publication-title: VLDB J.: Very Large Data Bases doi: 10.1007/s007780050013 – ident: 10.1016/j.jpdc.2003.10.001_BIB24 – volume: 19 start-page: 163 issue: 2 year: 1990 ident: 10.1016/j.jpdc.2003.10.001_BIB1 article-title: Performance evaluation of semantics-based multilevel concurrency control protocols publication-title: SIGMOD Record (ACM Special Interest Group on Management of Data) – volume: 13 start-page: 507 issue: 7 year: 2001 ident: 10.1016/j.jpdc.2003.10.001_BIB28 article-title: Evaluating policies and mechanisms to support distributed real-time applications with CORBA publication-title: Concurrency Comput.: Practice Experience doi: 10.1002/cpe.558 – volume: 8 start-page: 144 issue: 1 year: 1996 ident: 10.1016/j.jpdc.2003.10.001_BIB20 article-title: A multi-granularity locking model for concurrency control in object-oriented database systems publication-title: IEEE Transactions on Knowledge and Data Engineering doi: 10.1109/69.485643 – volume: 33 start-page: 107 issue: 2 year: 1996 ident: 10.1016/j.jpdc.2003.10.001_BIB4 article-title: A simulation study on distributed mutual exclusion publication-title: J. Parallel Distrib. Comput. doi: 10.1006/jpdc.1996.0030 – ident: 10.1016/j.jpdc.2003.10.001_BIB11 – ident: 10.1016/j.jpdc.2003.10.001_BIB23 doi: 10.1109/REAL.1999.818861 – start-page: 428 year: 1975 ident: 10.1016/j.jpdc.2003.10.001_BIB15 article-title: Granularity of locks in a large shared data base – ident: 10.1016/j.jpdc.2003.10.001_BIB13 doi: 10.1109/IPPS.1997.580904 – ident: 10.1016/j.jpdc.2003.10.001_BIB17 – volume: 7 start-page: 61 issue: 1 year: 1989 ident: 10.1016/j.jpdc.2003.10.001_BIB29 article-title: A tree-based algorithm for distributed mutual exclusion publication-title: ACM Trans. Comput. Systems doi: 10.1145/58564.59295 – ident: 10.1016/j.jpdc.2003.10.001_BIB6 – volume: 39 start-page: 64 issue: 4 year: 1996 ident: 10.1016/j.jpdc.2003.10.001_BIB9 article-title: The transits approach to high availability cluster communication publication-title: Commun. ACM doi: 10.1145/227210.227227 – ident: 10.1016/j.jpdc.2003.10.001_BIB16 doi: 10.1109/IPPS.1995.395942 – volume: 33 start-page: 131 issue: 2 year: 1996 ident: 10.1016/j.jpdc.2003.10.001_BIB19 article-title: Multi-granularity locking for nested transactions publication-title: Acta Inform. doi: 10.1007/s002360050038 – ident: 10.1016/j.jpdc.2003.10.001_BIB8 – ident: 10.1016/j.jpdc.2003.10.001_BIB25 – volume: 18 start-page: 94 issue: 12 year: 1993 ident: 10.1016/j.jpdc.2003.10.001_BIB34 article-title: A distributed mutual exclusion algorithm publication-title: ACM Trans. Comput. Systems – ident: 10.1016/j.jpdc.2003.10.001_BIB10 doi: 10.1007/3-540-46080-2_76 – volume: 8 start-page: 628 issue: 6 year: 1997 ident: 10.1016/j.jpdc.2003.10.001_BIB12 article-title: A circular list-based mutual exclusion scheme for large shared-memory multiprocessors publication-title: IEEE Trans. Parallel Distrib. Systems doi: 10.1109/71.595581 – volume: 34 start-page: 1 issue: 1 year: 1996 ident: 10.1016/j.jpdc.2003.10.001_BIB26 article-title: A log(N) distributed mutual exclusion algorithm based on path reversal publication-title: J. Parallel Distrib. Comput. doi: 10.1006/jpdc.1996.0041 – ident: 10.1016/j.jpdc.2003.10.001_BIB27 – volume: 38 start-page: 651 issue: 5 year: 1989 ident: 10.1016/j.jpdc.2003.10.001_BIB31 article-title: A heuristically-aided algorithm for mutual exclusion in distributed systems publication-title: IEEE Trans. Comput. doi: 10.1109/12.24268 – volume: 21 start-page: 558 issue: 7 year: 1978 ident: 10.1016/j.jpdc.2003.10.001_BIB18 article-title: Time, clocks and ordering of events in distributed systems publication-title: Commun. ACM doi: 10.1145/359545.359563 – ident: 10.1016/j.jpdc.2003.10.001_BIB35 – ident: 10.1016/j.jpdc.2003.10.001_BIB22 doi: 10.1109/IPPS.1998.670018 – ident: 10.1016/j.jpdc.2003.10.001_BIB33 – volume: 9 start-page: 77 issue: 1 year: 1990 ident: 10.1016/j.jpdc.2003.10.001_BIB14 article-title: Two algorithms for mutual exclusion in real-time distributed computer systems publication-title: J. Parallel Distrib. Comput. doi: 10.1016/0743-7315(90)90114-5 – volume: 21 issue: 4 year: 1998 ident: 10.1016/j.jpdc.2003.10.001_BIB30 article-title: The design of the TAO real-time object request broker publication-title: Comput. Commun. doi: 10.1016/S0140-3664(97)00165-5 – volume: Vol. 36(6) start-page: 223 year: 2001 ident: 10.1016/j.jpdc.2003.10.001_BIB2 article-title: Designing an efficient and scalable server-side asynchrony model for CORBA – ident: 10.1016/j.jpdc.2003.10.001_BIB7 – volume: 7 start-page: 321 issue: 4 year: 1989 ident: 10.1016/j.jpdc.2003.10.001_BIB21 article-title: Memory coherence in shared virtual memory systems publication-title: ACM Trans. Comput. Systems doi: 10.1145/75104.75105 – ident: 10.1016/j.jpdc.2003.10.001_BIB5
SSID	ssj0011578
Score	1.6826872
Snippet	Middleware components are becoming increasingly important as applications share computational resources in distributed environments, such as high-end clusters...
SourceID	crossref elsevier
SourceType	Index Database Publisher
StartPage	708
SubjectTerms	Concurrency services Distributed agreement Distributed mutual exclusion Distributed resource allocation Distributed transactions Hierarchical locking Large-scale distributed computing Middleware services Peer-to-peer protocols Scalability
Title	Scalable hierarchical locking for distributed systems
URI	https://dx.doi.org/10.1016/j.jpdc.2003.10.001
Volume	64
WOSCitedRecordID	wos000222695400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bS8MwFA46ffDFu3inD75JR7o2S_IooqjIEDZlb6VNU9iUOtwUf77n5LLVC6KCL2UEsnX5zk6-ped8HyFHXNAcZUTCkioeJvAXIsxLmYVay0ioWLW08SG7u-adjuj35Y0rax4bOwFeVeL1VY7-FWoYA7CxdfYXcE_fFAbgNYAOV4Adrj8Cvgurbvqh0OXaPCdAGGDPuvdFkwWK5aLPFZDNcU2x_DNHRWHwhwdt5QTq05Qxg_DbHhJhPbbG1p0BSgTMcNS-19DYw787ZEhmxVD25Mt3v7wrzjTypjy27ZhNbRMoxaJmYdUzfYa1OuUukurpklNR23m57ab-lNTt-cKwORwVRnQybpp6vGi2hU0LC7t4T3hLkLuAvEo6TxZanEnRIAsnl2f9q-kTpojZXdp_B9dQZWv_Pn7S16SlRkR6q2TZoROcWOTXyJyu1smKd-cIXLLeIMwHQlAPhMAFQgCBENQQDVwgbJLb87Pe6UXoTDJCBdR0EmbA9yVnJedFnDD8bdF2LlmZUVq0JWW0SCItsrhUNKOFyIsoZ4lCEqLaeaRovEUa1WOlt0kgkrItsOcSzVcyGcuECeydLgXqOlK1Q479KqQjq4WS-iLBYYprhqamMY7Bmu0Q5hcqdWzOsrQUcP1m3u4f5-2RpVnk7pPG5OlZH5BF9TIZjJ8OHfxvoJptTw
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Scalable+hierarchical+locking+for+distributed+systems&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Desai%2C+Nirmit&rft.au=Mueller%2C+Frank&rft.date=2004-06-01&rft.pub=Elsevier+Inc&rft.issn=0743-7315&rft.eissn=1096-0848&rft.volume=64&rft.issue=6&rft.spage=708&rft.epage=724&rft_id=info:doi/10.1016%2Fj.jpdc.2003.10.001&rft.externalDocID=S0743731503001990
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon