Message passing with queues and channels

Dozsa, Gabor J; Heidelberger, Philip; Kumar, Sameer; Ratterman, Joseph D; Steinmacher-Burow, Burkhard; Wisniewski, Robert W

Advanced Search OptionsAdvanced Search queries use a traditional Term Search. For more info, see our FAQ.

All Fields:

Patent Title:

Abstract:

Assignee:

Inventor(s):

Patent Number:

Patent Classification (CPC):

All Classifications
A - human necessities
A01 - agriculture
A21 - baking
A22 - butchering
A23 - foods or foodstuffs
A24 - tobacco
A41 - wearing apparel
A42 - headwear
A43 - footwear
A44 - haberdashery
A45 - hand or travelling articles
A46 - brushware
A47 - furniture
A61 - medical or veterinary science
A62 - life-saving
A63 - sports
A99 - subject matter not otherwise provided for in this section
B - performing operations
B01 - physical or chemical processes or apparatus in general
B02 - crushing, pulverising, or disintegrating
B03 - separation of solid materials using liquids or using pneumatic tables or jigs
B04 - centrifugal apparatus or machines for carrying-out physical or chemical processes
B05 - spraying or atomising in general
B06 - generating or transmitting mechanical vibrations in general
B07 - separating solids from solids
B08 - cleaning
B09 - disposal of solid waste
B21 - mechanical metal-working without essentially removing material
B22 - casting
B23 - machine tools
B24 - grinding
B25 - hand tools
B26 - hand cutting tools
B27 - working or preserving wood or similar material
B28 - working cement, clay, or stone
B29 - working of plastics
B30 - presses
B31 - making articles of paper, cardboard or material worked in a manner analogous to paper
B32 - layered products
B33 - additive manufacturing technology
B41 - printing
B42 - bookbinding
B43 - writing or drawing implements
B44 - decorative arts
B60 - vehicles in general
B61 - railways
B62 - land vehicles for travelling otherwise than on rails
B63 - ships or other waterborne vessels
B64 - aircraft
B65 - conveying
B66 - hoisting
B67 - opening, closing {or cleaning} bottles, jars or similar containers
B68 - saddlery
B81 - microstructural technology
B82 - nanotechnology
B99 - subject matter not otherwise provided for in this section
C - chemistry
C01 - inorganic chemistry
C02 - treatment of water, waste water, sewage, or sludge
C03 - glass
C04 - cements
C05 - fertilisers
C06 - explosives
C07 - organic chemistry
C08 - organic macromolecular compounds
C09 - dyes
C10 - petroleum, gas or coke industries
C11 - animal or vegetable oils, fats, fatty substances or waxes
C12 - biochemistry
C13 - sugar industry
C14 - skins
C21 - metallurgy of iron
C22 - metallurgy
C23 - coating metallic material
C25 - electrolytic or electrophoretic processes
C30 - crystal growth
C40 - combinatorial technology
C99 - subject matter not otherwise provided for in this section
D - textiles
D01 - natural or man-made threads or fibres
D02 - yarns
D03 - weaving
D04 - braiding
D05 - sewing
D06 - treatment of textiles or the like
D07 - ropes
D10 - indexing scheme associated with sublasses of section d, relating to textiles
D21 - paper-making
D99 - subject matter not otherwise provided for in this section
E - fixed constructions
E01 - construction of roads, railways, or bridges
E02 - hydraulic engineering
E03 - water supply
E04 - building
E05 - locks
E06 - doors, windows, shutters, or roller blinds in general
E21 - earth drilling
E99 - subject matter not otherwise provided for in this section
F - mechanical engineering
F01 - machines or engines in general
F02 - combustion engines
F03 - machines or engines for liquids
F04 - positive - displacement machines for liquids
F05 - indexing schemes relating to engines or pumps in various subclasses of classes f01-f04
F15 - fluid-pressure actuators
F16 - engineering elements and units
F17 - storing or distributing gases or liquids
F21 - lighting
F22 - steam generation
F23 - combustion apparatus
F24 - heating
F25 - refrigeration or cooling
F26 - drying
F27 - furnaces
F28 - heat exchange in general
F41 - weapons
F42 - ammunition
F99 - subject matter not otherwise provided for in this section
G - physics
G01 - measuring
G02 - optics
G03 - photography
G04 - horology
G05 - controlling
G06 - computing
G07 - checking-devices
G08 - signalling
G09 - education
G10 - musical instruments
G11 - information storage
G12 - instrument details
G16 - information and communication technology [ict] specially adapted for specific application fields
G21 - nuclear physics
G99 - subject matter not otherwise provided for in this section
H - electricity
H01 - basic electric elements
H02 - generation
H03 - basic electronic circuitry
H04 - electric communication technique
H05 - electric techniques not otherwise provided for
H99 - subject matter not otherwise provided for in this section
Y - new / cross sectional technologies
Y02 - technologies or applications for mitigation or adaptation against climate change
Y04 - information or communication technologies having an impact on other technology areas
Y10 - technical subjects covered by former uspc

