检索结果-内蒙古大学图书馆

6th Euromicro Workshop on parallel and distributed Processing (PDP 98)

作者： Hofmann, R Hilgers, U Univ Erlangen Nurnberg IMMD 7 D-90158 Erlangen Germany

ISBN: (纸本)0818683325

This article presents a method and a tool for estimating a global time base from local event traces. These event traces result from monitoring parallel and distributed systems of arbitrary topology, where the processors are working on a common application, The method relies on stability properties of physical clocks and on the causality relationships of cooperating processes. The tool copes with arbitrary communication structures, event trace formats, and any number of different clocks.

关键词： monitoring estimating global time parallel and distributed system monitoring tool

来源：评论

学校读者我要写书评

暂无评论

TeGraph plus : Scalable Temporal Graph Processing Enabling Flexible Edge Modifications

引用

IEEE TRANSACTIONS ON parallel and distributed systemS 2024年第8期35卷 1469-1487页

作者： Huan, Chengying Liu, Yongchao Zhang, Heng Liu, Hang Chen, Shiyang Song, Shuaiwen Leon Wu, Yanjun Chinese Acad Sci Inst Software Beijing 100045 Peoples R China Rutgers State Univ New Brunswick NJ 08901 USA Tsinghua Univ Beijing 100190 Peoples R China Ant Grp Hangzhou 310058 Peoples R China Univ Sydney Camperdown NSW 2050 Australia

Temporal graphs are widely used for time-critical applications, which enable the extraction of graph structural information with temporal features but cannot be efficiently supported by static graph computing systems. However, the current state-of-the-art solutions for temporal graph problems are not only ad-hoc and suboptimal, but they also exhibit poor scalability, particularly in terms of their inability to scale to evolving graphs with flexible edge modifications (including insertions and deletions) and diverse execution environments. In this article, we present two key observations. First, temporal path problems can be characterized as topological-optimum problems, which can be efficiently resolved using a universal single-scan execution model. Second, data redundancy in transformed temporal graphs can be mitigated by merging superfluous vertices. Building upon these fundamental insights, we propose TeGraph+, a versatile temporal graph computing engine that makes the following contributions: (1) a unified optimization strategy and execution model for temporal graph problems;(2) a novel graph transformation model with graph redundancy reduction strategy;(3) a spanning tree decomposition (STD) based distributed execution model which uses an efficient transformed graph decomposition strategy to partition the transformed graph into different spanning trees for distributed execution;(4) an efficient mixed imperative and lazy graph update strategy that offers support for evolving graphs with flexible edge modifications;(5) a general system framework with user-friendly APIs and the support of various execution environments, including in-memory, out-of-core, and distributed execution environments. Our extensive evaluation reveals that TeGraph+ can achieve up to 241x speedups over the state-of-the-art counterparts.

关键词： Time factors Computational modeling Scalability Engines Bandwidth Heuristic algorithms Data models Graph algorithm temporal graphs parallel and distributed system

来源：评论

学校读者我要写书评

暂无评论

An adaptive threshold based hybrid load balancing scheme with sender and receiver initiated approach using random information exchange

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2016年第9期28卷 2729-2746页

作者： Alam, Taj Raza, Zahid Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi 110067 India

The primary objective of load balancing for distributed systems is to minimize the job execution time while maximizing the resource utilization. Load balancing on decentralized systems need effective information exchange policy so that with minimum amount of communication the nodes have up to date information about other nodes in the system. Periodic, event-based and on-demand information exchange are some important policies used for the same. All these approaches involve a lot of overhead and even sometime leading toward obsolete data with the nodes if there is a delay in the updation. This work presents an adaptive threshold-based hybrid load balancing scheme with sender and receiver initiated approach (HLBWSR) using random information exchange (RIE). RIE ensures that the information is exchanged in such a way that each node in the system has up-to-date state of the other nodes with much reduced communication overhead. Further, the adaptive threshold ensures that almost an average numbers of jobs are executed by all the nodes in the system. The study of the effect of the use of RIE on sender initiated, receiver initiated and hybrid of sender and receiver initiated load balancing approach establishes the superior performance of HLBWSR among its RIE-based peers. A comparative analysis of HLBWSR, with periodic information exchange strategy, modified estimated load information scheduling algorithm and load balancing on arrival reveals its effectiveness under various test conditions. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： parallel and distributed system load balancing information policy hybrid load balancing resource utilization

来源：评论

学校读者我要写书评

暂无评论

Reliability measure of the n-th cartesian product of complete graph K4 on h-extra edge-connectivity

引用

THEORETICAL COMPUTER SCIENCE 2022年 922卷 46-60页

作者： Tian, Zhaoxia Zhang, Mingzu Feng, Xing Xinjiang Univ Coll Math & Syst Sci Urumqi 830046 Peoples R China Jiangxi Univ Sci & Technol Fac Sci Ganzhou 341000 Peoples R China

