AU2001255456A1 - Concurrent shared object implemented using a linked-list with amortized node allocation - Google Patents

Concurrent shared object implemented using a linked-list with amortized node allocation

Info

Publication number
AU2001255456A1
AU2001255456A1 AU2001255456A AU5545601A AU2001255456A1 AU 2001255456 A1 AU2001255456 A1 AU 2001255456A1 AU 2001255456 A AU2001255456 A AU 2001255456A AU 5545601 A AU5545601 A AU 5545601A AU 2001255456 A1 AU2001255456 A1 AU 2001255456A1
Authority
AU
Australia
Prior art keywords
amortized
linked
list
shared object
node allocation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
AU2001255456A
Inventor
David L. Detlefs
Alexander T. Garthwaite
Paul A. Martin
Mark S. Moir
Guy L. Steele Jr.
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sun Microsystems Inc
Original Assignee
Sun Microsystems Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sun Microsystems Inc filed Critical Sun Microsystems Inc
Publication of AU2001255456A1 publication Critical patent/AU2001255456A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/76—Arrangements for rearranging, permuting or selecting data according to predetermined rules, independently of the content of the data
    • G06F7/78—Arrangements for rearranging, permuting or selecting data according to predetermined rules, independently of the content of the data for changing the order of data flow, e.g. matrix transposition or LIFO buffers; Overflow or underflow handling therefor
    • G06F7/785—Arrangements for rearranging, permuting or selecting data according to predetermined rules, independently of the content of the data for changing the order of data flow, e.g. matrix transposition or LIFO buffers; Overflow or underflow handling therefor having a sequence of storage locations each being individually accessible for both enqueue and dequeue operations, e.g. using a RAM
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/30007—Arrangements for executing specific machine instructions to perform operations on data operands
    • G06F9/30032—Movement instructions, e.g. MOVE, SHIFT, ROTATE, SHUFFLE
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
    • G06F9/526—Mutual exclusion algorithms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/54—Interprogram communication
    • G06F9/544—Buffers; Shared memory; Pipes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2205/00—Indexing scheme relating to group G06F5/00; Methods or arrangements for data conversion without changing the order or content of the data handled
    • G06F2205/06—Indexing scheme relating to groups G06F5/06 - G06F5/16
    • G06F2205/064—Linked list, i.e. structure using pointers, e.g. allowing non-contiguous address segments in one logical buffer or dynamic buffer space allocation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/52—Indexing scheme relating to G06F9/52
    • G06F2209/521—Atomic
AU2001255456A 2000-04-18 2001-04-18 Concurrent shared object implemented using a linked-list with amortized node allocation Abandoned AU2001255456A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US55111300A 2000-04-18 2000-04-18
US09/551,113 2000-04-18
PCT/US2001/012615 WO2001080015A2 (en) 2000-04-18 2001-04-18 Concurrent shared object implemented using a linked-list with amortized node allocation

Publications (1)

Publication Number Publication Date
AU2001255456A1 true AU2001255456A1 (en) 2001-10-30

Family

ID=24199915

Family Applications (1)

Application Number Title Priority Date Filing Date
AU2001255456A Abandoned AU2001255456A1 (en) 2000-04-18 2001-04-18 Concurrent shared object implemented using a linked-list with amortized node allocation

Country Status (3)

Country Link
US (2) US7017160B2 (en)
AU (1) AU2001255456A1 (en)
WO (1) WO2001080015A2 (en)

