Browse Prior Art Database

Parellel Processing Technique for Material Requirements Planning

IP.com Disclosure Number: IPCOM000110950D
Original Publication Date: 1994-Jan-01
Included in the Prior Art Database: 2005-Mar-26
Document File: 4 page(s) / 131K

Publishing Venue

IBM

Related People

Andoh, R: AUTHOR [+2]

Abstract

Disclosed is a system using a parallel processing technique for Material Requirements Planning (MRP). This is the method of realizing MRP calculation on a parallel process computer. MRP is one of the core systems in plant production management. On the assumption that there is no overhead in the control mechanism, no communication loss for parallel process and no biassed data, the MRP process time reduction will be inversely proportion to the number of parallel processes.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 49% of the total text.

Parellel Processing Technique for Material Requirements Planning

      Disclosed is a system using a parallel processing technique for
Material Requirements Planning (MRP).  This is the method of
realizing MRP calculation on a parallel process computer.  MRP is one
of the core systems in plant production management.  On the
assumption that there is no overhead in the control mechanism, no
communication loss for parallel process and no biassed data, the MRP
process time reduction will be inversely proportion to the number of
parallel processes.

      The system shown in Fig. 1  consists of one Main Control
Process (MCP) and some Parallel Processes (PPs).  MCP consists of
"Parallel Process  Controller", "Activity List Manager", and
"Activity  Scheduler".  MCP supervises  PPs.  Every parallel process
executes  a "Requirements Calculation Task (RCT)" sequentially.  MCP
schedules the RCT's execution sequence.  The RCT is the basic unit of
parallel processing.

      The following section explains that the Parallel Calculation
Model is the basis of parallel processing  and  describes its
configuration elements.  RCT is the basic calculation unit for the
paralleled MRP calculation process.  RCT is a series of simple
calculation algorithms, and every PP executes this same RCT program.

      The application character decides the RCT's program size.
Generally, the  parallel process model hypothesizes that every PP
executes its program step by step concurrently.  But, the program
size of PP in this problem is comparatively larger than typical
parallel processing problems.  Consequently, we can adopt a parallel
process model in which every Parallel Process acts non-synchronously.
In this problem, we are able to adopt the Distributed Memory Type and
Multiple Instruction stream/Multiple Data stream (MIMD).  Type model
as the basis of the parallel calculation model.  In this case, the
Distributed Memory Type parallel computer allows every Paralleled
Process to act non-synchronously.  This parallel calculation model
corresponds to the Message Passing Type parallel computer.  On the
assumption of this parallel calculation model, the rest of this
article explains how to communicate and synchronize each Parallel
Process.

      The Parallel Process Manager controls the synchronization of
Paralleled Processes, and gives an "RCT queue" to  each PP that
executes RCT.  The Activity List Manager maintains the Activity List,
and the Activity List controls the generation and deletion of the
basic calculation activities that are RCT.  The Activity List
consists of the list data structure built by LLC.  The Activity
Scheduler generates the RCT queue from Activity List.

The following process flow (Fig. 2) shows the detailed function and
configuration of the system:

1.  Initial routine reads Activity DB and generates Activity List.
    Set LLC=00 as the object of Activity Scheduler.

2.  Activity Scheduler generates R...