uu.seUppsala University Publications
Change search
Refine search result
1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Bauer, Pavol
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
    Lindén, Jonatan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Engblom, Stefan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Efficient inter-process synchronization for parallel discrete event simulation on multicores2015In: Proc. 3rd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, New York: ACM Press, 2015, p. 183-194Conference paper (Refereed)
  • 2.
    Lindén, Jonatan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Computer Systems. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Synchronization Techniques in Parallel Discrete Event Simulation2018Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the performance of large-scale discrete event simulations, several techniques to parallelize discrete event simulation have been developed.

    In parallel discrete event simulation, the work of a single discrete event simulation is distributed over multiple processing elements. A key challenge in parallel discrete event simulation is to ensure that causally dependent events are processed in the correct order, so that the same simulation trajectory is produced as in a sequential simulation. To preserve chronology between events processed in parallel, different synchronization protocols have been devised, each carrying a cost in performance.

    This thesis presents techniques for reducing synchronization costs in two approaches to parallel discrete event simulation, viz., optimistic space-parallel and share-everything parallel discrete event simulation.

    Firstly, we develop a concurrent priority queue, to be used as, e.g., a central event queue in the share-everything approach to parallel discrete event simulation. The priority queue is based on skiplists. It improves over previous queues by incurring fewer global synchronization operations, thereby inducing less contention and improving scalability.

    Secondly, we study how to improve the performance of optimistic parallel discrete event simulation by disseminating accurate estimates of timestamps of future events. We present techniques for obtaining the estimates in two different methods for simulation of spatial stochastic models. The estimates allow processing elements to determine when to pause simulation with high precision, thereby reducing the amount of performed useless work.

    Finally, we observe that in the applications that we have studied, the phenomena of interest are often non-homogeneous and migrate over time. Due to this, the work distribution tends to become unbalanced among the processing elements. A solution is to rebalance the work dynamically. We propose a fine-grained local dynamic load balancing algorithm for parallel discrete event simulation. The load balancing algorithm reduces the number of events arriving out-of-order, thereby reducing the amount of time spent on corrective actions.

    List of papers
    1. A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention
    Open this publication in new window or tab >>A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention
    2018 (English)Report (Other academic)
    Series
    Technical report / Department of Information Technology, Uppsala University, ISSN 1404-3203 ; 2018-003
    Keywords
    Concurrent Data Structures, Priority Queue, Lock-free, Non-blocking, Skiplist
    National Category
    Computer Sciences
    Identifiers
    urn:nbn:se:uu:diva-342233 (URN)
    Projects
    CoDeR-MPUPMARC
    Available from: 2018-02-19 Created: 2018-02-19 Last updated: 2018-04-06Bibliographically approved
    2. Efficient inter-process synchronization for parallel discrete event simulation on multicores
    Open this publication in new window or tab >>Efficient inter-process synchronization for parallel discrete event simulation on multicores
    2015 (English)In: Proc. 3rd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, New York: ACM Press, 2015, p. 183-194Conference paper, Published paper (Refereed)
    Place, publisher, year, edition, pages
    New York: ACM Press, 2015
    National Category
    Computer Sciences
    Identifiers
    urn:nbn:se:uu:diva-260199 (URN)10.1145/2769458.2769476 (DOI)978-1-4503-3583-6 (ISBN)
    Conference
    SIGSIM-PADS 2015
    Projects
    UPMARC
    Available from: 2015-06-10 Created: 2015-08-17 Last updated: 2018-11-12Bibliographically approved
    3. Exposing inter-process information for efficient PDES of spatial stochastic systems on multicores
    Open this publication in new window or tab >>Exposing inter-process information for efficient PDES of spatial stochastic systems on multicores
    2019 (English)In: ACM Transactions on Modeling and Computer Simulation, ISSN 1049-3301, E-ISSN 1558-1195, Vol. 29, no 2, p. 11:1-25, article id 11Article in journal (Refereed) Published
    National Category
    Computer Sciences
    Identifiers
    urn:nbn:se:uu:diva-342180 (URN)10.1145/3301500 (DOI)000468031300004 ()
    Projects
    UPMARC
    Available from: 2019-04-02 Created: 2018-02-19 Last updated: 2019-06-18Bibliographically approved
    4. Fine-grained local dynamic load balancing in PDES
    Open this publication in new window or tab >>Fine-grained local dynamic load balancing in PDES
    2018 (English)In: Proc. 6th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, New York: ACM Press, 2018, p. 201-212Conference paper, Published paper (Refereed)
    Place, publisher, year, edition, pages
    New York: ACM Press, 2018
    National Category
    Computer Sciences
    Identifiers
    urn:nbn:se:uu:diva-342174 (URN)10.1145/3200921.3200928 (DOI)000482913900025 ()978-1-4503-5092-1 (ISBN)
    Conference
    SIGSIM-PADS 2018
    Projects
    UPMARC
    Available from: 2018-05-14 Created: 2018-02-19 Last updated: 2019-10-21Bibliographically approved
  • 3.
    Lindén, Jonatan
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bauer, Pavol
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
    Engblom, Stefan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Exposing inter-process information for efficient parallel discrete event simulation of spatial stochastic systems2017In: Proc. 5th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, New York: ACM Press, 2017, p. 53-64Conference paper (Refereed)
  • 4.
    Lindén, Jonatan
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bauer, Pavol
    Engblom, Stefan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Exposing inter-process information for efficient PDES of spatial stochastic systems on multicores2019In: ACM Transactions on Modeling and Computer Simulation, ISSN 1049-3301, E-ISSN 1558-1195, Vol. 29, no 2, p. 11:1-25, article id 11Article in journal (Refereed)
  • 5.
    Lindén, Jonatan
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bauer, Pavol
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
    Engblom, Stefan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Fine-grained local dynamic load balancing in PDES2018In: Proc. 6th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, New York: ACM Press, 2018, p. 201-212Conference paper (Refereed)
  • 6.
    Lindén, Jonatan
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    A Skiplist-based Concurrent Priority Queue with Minimal Memory Contention2013In: OPODIS 2013: 17th International Conference On Principles Of DIstributed Systems / [ed] Roberto Baldoni, Nicolas Nisse, Maarten van Steen, Berlin: Springer Berlin/Heidelberg, 2013, p. 206-220Conference paper (Refereed)
    Abstract [en]

    Priority queues are fundamental to many multiprocessor  applications. Several priority queue algorithms based on skiplists  have been proposed, as skiplists allow concurrent accesses to  different parts of the data structure in a simple way. However, for  priority queues on multiprocessors, an inherent bottleneck is the  operation that deletes the minimal element. We present a  linearizable, lock-free, concurrent priority queue algorithm, based  on skiplists, which minimizes the contention for shared memory that  is caused by the DeleteMin operation. The main idea is to  minimize the number of global updates to shared memory that are  performed in one DeleteMin. In comparison with other  skiplist-based priority queue algorithms, our algorithm achieves a  30 - 80% improvement.

  • 7.
    Lindén, Jonatan
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention2018Report (Other academic)
  • 8.
    Pan, Xiaoyue
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Lindén, Jonatan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Predicting the Cost of Lock Contention in Parallel Applications on Multicores using Analytic Modeling2012In: Proc. 5th Swedish Workshop on Multi-Core Computing, 2012Conference paper (Other academic)
1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf