International Business Machines Corporation

Jos Manuel Accapadi

Andrew Dunshea

Dirk Michel

Mysore Sathyanarayana Srinivas

Mathew Accapadi

Agustin Mena, Iii

Mysore Sathyanaranyana Srinivas

Mark Elliott Hack

Kavitha Vittal Murthy Baratakke

Umesh Gopaldas Khatwani

James William Van Fleet

Linda Zimmer

Venkat Venkatsubra

Li Li

Nikhil Hegde

David Alan Hepkin

Grover Herbert Neuman

Greg Robert Mewhinney

Vandana Mallempati

Catherine Moriarty Nunez

Matthew Accapadi

Lynne Marie Weber

Anil Kalavakolanu

Brian W Hart

Diane Garza Flemming

Sujatha Kashyap

Herman Dietrich Dierks

Rashmi Narasimhan

Robert Scott Manning

Suzanne Shi

Patrick Harney

Gary L Nevling

Steven F Lang

William Lee Britton

Varun Sethi

Miho Ogishima

Described herein is a system and method for associating process priority with I/O queuing. The system can receive a first I/O request from a first process; store the first I/O request in an I/O queue; receive a second I/O request from a second process; store the second I/O request in the I/O queue; and sort the I/O queue based, at least in part, on a first priority of the first process and a second priority of the second process.

Associating process priority with I/O queuing

Input/output (I/O) requests generated by processes are typically stored in I/O queues. Because the queued I/O requests may not be associated with the processes that generated them, changing a process' priority may not affect the priority of the I/O requests generated by the process. Therefore, after the process' priority has been increased, it may be forced to wait for an I/O handler to service its I/O request, which may be stuck behind an I/O request generated by a lower priority process. Functionality can be implemented to associate the processes' priorities with the I/O requests generated by the processes. Also, reordering the queued I/O requests to reflect changes in the processes' priorities can ensure that the I/O requests from high priority processes are serviced before the I/O requests from low priority processes. This can ensure efficient processing and lower wait times for high priority processes.

A computer implemented method, data processing system, and computer program product for configuring a partition with needed system resources to enable an application to run and process in a secure environment. Upon receiving a command to create a short lived secure partition for a secure application, a short lived secure partition is created in the data processing system. This short lived secure partition is inaccessible by superusers or other applications. System resources comprising physical resources and virtual allocations of the physical resources are allocated to the short lived secure partition. Hardware and software components needed to run the secure application are loaded into the short lived secure partition.

Secure application partitioning enablement

An approach is provided to improve network efficiency. A send segment size, such as a maximum segment size (MSS), that corresponds to data segments being sent to a receiver over a computer network. A data block is identified in a send buffer and the data block includes more than one data segments. Based on the determined send segment size, all but a remaining data segment of the data segments are sent to the receiver. The sent data segments are each the determined send segment size and the remaining data segment is smaller than the send segment size. The remaining data segment is sent to the receiver in response to identifying that the remaining data segment is a portion of the data block.

Smart nagling in a TCP connection

A system and computer program product are provided for marking a file. Responsive to a file being received, the file is stored in a directory in a file system. An indicia is associated with the file and the directory. The file is displayed using the indicia as a marked file and the directory is displayed using the indicia as a marked directory.

File identification and retrieval in directories for categorized files

A computer program product for scheduling threads in a multiprocessor computer comprises computer program instructions configured to select a thread in a ready queue to be dispatched to a processor and determine whether an interrupt mask flag is set in a thread control block associated with the thread. If the interrupt mask flag is set in the thread control block associated with the thread, the computer program instructions are configured to select a processor, set a current processor priority register of the selected processor to least favored, and dispatch the thread from the ready queue to the selected processor.

Computer program product for scheduling ready threads in a multiprocessor computer based on an interrupt mask flag value associated with a thread and a current processor priority register value

An e-mail application calculates a dynamic estimate of an e-mail response time. A recipient address module, a status module, a processing module, and a presentation module interact to generate a first and a second estimated response time. The first estimated response time is determined from sender side data. The second estimated response time is generated using recipient mailbox status data after the e-mail is received by the recipient. The second estimated response time is used to dynamically update the estimated response time displayed to the sender.