Families Citing this family (77)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6359899B1 (en) * 1997-05-28 2002-03-19 Lucent Technologies Inc. Priority access for real-time traffic in contention-based networks
US6651146B1 (en) * 2000-02-24 2003-11-18 International Business Machines Corporation Method and apparatus for managing access contention to a linear list without the use of locks
US6823351B1 (en) * 2000-05-15 2004-11-23 Sun Microsystems, Inc. Work-stealing queues for parallel garbage collection
US6826583B1 (en) 2000-05-15 2004-11-30 Sun Microsystems, Inc. Local allocation buffers for parallel garbage collection
US7299242B2 (en) 2001-01-12 2007-11-20 Sun Microsystems, Inc. Single-word lock-free reference counting
US6993770B1 (en) 2001-01-12 2006-01-31 Sun Microsystems, Inc. Lock free reference counting
US7769791B2 (en) * 2001-01-12 2010-08-03 Oracle America, Inc. Lightweight reference counting using single-target synchronization
US7103887B2 (en) * 2001-06-27 2006-09-05 Sun Microsystems, Inc. Load-balancing queues employing LIFO/FIFO work stealing
JP2003141173A (en) * 2001-08-22 2003-05-16 Komatsu Ltd Database management system and database
US7237228B1 (en) * 2001-12-06 2007-06-26 Unisys Corporation Arbitrary and expandable high-precision datatype and method of processing
AU2003205092A1 (en) * 2002-01-11 2003-07-30 Sun Microsystems, Inc. Value recycling facility for multithreaded computations
US7836228B1 (en) 2004-06-18 2010-11-16 Oracle America, Inc. Scalable and lock-free first-in-first-out queue implementation
US7685583B2 (en) 2002-07-16 2010-03-23 Sun Microsystems, Inc. Obstruction-free mechanism for atomic update of multiple non-contiguous locations in shared memory
US9052944B2 (en) 2002-07-16 2015-06-09 Oracle America, Inc. Obstruction-free data structures and mechanisms with separable and/or substitutable contention management mechanisms
US7249352B2 (en) * 2002-08-22 2007-07-24 International Business Machines Corporation Apparatus and method for removing elements from a linked list
US7293143B1 (en) 2002-09-24 2007-11-06 Sun Microsystems, Inc. Efficient non-blocking k-compare-single-swap operation
US7814488B1 (en) 2002-09-24 2010-10-12 Oracle America, Inc. Quickly reacquirable locks
US7213244B2 (en) * 2003-03-13 2007-05-01 International Business Machines Corporation Apparatus and method for distribution of work on a doubly linked list among processing threads
US7328438B2 (en) * 2003-03-27 2008-02-05 International Business Machines Corporation Deallocation of computer data in a multithreaded computer
US7930426B1 (en) * 2003-04-01 2011-04-19 Cisco Technology, Inc. Method for tracking transmission status of data to entities such as peers in a network
US8250107B2 (en) * 2003-06-03 2012-08-21 Hewlett-Packard Development Company, L.P. Techniques for graph data structure management
US7424477B1 (en) 2003-09-03 2008-09-09 Sun Microsystems, Inc. Shared synchronized skip-list data structure and technique employing linearizable operations
US7500242B2 (en) * 2003-09-08 2009-03-03 Intel Corporation Low-contention lock
US7543301B2 (en) * 2003-10-21 2009-06-02 Gemstone Systems, Inc. Shared queues in shared object space
US20050086662A1 (en) * 2003-10-21 2005-04-21 Monnie David J. Object monitoring system in shared object space
US7689986B2 (en) * 2003-10-21 2010-03-30 Gemstone Systems, Inc. Shared listeners in shared object space
US20050086661A1 (en) 2003-10-21 2005-04-21 Monnie David J. Object synchronization in shared object space
US10049127B1 (en) 2003-12-19 2018-08-14 Oracle America, Inc. Meta-transactional synchronization
US7533138B1 (en) * 2004-04-07 2009-05-12 Sun Microsystems, Inc. Practical lock-free doubly-linked list
US7389291B1 (en) * 2004-06-15 2008-06-17 Sun Microsystems, Inc. Implementing optimistic concurrent data structures
US7451146B2 (en) * 2004-06-30 2008-11-11 Hewlett-Packard Development Company, L.P. Almost non-blocking linked stack implementation
US8074030B1 (en) 2004-07-20 2011-12-06 Oracle America, Inc. Using transactional memory with early release to implement non-blocking dynamic-sized data structure
US7703098B1 (en) 2004-07-20 2010-04-20 Sun Microsystems, Inc. Technique to allow a first transaction to wait on condition that affects its working set
US7395382B1 (en) 2004-08-10 2008-07-01 Sun Microsystems, Inc. Hybrid software/hardware transactional memory
US7711909B1 (en) 2004-12-09 2010-05-04 Oracle America, Inc. Read sharing using global conflict indication and semi-transparent reading in a transactional memory space
US7533221B1 (en) 2004-12-30 2009-05-12 Sun Microsystems, Inc. Space-adaptive lock-free free-list using pointer-sized single-target synchronization
US7680986B1 (en) 2004-12-30 2010-03-16 Sun Microsystems, Inc. Practical implementation of arbitrary-sized LL/SC variables
US7577798B1 (en) 2004-12-30 2009-08-18 Sun Microsystems, Inc. Space-adaptive lock-free queue using pointer-sized single-target synchronization
US7757052B2 (en) * 2005-01-05 2010-07-13 International Business Machines Corporation Apparatus, system, and method for optimizing recall of logical volumes in a virtual tape server
US7583687B2 (en) * 2006-01-03 2009-09-01 Sun Microsystems, Inc. Lock-free double-ended queue based on a dynamic ring
US7536428B2 (en) * 2006-06-23 2009-05-19 Microsoft Corporation Concurrent read and write access to a linked list where write process updates the linked list by swapping updated version of the linked list with internal list
US8601456B2 (en) * 2006-08-04 2013-12-03 Microsoft Corporation Software transactional protection of managed pointers
US7895582B2 (en) 2006-08-04 2011-02-22 Microsoft Corporation Facilitating stack read and write operations in a software transactional memory system
US7702953B2 (en) * 2007-01-04 2010-04-20 International Business Machines Corporation Storage management in cascaded replication of data
US7716192B2 (en) * 2007-05-08 2010-05-11 Microsoft Corporation Concurrent, lock-free object copying
US9009452B2 (en) 2007-05-14 2015-04-14 International Business Machines Corporation Computing system with transactional memory using millicode assists
US8117403B2 (en) * 2007-05-14 2012-02-14 International Business Machines Corporation Transactional memory system which employs thread assists using address history tables
US8688920B2 (en) 2007-05-14 2014-04-01 International Business Machines Corporation Computing system with guest code support of transactional memory
US8321637B2 (en) * 2007-05-14 2012-11-27 International Business Machines Corporation Computing system with optimized support for transactional memory
US8095741B2 (en) * 2007-05-14 2012-01-10 International Business Machines Corporation Transactional memory computing system with support for chained transactions
US8095750B2 (en) * 2007-05-14 2012-01-10 International Business Machines Corporation Transactional memory system with fast processing of common conflicts
US7644238B2 (en) 2007-06-01 2010-01-05 Microsoft Corporation Timestamp based transactional memory
US8176253B2 (en) * 2007-06-27 2012-05-08 Microsoft Corporation Leveraging transactional memory hardware to accelerate virtualization and emulation
US9043553B2 (en) * 2007-06-27 2015-05-26 Microsoft Technology Licensing, Llc Leveraging transactional memory hardware to accelerate virtualization and emulation
US8266387B2 (en) * 2007-06-27 2012-09-11 Microsoft Corporation Leveraging transactional memory hardware to accelerate virtualization emulation
US8478834B2 (en) * 2007-07-12 2013-07-02 International Business Machines Corporation Low latency, high bandwidth data communications between compute nodes in a parallel computer
US8959172B2 (en) * 2007-07-27 2015-02-17 International Business Machines Corporation Self-pacing direct memory access data transfer operations for compute nodes in a parallel computer
US8005787B2 (en) * 2007-11-02 2011-08-23 Vmware, Inc. Data replication method
US8589358B2 (en) * 2008-06-26 2013-11-19 Emc Corporation Mechanisms to share attributes between objects
US8526326B1 (en) * 2008-08-27 2013-09-03 Juniper Networks, Inc. Lock-less access of pre-allocated memory buffers used by a network device
US8645324B2 (en) 2009-01-09 2014-02-04 Pivotal Software, Inc. Preventing pauses in algorithms requiring pre-image information concerning modifications during data replication
US20120117317A1 (en) 2009-08-20 2012-05-10 Rambus Inc. Atomic memory device
US8566524B2 (en) 2009-08-31 2013-10-22 International Business Machines Corporation Transactional memory system with efficient cache support
US8364886B2 (en) * 2010-01-26 2013-01-29 Seagate Technology Llc Verifying whether metadata identifies a most current version of stored data in a memory space
US8544026B2 (en) 2010-02-09 2013-09-24 International Business Machines Corporation Processing data communications messages with input/output control blocks
US8397101B2 (en) 2010-06-03 2013-03-12 Seagate Technology Llc Ensuring a most recent version of data is recovered from a memory
US8412691B2 (en) 2010-09-10 2013-04-02 International Business Machines Corporation Maintenance and access of a linked list
US8949453B2 (en) 2010-11-30 2015-02-03 International Business Machines Corporation Data communications in a parallel active messaging interface of a parallel computer
US8949328B2 (en) 2011-07-13 2015-02-03 International Business Machines Corporation Performing collective operations in a distributed processing system
WO2013018593A1 (en) * 2011-07-29 2013-02-07 日本電気株式会社 Information processing apparatus, information processing system, information processing method, and control program storage medium
JP5862246B2 (en) * 2011-11-30 2016-02-16 富士通株式会社 Data management program, data management method, and storage apparatus
US8930962B2 (en) 2012-02-22 2015-01-06 International Business Machines Corporation Processing unexpected messages at a compute node of a parallel computer
US8930893B2 (en) 2012-06-28 2015-01-06 International Business Machines Corporation Initialization safety
US9128749B1 (en) * 2013-06-27 2015-09-08 Emc Corporation Method and system for lock free statistics collection
US9342384B1 (en) 2014-12-18 2016-05-17 Intel Corporation Function callback mechanism between a central processing unit (CPU) and an auxiliary processor
US10846240B2 (en) * 2018-04-05 2020-11-24 Oracle International Corporation Supporting concurrent remove operations and add-to-front operations on a least recently used (LRU) queue
CN112000588A (en) * 2020-07-30 2020-11-27 北京浪潮数据技术有限公司 fifo linked list management method, device, equipment and readable storage medium

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3686641A (en) * 1970-09-30 1972-08-22 Burroughs Corp Multiprogram digital processing system with interprogram communication
US3886525A (en) * 1973-06-29 1975-05-27 Ibm Shared data controlled by a plurality of users
US4584640A (en) 1984-06-27 1986-04-22 Motorola, Inc. Method and apparatus for a compare and swap instruction
US5081572A (en) 1988-10-28 1992-01-14 Arnold Michael E Manipulation of time-ordered lists and instructions therefor
US5224215A (en) 1990-07-13 1993-06-29 International Business Machines Corporation Message queue processing among cooperative processors having significant speed differences
JP2505980B2 (en) * 1993-04-16 1996-06-12 インターナショナル・ビジネス・マシーンズ・コーポレイション Static dictionary creation method and computer execution system
US6247064B1 (en) * 1994-12-22 2001-06-12 Unisys Corporation Enqueue instruction in a system architecture for improved message passing and process synchronization
US5797005A (en) * 1994-12-30 1998-08-18 International Business Machines Corporation Shared queue structure for data integrity
FI981917A (en) * 1998-09-08 2000-03-09 Nokia Networks Oy A method for implementing a FIFO queue in memory and a memory arrangement
US6178473B1 (en) * 1998-10-15 2001-01-23 Compaq Computer Corporation System for selectively incrementing a count number of an associated node only when the node is put in use in conjunction with a successful compare and swap operation
US6223335B1 (en) * 1998-12-09 2001-04-24 Sun Microsystems, Inc. Platform independent double compare and swap operation
US6360219B1 (en) * 1998-12-16 2002-03-19 Gemstone Systems, Inc. Object queues with concurrent updating
US6701420B1 (en) * 1999-02-01 2004-03-02 Hewlett-Packard Company Memory management system and method for allocating and reusing memory