As a measurement parameter of the reliability about interconnection networks of parallel and distributed systems, the h-extra edge-connectivity lambda(h)(G) is a better alternative compared with the classical Menger's theorem of the edge-connectivity. Recently, Li and Yang (2013) [7] determined the values of the h- extra edge-connectivity of hypercube Q(n) for each h <= 2(left perpendicularn/2right perpendicular). Because of easy scalability, the interconnection networks based on cartesianproduct operation are extensively investigated. This paper focuses on the h-extra edge-connectivity of the n-th cartesian product of complete graph K-4 with exponentially many faulty links. For a sufficiently large positive integer n, about 60 percent of positive integers hin the interval 1 <= h <= 2 . 4(n-1) corresponding h-extra edge-connectivity of K-4(n), lambda(h)(K-4(n)), presents a concentration phenomenon, that is, these exact values of lambda(h)(K-4(n)) concentrate on 3 . 4(n-1) and 4(n) for each inverted right perpendicular3 . 4n(-1)/5inverted left perpendicular <= h <= 4(n-1) and inverted right perpendicular6 . 4(n-1)/5inverted left perpendicular <= h <= 2 . 4(n-1), respectively. And the lower and upper bounds of hare sharp. Furthermore, the values of lambda(h)(K-2(n)) also have this phenomenon. We obtain lambda(h)(K-4(n)) = 3/2 lambda(h)(K-n2(2)) = 3 . 4(n-1) or lambda(h)( K-4(n)) = 2 lambda(h)(K-n2(2)) = 4(n) in the subintervals where the concentration phenomenon occurs simultaneously. (C) 2022 Elsevier B.V. All rights reserved.

关键词： h-extra edge-connectivity Concentration phenomenon Reliability and fault tolerance parallel and distributed system Cartesian product lambda(h)-optimality

来源：评论

学校读者我要写书评

暂无评论

The Argus prototype: aggregate use of load modules as a high-density supercomputer

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2006年第15期18卷 1975-1987页

作者： Feng, Xizhou Ge, Rong Cameron, Kirk W. Virginia Polytech Inst & State Univ Dept Comp Sci Blacksburg VA 24061 USA Univ S Carolina Dept Comp Sci & Engn Columbia SC 29208 USA

This paper describes the ARGUS prototype, a high-density, low-power supercomputer built from an IXIA network analyzer chassis and load modules. The prototype is configured as a diskless distributed system that is scalable to 128 processors in a single 9U chassis. The entire system has a footprint of 0.25 m(2) (2.5 ft(2)), a volume of 0.09 m(3) (3.3 ft(3)) and maximum power consumption of less than 2200 W. We compare and contrast the characteristics of ARGUS against various machines including our on-site 32-node Beowulf and LANL's Green Destiny. Our results show that the computing density (Gflops ft(-3)) of ARGUS is about 30 times higher than that of the Beowulf and about three times higher than that of Green Destiny with a comparable performance. Copyright (c) 2006 John Wiley & Sons, Ltd.

关键词： performance evaluation high-density computing cluster system parallel and distributed system parallel computer architecture

来源：评论

学校读者我要写书评

暂无评论

Modeling and evaluating design alternatives for an on-line instrumentation system: A case study

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1998年第6期24卷 451-470页

作者： Waheed, A Rover, DT Hollingsworth, JK NASA Ames Res Ctr MRJ Technol Solut Moffett Field CA 94035 USA Michigan State Univ Dept Elect Engn E Lansing MI 48824 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA

This paper demonstrates the use of a model-based evaluation approach for instrumentation systems (ISs). The overall objective of this study is to provide early feedback to tool developers regarding IS overhead and performance;such feedback helps developers make appropriate design decisions about alternative system configurations and task scheduling policies. We consider three types of system architectures: network of workstations (NOW), symmetric multiprocessors (SMP), and massively parallel processing (MPP) systems. We develop a Resource OCCupancy (ROCC) model for an on-line IS for an existing tool and parameterize it for an IBM SP-2 platform. This model is simulated to answer several 'what if' questions regarding two policies to schedule instrumentation data forwarding: collect-and-forward (CF) and batch-and-forward (BF). In addition, this study investigates two alternatives for forwarding the instrumentation data: direct and binary tree forwarding for an MPP system. Simulation results indicate that the BF policy can significantly reduce the overhead and that the tree forwarding configuration exhibits desirable scalability characteristics for MPP systems. Initial measurement-based testing results indicate more than 60 percent reduction in the direct IS overhead when the BF policy was added to Paradyn parallel performance measurement tool.

关键词： instrumentation system resource occupancy model workload characterization parallel tools parallel and distributed system monitoring intrusion

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Load Balancing Strategy with Adaptive Thresholds (DLBAT) for parallel Computing system

