Hierarchy
⤷ CRM (Application Component) Customer Relationship Management
⤷ CRM_APPLICATION (Package) All CRM Components Without Special Structure Packages
⤷ WPOS (Package) IS-R: POS interface
Basic Data
Data Element | WJDFILSGRPSIZE |
Short Description | POS Outbound: Number of Stores per Parallel Task |
Data Type
Category of Dictionary Type | D | Domain |
Type of Object Referenced | No Information | |
Domain / Name of Reference Type | WJDFILSGRPSIZE | |
Data Type | NUMC | Character string with only digits |
Length | 2 | |
Decimal Places | 0 | |
Output Length | 2 | |
Value Table |
Further Characteristics
Search Help: Name | ||
Search Help: Parameters | ||
Parameter ID | ||
Default Component name | ||
Change document | ||
No Input History | ||
Basic direction is set to LTR | ||
No BIDI Filtering |
Field Label
Length | Field Label | |
Short | 0 | |
Medium | 0 | |
Long | 0 | |
Heading | 0 |
Documentation
Definition
Number of stores in each parallel task.
In previous releases it was generally necessary, despite parallel processing, to plan several parallel jobs for the change message in POS outbound, because parallel processing was limited to IDoc creation for each store and the stores themselves were not processed in parallel. Each job therefore contained the processing for several stores.
By implementing a new parallel processing grade at store level, you no longer need to plan several jobs for each distribution chain. This is now done automatically. Now only one job for each distribution chain is required for the change message.
Use
This parameter controls how many stores are processed per job (according to manual dispatching). The more CPUs are available, the smaller you can set this value.
The rule of thumb is one parallel task per server and CPU available. You can display the number of CPUs that are available for each server using transaction ST06 (section CPU, subpoint Count). This will give you the maximum theoretical number of tasks available. The total number of stores to be processed divided by the number of tasks, gives the average number of stores to be processed per task.
First enter this value here. Then check the runtime of the program whilst gradually increasing this value until you find the optimum setting, that is, the shortest runtime.
Dependencies
Example
You have five available servers each with four CPUs and you have 500 stores in a distribution chain that need to be processed:
The average number of stores to be processed per task is therefore:
Number of stores per parallel task = 500 / (5 x 4) = 25.
Enter the value 25 here first and then gradually optimize it.
History
Last changed by/on | SAP | 20010607 |
SAP Release Created in | 46C |