Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Palgrave Macmillan Journals and Operational Research Society are collaborating with JSTOR to digitize,
preserve and extend access to The Journal of the Operational Research Society.
http://www.jstor.org
Parallel
discrete
event
manufacturing
supply
simulation
chains
algorithm
for
Introduction
Parallel discrete event simulation (PDES) has received
attention in many applications with large, complex systems,
for example, telecommunications. However, its use in
manufacturing has been limited.' Early studies (eg, reference2) of distributed execution used fine-grained decomposition to map system entities (eg, machines, transportation
devices) on to different processors. Later work also
considered system architectures with loosely coupled submodels,3 in which the relative independence of the processes
reduces communication overhead and makes them particularly suitable for efficient PDES. Much of the research on
parallel and distributed simulation has for many years
concentrated on algorithms for parallel processing, but more
recent studies also include work on web-based cooperative
model development4 and shared processing,5 decomposition
methods for large-scale models based on Discrete Event
Specification (DEVS) formalism,6 and results from the
implementation of parallel processing of a fine-grained
virtual factory model.7
Manufacturing supply chains are usually large, complex
systems consisting of semi-autonomous cells, factories, etc
that are interconnected by material and information flow.
They are asynchronous in nature and, hence, the use of a
global clock for the simulation to proceed in a lock-step
manner is inefficient. Modular development and distributed
processing of the models of the constituent units have the
potential to make the modelling process more manageable
*Correspondence:R Roy, WarwickManufacturingGroup, International
ManufacturingCentre, Universityof Warwick,CoventryCV4 7AL, UK.
E-mail:R.Roy@warwick.ac.uk
PDES algorithms
The physical system in PDES is viewed as a number of
interacting physical processes (PPs) and is modelled by
constructing a simulator consisting of Logical Processes
(LPs), one for every PP. Interactions between PPs are
modelled by corresponding LPs sending and receiving
timestamped messages. Simulation proceeds by each LP
processing the events in its input queue in timestamp order.
A causality error, however, can occur if an LP finds a
message in its queue with a timestamp less than its own clock
value.
In the conservative approach,9"1 a clock is associated with
each incoming link of an LP, which is set to the timestamp of
623
eventsimulation
discrete
RRoyandRArunachalam-Parallel
algorithm
Table1
Comparisonof conservativeversusoptimisticschemes
Conservative
Optimistic
Parallelism
Limitedby worst-casescenario
Not limited
Performance
Can exhibit'thrashing'behaviour;significant
overheadof memorymanagement
Simulationexecutive
Simpleto develop
Complex;harderto verifyrobustness
Model development
624 Journal
oftheOperational
Research
Vol.55, No.6
Society
Proposed algorithm
A modifiedalgorithmis proposedherebasedon the assumed
featureof a manufacturingsupplychain that externalevents
(eg shipments)are typicallybatchedtogetherfor action. The
use of weekly MRP planningbucketsis an extremeexample
in relation to order processing. Even in a lean production
environment,the consequencesare not as instantaneousor
rapidwhen comparedto that of internaleventsand, as such,
at least for the purposes of modelling, the external events
could be batched with little or no loss of integrityin the
analysis of supply chains. A rollback then needs to occur
only when the timestampof a message receivedis less than
the simulationclock at which the LP began to process the
last batch of externalmessages;any furtherrollbackswould
be wasted.
In Time Warp,the input and output queuesarepart of the
simulator.A modifiedLP architectureis proposedhere with
the aim of avoidingwasted rollbacks(Figure 1). It has three
functional units: message controller, simulator, and statesavingmechanism.The simulatorand the messagecontroller
share a client-server relationship. The message controller
incorporates the input and output queues and acts as a
message serverto the simulator,which performsthe actual
simulationof the PP. At appropriateintervals,the simulator
requests messages from the message controller, which
Wait until
(P1)
request by
simulator
send all messages messg in input queue that satisfies
tqueueclk[i]<messg.t ? sim.t; where tqueueclk[i] = last entry in
queue clock list tqueueclk, messg.t = timestampof message,
sim.t = clock time of simulator
tqueueclk[i + 1] = sim.t
Requestinputmessage
Message controller
Input queue
Messagefrominputqueue
Simulator
Outputqueue
Message to output queue
Save state
Load state
625
eventsimulation
discrete
RRoyandRArunachalam-Parallel
algorithm
(P2)
(P3)
}
When rollback requiredas a result of (normal or control)
(P4)
message m
{
find the last value of i such that
is the queue clocklist
tqueueclk[ij] <m.ts; wheretqueueclk
rollback to t = tqueueclk[i]
rbc + +,; incrementrollback count rbc of LP by one
broadcast rollback control message (t,rbc) on all output links;
t = timestampof control message
}
Proof of correctness
Consider a true representationPS of a physical system
composed of N processes that communicate exclusively
through message passing. PS is representedby a directed
graph consisting of N vertices {P1, P2, ... ,PN}, each of which
ok(j)=
Iok + Ok +
...
+ Ijk
Gk(Skj-1,
j-1,
626 Journal
oftheOperational
Research
Vol.55, No.6
Society
t0<t<tj,
are
(CO1)
presentin the history.
2. A control message with a lower timestampvalue and a
higherrollbackcount than any normalmessagedoes not
exist.
(C02)
3. If an invalidmessagem to anotherLP exists in ok(j) with
timestamp tm and rollback count r,,, then a control
message c to it also exists in ok(j) with timestamp tc
tc~ ti,
and
(CO3)
rc> rm.
-k
RRoyandRArunachalam-Parallel
discrete
eventsimulation
algorithm627
628 Journal
oftheOperational
Research
Vol.55, No.6
Society
Conclusion
A manufacturingsupply chain is typicallya loosely coupled
system, which makes it particularly suitable for parallel
processing.23The use of a conservativealgorithmfor such a
systemis expectedto lead to significantblockages,but there
are also concerns related to performance in applying
optimisticschemesto largemodels.However,rationalization
of the model by introducingbatch processingof messagesat
discreteintervalsallows a clear definitionof rollbackpoints
and the standardversion of the Time Warp algorithmto be
modified to address three key issues-reduce rollbacks,
control the extent of message passing requiredto undo the
effect of invalid operations, and make the state-saving
mechanismmore efficient.The proposedalgorithmdoes this
without, in the terminology of Reynolds,24affecting the
'aggressiveness'and 'risk' inherentin Time Warp.
Most physical systems exhibit a delay in processing
messages. Hence, the requirementfor their batching is in
itself not very restrictive. However, the efficiency of the
algorithmand, hence the benefit, will depend on the batch
frequency. What is an appropriate interval is clearly
dependenton the system environmentand will be a tradeoff decision between computing performance and model
integrity,but the processingof messagesonly a few times in
a simulatedday would be typicallyconsideredsufficientfor
manufacturingsupply chains. The times when this is done
could be parametersdefinedby the modellersand, since they
need not be the same for each LP, set at the local level,which
is particularly useful for modelling of supply chains
operatingin differenttime zones. This is the only decision
related to the algorithm that needs to be taken by the
modeller.The transparencyof the algorithmis an important
featuresince the level of sophisticationneededon the part of
the modellerto exploit the technologysuccessfullyhas often
been cited as a reason for the limited use of PDES by the
generalsimulationcommunity.21'25
Batch processing,however,does not allow for immediate
handlingof urgentorders.Since even in such cases thereis a
processing delay, any loss of model integrity may not be
significantif the batchingintervalis not too infrequent,but a
References
1 Peng C and Chen FF (1996). Paralleldiscreteevent simulation
of manufacturing
systems:a technologysurvey.Comput
IndEng
31: 327-330.
2 HonKKBandIsmailHS (1991).Application
of transputers
for
simulationof manufacturing
systems-a preliminarystudy.
ACM33:30-53.
RRoyandRArunachalam-Parallel
discrete
eventsimulation
629
algorithm
Received February2003;
November
2003 after one revision
accepted