More Options ...

Title: Message passing with queues and channels

Abstract

In an embodiment, a send thread receives an identifier that identifies a destination node and a pointer to data. The send thread creates a first send request in response to the receipt of the identifier and the data pointer. The send thread selects a selected channel from among a plurality of channels. The selected channel comprises a selected hand-off queue and an identification of a selected message unit. Each of the channels identifies a different message unit. The selected hand-off queue is randomly accessible. If the selected hand-off queue contains an available entry, the send thread adds the first send request to the selected hand-off queue. If the selected hand-off queue does not contain an available entry, the send thread removes a second send request from the selected hand-off queue and sends the second send request to the selected message unit.

Inventors:: Dozsa, Gabor J; Heidelberger, Philip; Kumar, Sameer; Ratterman, Joseph D; Steinmacher-Burow, Burkhard; Wisniewski, Robert W

Issue Date:: Tue Sep 24 00:00:00 EDT 2013

Research Org.:: International Business Machines Corp., Armonk, NY (United States)

Sponsoring Org.:: USDOE

OSTI Identifier:: 1096003

Patent Number(s):: 8543722

Application Number:: 12/750,363

Assignee:: International Business Machines Corporation (Armonk, NY)

Patent Classifications (CPCs):: G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING

Show more

G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
G06F9/546 - {Message passing systems or structures, e.g. queues}

Show less

DOE Contract Number:: B554331

Resource Type:: Patent

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Citation Formats


                    Dozsa, Gabor J, Heidelberger, Philip, Kumar, Sameer, Ratterman, Joseph D, Steinmacher-Burow, Burkhard, and Wisniewski, Robert W. Message passing with queues and channels.  United States: N. p., 2013. 
        Web.

Copy to clipboard


                    Dozsa, Gabor J, Heidelberger, Philip, Kumar, Sameer, Ratterman, Joseph D, Steinmacher-Burow, Burkhard, & Wisniewski, Robert W. Message passing with queues and channels.  United States.

Copy to clipboard


                    Dozsa, Gabor J, Heidelberger, Philip, Kumar, Sameer, Ratterman, Joseph D, Steinmacher-Burow, Burkhard, and Wisniewski, Robert W. Tue .  
        "Message passing with queues and channels".  United States.  https://www.osti.gov/servlets/purl/1096003.

Copy to clipboard


                    
@article{osti_1096003,

  title        = {Message passing with queues and channels},

  author       = {Dozsa, Gabor J and Heidelberger, Philip and Kumar, Sameer and Ratterman, Joseph D and Steinmacher-Burow, Burkhard and Wisniewski, Robert W},

  abstractNote = {In an embodiment, a send thread receives an identifier that identifies a destination node and a pointer to data. The send thread creates a first send request in response to the receipt of the identifier and the data pointer. The send thread selects a selected channel from among a plurality of channels. The selected channel comprises a selected hand-off queue and an identification of a selected message unit. Each of the channels identifies a different message unit. The selected hand-off queue is randomly accessible. If the selected hand-off queue contains an available entry, the send thread adds the first send request to the selected hand-off queue. If the selected hand-off queue does not contain an available entry, the send thread removes a second send request from the selected hand-off queue and sends the second send request to the selected message unit.},

  doi          = {},

  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {Tue Sep 24 00:00:00 EDT 2013},

  month        = {Tue Sep 24 00:00:00 EDT 2013}

}