E-mail response time estimation on compose or send

A computer implemented methods data processing system, and computer program product for configuring a partition with needed system resources to enable an application to run and process in a secure environment. Upon receiving a command to create a short lived secure partition for a secure application, a short lived secure partition is created in the data processing system. This short lived secure partition is inaccessible by superusers or other applications. System resources comprising physical resources and virtual allocations of the physical resources are allocated to the short lived secure partition. Hardware and software components needed to run the secure application are loaded into the short lived secure partition.

Methodology for secure application partitioning enablement

A mechanism is provided to determine an average rate of duplicate packets per connection for packets received by a node over an interface. The mechanism selects a connection from the connections established over the interface, determines that a rate of duplicate packets for the selected connection exceeds the average rate of duplicate packets by a threshold percentage, and sends a message to a transmitter of the duplicate packets over the connection to increase a timeout interval to retransmit packets.

Reducing retransmission of out of order packets

A mechanism is provided for automatically closing a file or a device. A service routine monitor monitors a request received from either an application that opened the file or a device driver that readied the device. The service routine monitor determines whether the file or the device has been accessed within a predetermined time interval. Responsive to the file or the device failing to be accessed within the predetermined time interval, the service routine monitor sends a call to the application that opened the file or the application or a higher level device driver that requested that the device driver ready the device. Responsive to a response from the application or the higher level device driver indicating that the use of the file or the device is no longer needed, the service routine monitor closes the file or quiesces the device.

Automatic closure of a file or a device in a data processing system

Disclosed is a computer implemented method and apparatus to secure a routing path. A local node receives a request for secure route identification from an upstream node. Responsive to receiving a request for secure route identification, the local node transmits a local node security level and an authentication key to the upstream node. The local node determines whether at least one downstream node is authentic and has sufficient security level from a second-level downstream node. The local node may then establish a socket to the upstream node.

Secure application routing

A system and program code are provided for marking a file. Responsive to a file being received, the file is stored in a directory in a file system. An indicia is associated with the file and the directory. The file is displayed using the indicia as a marked file and the directory is displayed using the indicia as a marked directory.

An approach is provided that reserves a software lock for a waiting thread is presented. When a software lock is released by a first thread, a second thread that is waiting for the same resource controlled by the software lock is woken up. In addition, a reservation to the software lock is established for the second thread. After the reservation is established, if the lock is available and requested by a thread other than the second thread, the requesting thread is denied, added to the wait queue, and put to sleep. In addition, the reservation is cleared. After the reservation has been cleared, the lock will be granted to the next thread to request the lock.

Optimized preemption and reservation of software locks for woken threads

Methods, systems, and computer program products are provided for scheduling threads in a multiprocessor computer. Embodiments include selecting a thread in a ready queue to be dispatched to a processor and determining whether an interrupt mask flag is set in a thread control block associated with the thread. If the interrupt mask flag is set in the thread control block associated with the thread, embodiments typically include selecting a processor, setting a current processor priority register of the selected processor to least favored, and dispatching the thread from the ready queue to the selected processor. In some embodiments, setting the current processor priority register of the selected processor to least favored is carried out by storing a value associated with the highest interrupt priority in the current processor priority register.

Scheduling threads in a multiprocessor computer

A system and method is provided for delaying a priority boost of an execution thread. When a thread prepares to enter a critical section of code, such as when the thread utilizes a shared system resource, a user mode accessible data area is updated indicating that the thread is in a critical section and, if the kernel receives a preemption event, the priority boost that the thread should receive. If the kernel receives a preemption event before the thread finishes the critical section, the kernel applies the priority boost on behalf of the thread. Often, the thread will finish the critical section without having to have its priority actually boosted. If the thread does receive an actual priority boost then, after the critical section is finished, the kernel resets the thread's priority to a normal level.

Growing community of inventors

Austin, TX, United States of America

Jos Manuel Accapadi