Show simple item record

Utilizing Global Simulation Information in Conservative Parallel Simulation on Shared Memory Multiprocessors

dc.contributor.authorLin J. M.en_US
dc.contributor.authorAbraham S. G.en_US
dc.date.accessioned2006-04-10T15:39:37Z
dc.date.available2006-04-10T15:39:37Z
dc.date.issued1993-08en_US
dc.identifier.citationLin J. M., , Abraham S. G., (1993/08)."Utilizing Global Simulation Information in Conservative Parallel Simulation on Shared Memory Multiprocessors." Journal of Parallel and Distributed Computing 18(4): 516-523. <http://hdl.handle.net/2027.42/30665>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6WKJ-45P662F-X/2/12eb608bc905a90b71bbfc4981ec0645en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/30665
dc.description.abstractGlobal simulation information is accessible on shared memory multiprocessors and can improve the efficiency of parallel simulation. However, most existing concurrent simulators do not aggressively exploit this information. In this paper, we propose a Directly Accessing Information (DAI) scheme, a conservative simulation scheme that collects useful global simulation information in shared memory systems to reduce non-essential blocking and resolve local deadlocks. A parallel queueing network simulator was constructed on a Sequent Symmetry multiprocessor. Special implementation techniques were used to eliminate locking mechanisms for accessing global simulation information. Also, search pruning techniques were developed to reduce the amount of global simulation information used to unblock Logical Processes (LPs). Experimental results demonstrate that the DAI scheme achieves good speedups and substantially outperforms conventional conservative schemes in a reasonably large problem domain where message densities are larger than approximately 0.75.en_US
dc.format.extent617644 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleUtilizing Global Simulation Information in Conservative Parallel Simulation on Shared Memory Multiprocessorsen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelPhilosophyen_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelHumanitiesen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDept. of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA.en_US
dc.contributor.affiliationumDept. of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA.en_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/30665/1/0000308.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1006/jpdc.1993.1082en_US
dc.identifier.sourceJournal of Parallel and Distributed Computingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.