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

IEEE 29th International Performance Computing and Communications Conference

作者： Guan, Qiang Fu, Song Univ N Texas Dept Comp Sci & Engn Denton TX 76203 USA

ISBN: (纸本)9781424493289

Networked computer systems continue to grow in scale and in the complexity of their components and interactions. Component failures become norms instead of exceptions in these environments. A failure will cause one or multiple computer(s) to be unavailable, which affects the resource utilization and system throughput. When a computer fails to function properly, health-related data are valuable for trouble shooting. However, it is challenging to effectively identify anomalies from the voluminous amount of noisy, high-dimensional data. In this paper, we present auto-AID, an autonomic mechanism for anomaly identification in networked computer systems. It is composed of a set of data mining techniques that facilitates automatic analysis of system health data. The identification results are very valuable for the system administrators to manage systems and schedule the available resources. We implement a prototype of auto-AID and evaluate it on a production institution wide compute grid. The results show that auto-AID can effectively identify anomalies with little human intervention.

关键词： Anomaly identification Data mining System dependability parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

N-Level Diskless Checkpointing

<i>N</i>-Level Diskless Checkpointing

引用

11th IEEE International Conference on High Performance Computing and Communications

作者： Hakkarinen, Doug Chen, Zizhong Colorado Sch Mines Dept Math & Comp Sci Golden CO 80401 USA

ISBN: (纸本)9781424446001

Diskless check-pointing is an efficient technique to tolerate a small number of processor failures in large parallel and distributed systems. In literature, a simultaneous failure of no more than N processors is often tolerated by using a one-level Reed-Solomon check-pointing scheme for N simultaneous processor failures, whose overhead often increases quickly as N increases. In this paper, we study an N-level diskless checkpointing scheme to reduce the overhead for tolerating a simultaneous failure of no more than N processors by layering the schemes for a simultaneous failure of i processors, where i = 1, 2, ... , N. Simulation results indicate the proposed N-level diskless checkpointing scheme achieves lower fault tolerance overhead than the one-level Reed-Solomon checkpointing scheme for N simultaneous processor failures.

关键词： checkpoint diskless checkpointing fault tolerance high performance computing parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

HuGraph: Acceleration of GCN Training on Heterogeneous FPGA Clusters with Quantization

HuGraph: Acceleration of GCN Training on Heterogeneous FPGA ...

引用

IEEE High Performance Extreme Computing Virtual Conference (HPEC)

作者： Zhao, Letian Wu, Qizhe Wang, Xiaotian Tian, Teng Wu, Wei Jin, Xi Univ Sci & Technol China State Key Lab Particle Detect & Elect Hefei Peoples R China Univ Sci & Technol China Inst Microelectron Dept Phys Hefei Peoples R China

ISBN: (数字)9781665497862

ISBN: (纸本)9781665497862

Graph convolutional networks (GCNs) have succeeded significantly in numerous fields, but the need for higher performance and energy efficiency training GCN on larger graphs continues unabated. At the same time, since reconfigurable accelerators have the ability to fine-grained custom computing modules and data movement, FPGAs can solve problems such as irregular memory access for GCN computing. Furthermore, to scale GCN computation, the use of heterogeneous FPGAs is inevitable due to the constant iteration of new FPGAs. In this paper, we propose a novel framework, HuGraph, which automatically maps GCN training on heterogeneous FPGA clusters. With HuGraph, FPGAs work in synchronous data parallelism using a simple ring 1D topology that is suitable for most off-the-shelf FPGA clusters. HuGraph uses three approaches to advance performance and energy efficiency. First, HuGraph applies full-process quantization for neighbor-sampling-based data parallel training, thereby reducing computation and memory consumption. Second, a novel balanced sampler is used to balance workloads among heterogeneous FPGAs so that FPGAs with fewer resources do not become bottlenecks in the cluster. Third, HuGraph schedules the execution order of GCN training to minimize time overhead. We implement a prototype on a single FPGA and evaluate cluster-level performance with a cycleaccurate simulator. Experiments show that HuGraph achieves up to 102.3 x , 4.62 x , and 11.1x speedup compared with the state-ofthe-art works on CPU, GPU, and FPGA platforms, respectively, with negligible accuracy loss.

关键词： Graph Convolutional Network Training Reconfigurable Computing parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