Copy to clipboard

Patent:

Save / Share:

Export Metadata

Save to My Library

Works referenced in this record:

Investigation of crosstalk performance of eight-channel p-i-n/HBT OEIC photoreceiver array modules
journal, May 1996

Chandrasekhar, S.; Garrett, L. D.; Lunardi, L. M.
IEEE Photonics Technology Letters, Vol. 8, Issue 5
https://doi.org/10.1109/68.491594

Reassembly of data fragments in fixed size buffers
patent, May 2008

Reast, Dayne A.; Hur, Benjamin; Wang, Sangyu
US Patent Document 7,372,864
URL: https://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/7372864

IP address resolution methods and apparatus
patent, February 2006

Beshai, Maged E.
US Patent Document 6,996,559
URL: https://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/6996559

A Multithreaded Message Passing Interface (MPI) Architecture: Performance and Program Issues
journal, April 2001

Protopopov, Boris V.; Skjellum, Anthony
Journal of Parallel and Distributed Computing, Vol. 61, Issue 4
https://doi.org/10.1006/jpdc.2000.1674

Similar Records in DOE Patents and OSTI.GOV collections:

Message passing with queues and channels

Patent Dozsa, Gabor J; Heidelberger, Philip; Kumar, Sameer; ...

In an embodiment, a reception thread receives a source node identifier, a type, and a data pointer from an application and, in response, creates a receive request. If the source node identifier specifies a source node, the reception thread adds the receive request to a fast-post queue. If a message received from a network does not match a receive request on a posted queue, a polling thread adds a receive request that represents the message to an unexpected queue. If the fast-post queue contains the receive request, the polling thread removes the receive request from the fast-post queue. If themore » « less
Full Text Available
Message passing with parallel queue traversal

Patent Underwood, Keith D [Albuquerque, NM]; Brightwell, Ronald B [Albuquerque, NM]; Hemmert, K Scott [Albuquerque, NM]

In message passing implementations, associative matching structures are used to permit list entries to be searched in parallel fashion, thereby avoiding the delay of linear list traversal. List management capabilities are provided to support list entry turnover semantics and priority ordering semantics.
Full Text Available
Increasing available FIFO space to prevent messaging queue deadlocks in a DMA environment

Patent Blocksome, Michael A [Rochester, MN]; Chen, Dong [Croton On Hudson, NY]; Gooding, Thomas [Rochester, MN]; ...

Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate an interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the fullmore » « less
Full Text Available
Preventing messaging queue deadlocks in a DMA environment

Patent Blocksome, Michael A; Chen, Dong; Gooding, Thomas; ...

Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate and interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the fullmore » « less
Full Text Available
Apparatus and method for managing digital resources by passing digital resource tokens between queues

Patent Crawford, Henry J [Berkeley, CA]; Lindenstruth, Volker [El Cerrito, CA]

A method of managing digital resources of a digital system includes the step of reserving token values for certain digital resources in the digital system. A selected token value in a free-buffer-queue is then matched to an incoming digital resource request. The selected token value is then moved to a valid-request-queue. The selected token is subsequently removed from the valid-request-queue to allow a digital agent in the digital system to process the incoming digital resource request associated with the selected token. Thereafter, the selected token is returned to the free-buffer-queue.
Full Text Available

Similar Records

Title: Message passing with queues and channels

Abstract

Citation Formats

Investigation of crosstalk performance of eight-channel p-i-n/HBT OEIC photoreceiver array modules journal, May 1996

Reassembly of data fragments in fixed size buffers patent, May 2008

IP address resolution methods and apparatus patent, February 2006

A Multithreaded Message Passing Interface (MPI) Architecture: Performance and Program Issues journal, April 2001

Investigation of crosstalk performance of eight-channel p-i-n/HBT OEIC photoreceiver array modules
journal, May 1996

Reassembly of data fragments in fixed size buffers
patent, May 2008

IP address resolution methods and apparatus
patent, February 2006

A Multithreaded Message Passing Interface (MPI) Architecture: Performance and Program Issues
journal, April 2001