Patents by Inventor David C. Kalmuk
David C. Kalmuk has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9813502Abstract: A computer-implemented method includes receiving a request to transmit column group data to a target node, the column group data comprising C columns within a column-oriented data table and determining a transmission row count R for transmitting the column group data to the target node. The method may also include transmitting a transmission packet comprising R sequentially-ordered data elements for each of the C columns to the target node. The R data elements for each column may be sequentially retrieved from memory. A corresponding method includes receiving, at a target node, a request to receive the column group data, determining the transmission row count R for receiving the column group data, and receiving a transmission packet comprising R sequentially-ordered data elements for each of the C columns and storing the sequentially-ordered data elements within memory. A corresponding computer system and corresponding computer program products are also disclosed herein.Type: GrantFiled: May 2, 2017Date of Patent: November 7, 2017Assignee: International Business Machines CorporationInventors: Xing Chen, Paul C. Huffman, David C. Kalmuk, Sam S. Lightstone, Shaorong Liu
-
Patent number: 9720602Abstract: A computer-implemented method includes receiving a request to transmit column group data to a target node, the column group data comprising C columns within a column-oriented data table and determining a transmission row count R for transmitting the column group data to the target node. The method may also include transmitting a transmission packet comprising R sequentially-ordered data elements for each of the C columns to the target node. The R data elements for each column may be sequentially retrieved from memory. A corresponding method includes receiving, at a target node, a request to receive the column group data, determining the transmission row count R for receiving the column group data, and receiving a transmission packet comprising R sequentially-ordered data elements for each of the C columns and storing the sequentially-ordered data elements within memory. A corresponding computer system and corresponding computer program products are also disclosed herein.Type: GrantFiled: June 1, 2016Date of Patent: August 1, 2017Assignee: International Business Machines CorporationInventors: Xing Chen, Paul C. Huffman, David C. Kalmuk, Sam S. Lightstone, Shaorong Liu
-
Patent number: 7934220Abstract: An operating system directed to using special properties of a common inter-process communications mechanism (IPC), namely UNIX domain socket-pairs or stream-pipes alternatively as a storage medium for file-descriptors of UNIX processes. When a file-descriptor is written into a socket-pair, and closed in the UNIX process, the file remains open, but occupies no space in the process' file-table. The file-descriptor may later be read out of the socket-pair to reestablish it in the file-table, and access it. This property is implemented in an IPC mechanism of UNIX operating system whereby a process such as a dispatcher may manage more connections and processes than its file-table size allow. This provides scalability improvements of the UNIX operating system.Type: GrantFiled: March 17, 2008Date of Patent: April 26, 2011Assignee: International Business Machines CorporationInventors: David C. Kalmuk, Jon A Lind, Hebert W. Pereyra, Xun Xue
-
Patent number: 7844974Abstract: An operating system directed to using special properties of a common inter-process communications mechanism (IPC), namely UNIX domain socket-pairs or stream-pipes alternatively as a storage medium for file-descriptors of UNIX processes. When a file-descriptor is written into a socket-pair, and closed in the UNIX process, the file remains open, but occupies no space in the process' file-table. The file-descriptor may later be read out of the socket-pair to reestablish it in the file-table, and access it. This property is implemented in an IPC mechanism of UNIX operating system whereby a process such as a dispatcher may manage more connections and processes than its file-table size allow. This provides scalability improvements of the UNIX operating system.Type: GrantFiled: April 17, 2008Date of Patent: November 30, 2010Assignee: International Business Machines CorporationInventors: David C. Kalmuk, Jon A. Lind, Hebert W. Pereyra, Xun Xue
-
Publication number: 20080189710Abstract: An operating system directed to using special properties of a common inter-process communications mechanism (IPC), namely UNIX domain socket-pairs or stream-pipes alternatively as a storage medium for file-descriptors of UNIX processes. When a file-descriptor is written into a socket-pair, and closed in the UNIX process, the file remains open, but occupies no space in the process' file-table. The file-descriptor may later be read out of the socket-pair to reestablish it in the file-table, and access it. This property is implemented in an IPC mechanism of UNIX operating system whereby a process such as a dispatcher may manage more connections and processes than its file-table size allow. This provides scalability improvements of the UNIX operating system.Type: ApplicationFiled: April 17, 2008Publication date: August 7, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David C. Kalmuk, Jon A. Lind, Hebert W. Pereyra, Xun Xue
-
Publication number: 20080163243Abstract: An operating system directed to using special properties of a common inter-process communications mechanism (IPC), namely UNIX domain socket-pairs or stream-pipes alternatively as a storage medium for file-descriptors of UNIX processes. When a file-descriptor is written into a socket-pair, and closed in the UNIX process, the file remains open, but occupies no space in the process' file-table. The file-descriptor may later be read out of the socket-pair to reestablish it in the file-table, and access it. This property is implemented in an IPC mechanism of UNIX operating system whereby a process such as a dispatcher may manage more connections and processes than its file-table size allow. This provides scalability improvements of the UNIX operating system.Type: ApplicationFiled: March 17, 2008Publication date: July 3, 2008Inventors: David C. Kalmuk, Jon A. Lind, Hebert W. Pereyra, Xun Xue
-
Patent number: 7373647Abstract: An operating system directed to using special properties of a common inter-process communications mechanism (IPC), namely UNIX domain socket-pairs or stream-pipes alternatively as a storage medium for file-descriptors of UNIX processes. When a file-descriptor is written into a socket-pair, and closed in the UNIX process, the file remains open, but occupies no space in the process' file-table. The file-descriptor may later be read out of the socket-pair to reestablish it in the file-table, and access it. This property is implemented in an IPC mechanism of UNIX operating system whereby a process such as a dispatcher may manage more connections and processes than its file-table size allow. This provides scalability improvements of the UNIX operating system.Type: GrantFiled: April 30, 2003Date of Patent: May 13, 2008Assignee: International Business Machines CorporationInventors: David C. Kalmuk, Jon A Lind, Hebert W. Pereyra, Xun Xue
-
Patent number: 7246167Abstract: A communications multiplexor includes dispatcher processes for monitoring client connections. The dispatcher processes detect activity on those connections, and then pass active physical (client) connections to agent processes for servicing. Transfer is done through specific connection queues that are associated with a set of agents. A multi-queuing structure permits pooling of agents on a set of shared resources thereby reducing time required to switch between different client connections. After an agent has serviced a given connection, the agent returns that connection to the agent's dispatcher (there is a static assignment between connections and dispatchers), and then reads the next unit of work from the agent's associated connection queue. This structure may be scalable while allowing optimal performance when passing physical connections between processes.Type: GrantFiled: April 14, 2003Date of Patent: July 17, 2007Assignee: International Business Machines CorporationInventors: David C. Kalmuk, Jon A. Lind, Hebert W. Pereyra, Xun Xue
-
Patent number: 7080228Abstract: A reservation system for making reservations in a shared memory buffer to store information from applications is logically partitioned in a number of fixed size indexed contiguous slots. The reservation system uses an atomic counter that is stored in the shared memory buffer. The value of the atomic counter can be associated with the index of a slot available for reservation. An application making a reservation increases the atomic counter value on a number of reserved slots to provide a value that is associated with the index of the next slot available for reservation. After the reservation is accomplished, the information is written into the reserved slots. The reservation system writes parsing information for further parsing to validate information in the shared memory buffer. The reservation system provides functionality for continuous and instantaneous dumping of the shared memory buffer into a file for cleaning and for wrapping the buffer.Type: GrantFiled: April 29, 2003Date of Patent: July 18, 2006Assignee: International Business Machines CorporationInventors: Matthew Albert Huras, David C. Kalmuk, John P. Kennedy, Herbert W. Pereyra, Mark F. Wilding
-
Publication number: 20040221294Abstract: An operating system directed to using special properties of a common inter-process communications mechanism (IPC), namely UNIX domain socket-pairs or stream-pipes alternatively as a storage medium for file-descriptors of UNIX processes. When a file-descriptor is written into a socket-pair, and closed in the UNIX process, the file remains open, but occupies no space in the process' file-table. The file-descriptor may later be read out of the socket-pair to reestablish it in the file-table, and access it. This property is implemented in an IPC mechanism of UNIX operating system whereby a process such as a dispatcher may manage more connections and processes than its file-table size allow. This provides scalability improvements of the UNIX operating system.Type: ApplicationFiled: April 30, 2003Publication date: November 4, 2004Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David C. Kalmuk, Jon A. Lind, Hebert W. Pereyra, Xun Xue
-
Publication number: 20040181635Abstract: A reservation system for making reservations in a shared memory buffer to store information from applications is logically partitioned in a number of fixed size indexed contiguous slots. The reservation system uses an atomic counter that is stored in the shared memory buffer. The value of the atomic counter can be associated with the index of a slot available for reservation. An application making a reservation increases the atomic counter value on a number of reserved slots to provide a value that is associated with the index of the next slot available for reservation. After the reservation is accomplished, the information is written into the reserved slots. The reservation system writes parsing information for further parsing to validate information in the shared memory buffer. The reservation system provides functionality for continuous and instantaneous dumping of the shared memory buffer into a file for cleaning and for wrapping the buffer.Type: ApplicationFiled: April 29, 2003Publication date: September 16, 2004Applicant: International Business Machines CorporationInventors: Matthew Albert Huras, David C. Kalmuk, John P. Kennedy, Hebert W. Pereyra, Mark F. Wilding
-
Publication number: 20040122953Abstract: A communications multiplexor includes dispatcher processes for monitoring client connections. The dispatcher processes detect activity on those connections, and then pass active physical (client) connections to agent processes for servicing. Transfer is done through specific connection queues that are associated with a set of agents. A multi-queuing structure permits pooling of agents on a set of shared resources thereby reducing time required to switch between different client connections. After an agent has serviced a given connection, the agent returns that connection to the agent's dispatcher (there is a static assignment between connections and dispatchers), and then reads the next unit of work from the agent's associated connection queue. This structure may be scalable while allowing optimal performance when passing physical connections between processes.Type: ApplicationFiled: April 14, 2003Publication date: June 24, 2004Applicant: International Business Machines CorporationInventors: David C. Kalmuk, Jon A. Lind, Hebert W. Pereyra, Xun Xue