Improvement of Strong Migration Method to Manage Multithreaded Agents and Implementation of Mechanisms for Sharing Information of Agents in AgentSphere

Improvement of Strong Migration Method to Manage Multithread...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)

作者： Hasumi, Kenta Kai, Munenori Seikei Univ Grad Sch Sci & Technol Tokyo Japan

ISBN: (纸本)9781467377881

We the authors of this study use mobile agents with capability of strong migration to develop AgentSphere, a platform for an autonomous parallel and distributed processing system that significantly reduces loads of the complex execution control for its users. We have successfully executed the strong migration of agents on JVM by converting their source codes. However, there has been an issue that the overhead becomes larger accompanied by migration such as when saving or restoring the data in the stack area, or when migration to the resuming position occurs during the execution of the program. In order to improve this issue, a new mechanism for the strong migration using JavaFlow was built. We report that we also built the information sharing mechanism using a distributed hash table so both the user and the system can share information of each agent effectively.

关键词： parallel and distributed systems mobile agent strong migration autonomous system

来源：评论

学校读者我要写书评

暂无评论

A performance monitor based on virtual global time for clusters of PCs

A performance monitor based on virtual global time for clust...

引用

IEEE International Conference on Cluster Computing

作者： Taufer, M Stricker, T Univ Calif San Diego Dept CSE La Jolla CA 92093 USA

ISBN: (纸本)0769520669

Debugging the performance of parallel and distributed systems remains a difficult task despite the widespread use of middleware packages for automatic distribution, communication and tasking in clusters. In this paper we present a performance monitoring tool for clusters of PCs that is based on the simple concept of accounting for resource usage and on the simple idea of mapping all performance related state of hardware performance counters and operating system variables backwards to the application level. In this way a monitoring tool can explain the most relevant performance metrics at a higher level that is easily understood by the application developer The most important metric for distributed high performance applications remains the total execution time vs. the number of compute nodes involved, since it translates into the scalability of an application. As a detailed contribution of this paper we closely look into what is needed to reverse map the low level performance counters (it each node back through the middleware layer responsible for the parallelization and distribution. The specific problems encountered and dealt with are the creation of a flexible notion of global time for timestamping and the reassembling of performance data and an appropriate communication mechanism to minimize monitoring intrusion due to the additional networking traffic caused by the monitor. We show how our tool can be used to measure, explain and predict the performance and scalability of a distributed OLAP application running on clusters of PCs.

关键词： parallel and distributed systems real-time performance analysis and evaluation performance metrics monitoring traffic notion of time in distributed systems clusters of PCs

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Load Balancing Strategy with Adaptive Threshold Based Approach

A Dynamic Load Balancing Strategy with Adaptive Threshold Ba...

引用

2nd IEEE International Conference on parallel, distributed and Grid Computing (PDGC)

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

ISBN: (纸本)9781467329255

To meet the objective of mlnImlzmg the job execution time, parallel computing has to deal with a lot of issues which crop up while working with parallel code. These issues can result in bottleneck and restrict the behavior of parallel program in attaining an aforesaid speedup as suggested by Amdahl Gene. The most problematic issue that crops up is the distribution of workload in both the categories of parallel system viz. homogeneous and heterogeneous systems. This situation demands an effective load balancing strategy to be in place in order to ensure a uniform distribution of load across the board. The scheduling 'm' jobs to 'n' resources with the objective to optimize the QoS parameters while balancing the load has been proven to be NP-hard problem. Therefore, a heuristic approach can be used to design an effective load balancing strategy. In this paper, a centralized dynamic load balancing strategy using adaptive thresholds has been proposed for a parallel system consisting of multiprocessors. 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. Therefore, the scheduler always ensures a uniform distribution of the load on the processing elements with dynamic load environment.

关键词： parallel and distributed systems load balancing threshold turnaround time central scheduling

来源：评论

学校读者我要写书评

暂无评论

Realizing Global Synchronizations for Locally-Connected Two-Dimensional Rectangle Cellular Arrays

Realizing Global Synchronizations for Locally-Connected Two-...

引用

26th IEEE International Conference on Advanced Information Networking and Applications (AINA)

作者： Umeo, Hiroshi Osaka Electrocommun Univ Neyagawa Osaka 5728530 Japan

ISBN: (纸本)9780769546513

Synchronization of large-scale networks is an important and fundamental computing primitive in parallel and distributed systems. The synchronization in cellular automata has been known as firing squad synchronization problem (FSSP) since its development. The FSSP has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed so far. In the present paper, we give a survey on recent developments in FSSP algorithms for two-dimensional rectangle cellular automata. Several state-efficient new implementations of synchronization algorithms are also given.

关键词： parallel and distributed systems distributed processing cellular automaton FSSP firing squad synchronization problem parallel computing

来源：评论

学校读者我要写书评

暂无评论

On devising Boolean Routing schemes 21st

On devising Boolean Routing schemes

引用

21st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 95)

