arrow
返回

Reducing null messages overhead through load balancing in conservative distributed simulation systems

delete2004-03-01
delete14
PRE
AI
A
Azzedine Boukerche *
S
Sajal K. Das
DOI:10.1016/j.jpdc.2001.03.001delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper studies the problem of load balancing for conservative distributed simulations for execution on a multicomputer architecture. The synchronization protocol makes use of Chandy-Misra null messages. We propose a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length which indicates the workload at each processor. We examine two variations of the algorithm-referred to as the centralized and multi-level hierarchical methods-and experiment with four simulation workload models to study the scalability Of our algorithm. The experiments indicate that our dynamic load balancing schemes significantly reduce the run time of an optimized version of Chandy-Misra null message approach, and decreases by 30-40% the synchronization overhead when compared to the use of a static partitioning algorithm. The results also indicate that the hierarchical version outperforms both the centralized version of the dynamic load balancing algorithm and the static partitioning scheme. (C) 2003 Elsevier Inc. All rights reserved.
Keyword:
large-scale distributed systems
conservative simulation
dynamic load balancing
partitioning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Journal of Parallel and Distributed Computing 封面图
Journal of Parallel and Distributed Computing
IF:
4
论文数:
3.8K
被引数:
4.8K

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err
IF0
err
err0
errOAAI
err
err分享
err收藏
学者 查看更多内容