Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method of and system for the dynamic scheduling of requests to access a storage system

a storage system and dynamic scheduling technology, applied in the field of data processing systems, can solve the problems of loss of data, non-real-time data transfer in a timely manner, and affect non-real-time data transfer

Inactive Publication Date: 2002-08-27
LENOVO GLOBAL TECH INT LTD
View PDF3 Cites 46 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

It is yet another object of the present invention to provide a method and system in a data processing system for dynamically scheduling the processing of a plurality of requests that processes urgent real-time requests in a timely manner, while minimizing back-and-forth movement of the disk arm.

Problems solved by technology

Failure to transfer real-time data prior to the associated deadline will result in lost data.
Often, however, when both real-time and non-real-time data are supported simultaneously, real-time data is not transferred in a timely manner without adversely affecting non-real-time data transfer.
Thus, as real-time requests become urgent, the arm may tend to "jump around" servicing real-time requests on a most-urgent basis.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method of and system for the dynamic scheduling of requests to access a storage system
  • Method of and system for the dynamic scheduling of requests to access a storage system
  • Method of and system for the dynamic scheduling of requests to access a storage system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

A preferred embodiment of the present invention and its advantages are better understood by referring to FIGS. 1-5 of the drawings, like numerals being used for like and corresponding parts of the accompanying drawings.

The present invention defines two categories of real-time requests: hard real-time requests and soft real-time requests. These requests, along with non-real-time requests, are stored in a scan queue and processed sequentially in accordance with a SCAN or CSCAN algorithm until there is only enough time to process a selected number of requests before one of the real-time requests becomes urgent. The selected number of requests and the urgent request are then processed sequentially. The remaining requests are then processed sequentially from the location of the urgent real-time request.

All hard real-time requests are processed, even if they are past their associated deadlines. Soft real-time requests past their associated deadlines are discarded.

Real-time data may be cla...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A method and system in a data processing system for dynamically scheduling the processing of a plurality of requests to access a disk, in which each of the plurality of requests is associated with a location on the disk, processes the requests in a first sequential order and determines the amount of time necessary to process a selected number of requests associated with locations between the current location on the disk and the most urgent request. At a time that is earlier than the deadline for processing the most urgent request by the amount of time necessary to process the selected number of requests, the method commences processing of the selected number of requests in a second sequential order.

Description

1. Technical FieldThe present invention relates to data processing systems, and in particular to a method and system in a data processing system for dynamically scheduling a plurality of requests which include real-time and non-real-time requests.2. Description of the Related Art:Devices in a data processing system, such as disk drive adapters, are usually connected via a bus to transmit data from one device to and from other system resources, such as the central processor and memory. Each of these devices has data that it normally transfers. For example, one device may normally transfer real-time data such as is necessary to display a multimedia presentation. A second device may normally transfer non-real-time data that may be a file transfer. A third device may transfer both real-time and non-real-time data. The data transferred by these devices may be stored in a disk drive.Real-time data is data that has an associated deadline. The deadline defines the time by which the real-tim...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F12/00G06F3/06
CPCG06F3/0611G06F3/0659G06F3/0676
Inventor GENDUSO, THOMAS B.INGERMAN, DONALD
Owner LENOVO GLOBAL TECH INT LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products