作者： Flammini, M Gambosi, G Salomone, S UNIV ROMA TOR VERGATA DIPARTIMENTO MATEMATI-00133 ROMEITALY UNIV AQUILA DIPARTIMENTO MATEMAT PURA & APPLICATAI-67010 LAQUILAITALY

ISBN: (纸本)3540606181

In this paper, the problem of routing messages along shortest paths in a network of processors without using complete routing tables is considered. The Boolean Routing model is considered and it is shown that it provides optimal representations of all shortest routes on some specific network topologies (such as paths, rings, trees, hypercubes, different types of d-dimensional grids, complete graphs and complete bipartite graphs). Moreover, it is also shown that the model deals efficiently with graphs resulting from applying some types of graph compositions, thus resulting in very efficient routing schemes for some classes of networks with regular topology. This is done by considering different significant cost measures of the space efficiency of the schemes considered.

关键词： parallel and distributed systems compact routing tables shortest paths representation

来源：评论

学校读者我要写书评

暂无评论

A Scalable Checkpoint Encoding Algorithm for Diskless Checkpointing

A Scalable Checkpoint Encoding Algorithm for Diskless Checkp...

引用

11th IEEE High Assurance systems Engineering Symposium

作者： Chen, Zizhong Dongarra, Jack Colorado Sch Mines Dept Math & Comp Sci Golden CO 80401 USA Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA

ISBN: (纸本)9780769534824

Diskless check-pointing is an efficient technique to save the state of a long running application in a distributed environment without relying on stable storage. In this paper, we introduce several scalable encoding strategies into diskless check-pointing and reduce the overhead to survive k failures in p processes from 2inverted right perpendicularlogpinverted left perpendicular.k((beta+2 gamma)m+alpha) to (1+O(1/root m)).k(beta+2 gamma)m, where a is the communication latency, 1/beta is the network bandwidth between processes, 1/gamma is the rate to perform calculations, and m is the size of local check-point per process. The introduced algorithm is scalable in the sense that the overhead to survive k failures in p processes does not increase as the number of processes p increases. We evaluate the performance overhead of the introduced algorithm by using a preconditioned conjugate gradient equation solver as an example. Experimental results demonstrate that the introduced techniques are highly scalable.

关键词： Checkpoint diskless checkpointing fault tolerance high performance computing parallel and distributed systems Reed-Solomon encoding

来源：评论

学校读者我要写书评

暂无评论

An incremental ant colony optimization based approach to task assignment to processors for multiprocessor scheduling

引用

Frontiers of Information Technology & Electronic Engineering 2017年第4期18卷 498-510页

作者： Hamid Reza BOVEIRI Sama Technical and Vocational Training College Islamic Azad University Shoushtar Branch Shoushtar Iran

Optimized task scheduling is one of the most important challenges to achieve high performance in multiprocessor environments such as parallel and distributed systems. Most introduced task-scheduling algorithms are based on the so-called list scheduling technique. The basic idea behind list scheduling is to prepare a sequence of nodes in the form of a list for scheduling by assigning them some priority measurements, and then repeatedly removing the node with the highest priority from the list and allocating it to the processor providing the earliest start time （EST）. Therefore, it can be inferred that the makespans obtained are dominated by two major factors：（1） which order of tasks should be selected （sequence subproblem）; （2） how the selected order should be assigned to the processors （assignment subproblem）. A number of good approaches for overcoming the task sequence dilemma have been proposed in the literature, while the task assignment problem has not been studied much. The results of this study prove that assigning tasks to the processors using the traditional EST method is not optimum; in addition, a novel approach based on the ant colony optimization algorithm is introduced, which can find far better solutions.

关键词： Ant colony optimization List scheduling Multiprocessor task graph scheduling parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：