Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Reducing bottleneck of stock allocation by splitting record into multiple records having appropriate quantities

IP.com Disclosure Number: IPCOM000016326D
Original Publication Date: 2002-Oct-04
Included in the Prior Art Database: 2003-Jun-21
Document File: 3 page(s) / 101K

Publishing Venue

IBM

Abstract

Disclosed is a method for reducing bottleneck in application systems which maintain a record for some kind of amount.(ex. an order allocation system) The main idea is to split a record into multiple records in order to have each record have a smaller amount than original one and keep total amount same as original one. By doing this, record lock scope for an allocation process becomes smaller and multiple allocation processes become to be able to run simultaneously. Fig.1 shows the problem this invention intends to solve. There are five "Allocation Modules[1],[2],[3],[4],[5]" running simultaneously but only one "Allocation Module[1]" is able to get exclusive lock and update the record. Other four "Allocation Modules[2],[3],[4],[5]" must be waiting until the first "Allocation Module[1]" releases the lock for the record, even if each "Allocation Modules[1],[2],[3],[4],[5]" needs to allocate only a few amount far below the total amount 1000. [1]

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 55% of the total text.

Page 1 of 3

  Reducing bottleneck of stock allocation by splitting record into multiple records having appropriate quantities

Disclosed is a method for reducing bottleneck in application systems which maintain a record for some kind of amount.(ex. an order allocation system) The main idea is to split a record into multiple records in order to have each record have a smaller amount than original one and keep total amount same as original one. By doing this, record lock scope for an allocation process becomes smaller and multiple allocation processes become to be able to run simultaneously.

Fig.1 shows the problem this invention intends to solve. There are five "Allocation

Modules[1],[2],[3],[4],[5]" running simultaneously but only one "Allocation Module[1]" is able to get exclusive lock and update the record. Other four "Allocation Modules[2],[3],[4],[5]" must be waiting until the first "Allocation Module[1]" releases the lock for the record, even if each "Allocation Modules[1],[2],[3],[4],[5]" needs to allocate only a few amount far below the total amount 1000.

[1]

[2]

[3]

[4]

[5]

Allocation Module

 execute S Q L to lock and update the record

Bottleneck

Allocation Module

 execute S Q L to lock and update the record

P roduct N am e

Qty

Allocation Module

 execute S Q L to lock and update the record

product1

1000

Allocation Module

 execute S Q L to lock and update the record

Allocation Module

 execute S Q L to lock and update the record

Figure 1

Fig.2 shows the way to solve the problem mentioned above. First step is the step to split the original record[6] into multiple records[7] as each of which has appropriate amount. This step is done by "Split & Join Manager[8]". In this example, shown in Fig.2, the original record is split into five records and each of the split records has a value 200 as an amount. During this process "Split & Join Manager[8] refers "Split policy file[9]" to decide how to split the original record.

1

[This page contains 11 pictures or other non-text objects]

Page 2 of 3

Following are examples of elements written in "Split policy file[9]".

Number of records Amount assigned to each record(ex. average, specific amount for record by record, etc.)

       Minimum amount etc. In addition to splitting the original record, "Split & Join Manager[8]" creates instances of

"Allocation Agent[11],[12],[13],[14],[15]". Each of them is associate...