Also Published As

Publication number Publication date
WO2001080015A3 (en) 2003-10-23
US20060161737A1 (en) 2006-07-20
US7017160B2 (en) 2006-03-21
WO2001080015A2 (en) 2001-10-25
US20010047361A1 (en) 2001-11-29

Similar Documents

Publication Publication Date Title
AU2001255456A1 (en) Concurrent shared object implemented using a linked-list with amortized node allocation
AU2001273068A1 (en) Trade allocation
AU2001225361A1 (en) Resource allocation
AU2001264088A1 (en) Dynamic bandwidth allocation
EP1240535A4 (en) Composing microscope
AU2001295447A1 (en) Implants with a phosphazene-containing coating
AU2001258437A1 (en) Resource allocation in packet network
GB0001804D0 (en) Pre-emptive bandwidth allocation by dynamic positioning
GB0112765D0 (en) Reconfiguration manager
AU2002229691A1 (en) Managing multiple radiotelephones
AU2001296371A1 (en) Dynamic resource management systems
AU4163000A (en) A spreader
AU2001277224A1 (en) Multiple block sequential memory management
AU4162900A (en) A spreader
GB0013936D0 (en) Component management system
AU2001231001A1 (en) Thread locking structure
AU2001237579A1 (en) Network access arrangement
AU9334801A (en) Network arrangement
AU2001249886A1 (en) High q structure
AU2001261840A1 (en) Looking up a network resource location
AU2001263783A1 (en) Locking arrangement
AU2001247561A1 (en) Composite yarn
AU2002219265A1 (en) Centralized session management
GB0013523D0 (en) Coated baking foil
AU2002222226A1 (en) Level allocation