引用

INTERNATIONAL JOURNAL OF distributed systemS AND TECHNOLOGIES 2014年第1期5卷 54-69页

作者： Alam, Taj Raza, Zahid Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi India

The primary objective of scheduling is to minimize the job execution time and maximize the resource utilization. Scheduling of 'm' jobs to 'n' resources with the objective to optimize the QoS parameters has been proven to be NP-hard problem. Two broad approaches that are defined for dealing with NP-hard problems are approximate and heuristic approach. In this paper, a centralized dynamic load balancing strategy using adaptive thresholds has been proposed for a multiprocessors system. The scheduler continuously monitors the load on the system and takes corrective measures as the load changes. The threshold values considered are adaptive in nature and are readjusted to suite the changing load on the system according to the mean of the available load. Effectively, the load is leveraged towards the mean, transferring only the appropriate number of jobs from heavily loaded nodes to lightly loaded nodes. In addition, the threshold values are designed in such a way that the scheduler avoids excessive load balancing. Therefore, the scheduler always ensures a uniform distribution of the load on the processing elements with dynamic load environment. Simulation study reveals the effectiveness of the model under various conditions.

关键词： Centralized Scheduling Load Balancing parallel and distributed system Threshold Turnaround Time

来源：评论

学校读者我要写书评

暂无评论

Hamiltonian Cycle within Extended OTIS-Arrangement Network

Hamiltonian Cycle within Extended OTIS-Arrangement Network

引用

International Conference on Technological Advances in Electrical, Electronics and Computer Engineering (TAEECE)

作者： Ahmad, Awwad Univ Petra Fac IT CS Dept Amman Jordan

ISBN: (纸本)9781467356138;9781467356121

In this paper we propose "the construction of a Hamiltonian cycle in" the Extended OTIS-Arrangement network. The Extended-OTIS-Arrangement network "has many attractive topological properties Including regular degree, semantic structure, low diameter, and ability to embed graphs and cycles". "As constructing a Hamiltonian cycle" is one of the important advantages for any topology due to the importance of broadcast messages between different nodes. The "main contribution of this paper is to propose" the Hamiltonian Cycle algorithm which will make the paper more realistic as realistic candidate for HSPC topology. Throughout the paper we present an algorithm which constructs "a Hamiltonian cycle in the extended" OTIS-Arrangement interconnection network. Besides highlighting "on the topological properties of the extended OTIS" Arrangement we have introduced detailed examples to show how a Hamiltonian cycle is constructed.

关键词： parallel and distributed system Interconnection Networks Extended OTIS-Arrangement Topological Propertie Routing Algorithm Hamiltonian Circuit

来源：评论

学校读者我要写书评

暂无评论

Load Balancing with Random Information Exchanged based Policy

Load Balancing with Random Information Exchanged based Polic...

引用

4th IEEE International Advance Computing Conference (IACC)

作者： Alam, Taj Raza, Zahid Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi 110067 India

ISBN: (纸本)9781479925711

The primary objective of load balancing is to minimize the job execution time and maximize resource utilization. The load balancing algorithms for parallel computing system must adhere to three inherent policies;viz. information policy, transfer policy and placement policy. To better utilize the system resources this work proposes a load balancing strategy with information exchange policy based on random walk of packets for system with decentralized nature. Information is exchanged via random packets so that each node in a system has up-to-date states of the others nodes.

关键词： parallel and distributed system load balancing information exchange resource utilization

来源：评论

学校读者我要写书评

暂无评论

distributed Multi-objective Particle Swarm Optimization using Time-delayed Virtual Global Best Method 11th

Distributed Multi-objective Particle Swarm Optimization usin...

引用

11th International Joint Conference on Computational Intelligence (IJCCI)

作者： Sato, Yuji Ueno, Shota Hirotsu, Toshio Hosei Univ Dept Comp & Informat Sci Tokyo Japan

ISBN: (纸本)9789897583841

To reduce the computational cost of particle swarm optimization (PSO) methods, research has begun on the use of Graphics Processing Units (GPUs) to achieve faster processing speeds. However, since PSO methods search based on a global best value, they are hampered by the frequent need for communication with global memory. Even using a standard PSO that uses a local best value does not solve this problem. In this paper, we propose a virtual global best method that speeds up computations by defining a time-delayed global best as a virtual global best in order to reduce the frequency of communication with low-speed global memory. We also propose a method that combines decomposition-based multi-objective PSO (MOPSO/D) with a virtual global best method to speed up multi-objective particle swarm optimization by running it in parallel while maintaining search accuracy, and we demonstrate the effectiveness of this approach by using a number of unimodal/multimodal single objective benchmark test functions and three classical benchmark test functions with two objectives.

关键词： Particle Swarm Optimization parallel and distributed system Performance Improvement Multi-objective Optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：