Dartmouth College Computer Science
Technical Report series
TR search TR listserv
|By author:||A B C D E F G H I J K L M N O P Q R S T U V W X Y Z|
|By number:||2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986|
With fixed lookahead information in a simulation model, the overhead
of asynchronous conservative parallel simulation lies in the mechanism
used for propagating time updates in order for logical processes to
safely advance their local simulation clocks. Studies have shown that
a good scheduling algorithm should preferentially schedule processes
containing events on the critical path. This paper introduces a
lock-free algorithm for scheduling logical processes in conservative
parallel discrete-event simulation on shared-memory multiprocessor
machines. The algorithm uses fetch\&add operations that help avoid
inefficiencies associated with using locks. The lock-free algorithm is
robust. Experiments show that, compared with the scheduling algorithm
using locks, the lock-free algorithm exhibits better performance when
the number of logical processes assigned to each processor is small or
when the workload becomes significant. In models with large number of
logical processes, our algorithm shows only modest increase in
execution time due to the overhead in the algorithm for extra
A revision of this report appears on PADS 2001.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Xiaowen Liu, David M. Nicol, and King Tan, "Lock-free Scheduling of Logical Processes in Parallel Simulation." Dartmouth Computer Science Technical Report TR2001-385, January 2001.
Notify me about new tech reports.
Search the technical reports.
To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Technical reports collection maintained by David Kotz.