Efficient event scheduling and synchronization
constitutes an essential part of high-performance parallel
discrete event simulation. Traditional synchronization approaches
like conservative and optimistic synchronization
focus on a simple scheduling paradigm based on a primitive
set of rules. However, we argue that a sophisticated
synchronization algorithm considering
can remarkably improve the performance of the simulation.
In this article, we discuss three different
which analyze those dependencies online and speed up
the simulation by a factor of up to 6.5. Further, we analyze
the ability of this paradigm to automatically detect available
parallelism by applying it to scenarios featuring different
degrees of available parallelism.
PIK is the professional journal for the use of information systems dealing with topics related to information processing and communications techniques. The only German-language journal covers the increasingly important fields of super computers, parallel computers and high-output-workstations. PIK addresses the practitioner and decisions-maker in business, science and industry.