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

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Gilchrist, Jeff Elytra Enterpises Inc. 5370 Canotek Road Ottawa K1J 9E6 Canada

A parallel implementation of the bzip2 block-sorting loss-less compression program is described. the performance of the parallel implementation is compared to the sequential bzip2 program running on various shared memory parallel architectures. the parallel bzip2 algorithm works by taking the blocks of input data and running them through the Burrows-Wheeler Transform (BWT) simultaneously on multiple processors using pthreads. the output of the algorithm is fully compatible with the sequential version of bzip2 which is in wide use today. the results show that a significant, near-linear speedup is achieved by using the parallel bzip2 program on systems with multiple processors. this will greatly reduce the time it takes to compress large amounts of data while remaining fully compatible with the sequential version of bzip2.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive AT² optimal algorithms on reconfigurable meshes

引用

parallel computing 2000年第11期26卷 1447-1458页

作者： Murshed, MM Brent, RP Australian Natl Univ Res Sch Informat Sci & Engn Comp Sci Lab Canberra ACT 0200 Australia Univ Oxford Comp Lab Oxford OX1 3QD England

Recently self-simulation algorithms have been developed to execute algorithms on a reconfigurable mesh (RM) of size smaller than recommended in those algorithms. Optimal slowdown, in self-simulation, has been achieved with the compromise that the resultant algorithms fail to remain AT(2) optimal. In this paper, we introduce, for the first time, the idea of adaptive algorithm which runs on RM of variable sizes without compromising the AT(2) optimality. We support our idea by developing adaptive algorithms for sorting items and computing the contour of maximal elements of a set of planar points on RM. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

关键词： parallel algorithm reconfigurable mesh AT(2) optimality self-simulation

来源：评论

学校读者我要写书评

暂无评论

distributed hierarchical task planning on a network of clusters

Distributed hierarchical task planning on a network of clust...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Kabanza, Froduald Lu, Shuyun Goodwin, Scott Computer Science University of Sherbrooke Sherbrooke Que. J1K 2R1 Canada Computer Science University of Windsor Windsor Ont. N9B 3P4 Canada

A wide range of planning applications are combinatorial in nature, making the design of general purpose planning algorithms a still very challenging endeavor. In order to cope with this combinatorial complexity, some of the most recent work in artificial intelligence (AI) planning focuses on the use of sophisticated heuristics, domain search control knowledge, random search and efficient abstract state space encodings such as binary decision diagrams. the additional performance needed by complex planning applications can be provided by adopting massively parallel computing systems, such as networks of clusters. this paper describes a simple, general approach for turning backtrack search based planners into more powerful distributed systems that run on networks of clusters. Our approach consists in distributing backtrack search points to different processes on the network. We illustrate its potential using DSHOP, a distributed version of the SHOP planner.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

Data format support for parallel numerical integration

Data format support for parallel numerical integration

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： El-Hajj, Wasim Li, Shujun Kaugars, K. De Doncker, E. Department of Computer Science Western Michigan University Kalamazoo MI 49008 United States

this paper presents a data format for the parallel numerical integration package PARINT using XML. As with many other numeric computation programs, PARINT accepts a long list of arguments for describing the user's problem, the algorithm to be used and for specifying parallel run characteristics. Supporting XML input allows platform-independent creation and manipulation of input specifications and simplifies the addition of new integration algorithms. We discuss the purpose of each section in the proposed XML data format, and describe how new sections can be added to the XML data structure in order to support new computing paradigms. We also explain how data are processed efficiently and give some application examples. the format can serve more generally for various software packages.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Communication optimization on broadcast-based clusters

Communication optimization on broadcast-based clusters

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Zhu, Ming Katsinis, Constantine Narravula, Harsha Cai, Wentong Lee, Bu-Sung Dept. of ECE Drexel University Philadelphia PA 19104 United States School of Computer Engineering Nanyang Technological University Singapore 639798

One implementation of broadcast-based networks is Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus). It is a low-latency, high-bandwidth, fiber-optic network that directly connects each processing node to all other nodes without contention. To better utilize the communication network and reduce the completion time of a parallel application, this paper describes the Key Message (KM) approach on SOME-Bus clusters. After presenting KM algorithm with SOME-Bus structure, an example is analyzed to evaluate its performance. the analysis result shows improved performance of communication of a parallel application over a system that does not use the KM approach.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Fast distributed Stochastic Gradient Descent for Big Data Classification 23

Fast Distributed Stochastic Gradient Descent for Big Data Cl...

引用

23rd IEEE international conference on High Performance computing and Communications, 7th IEEE international conference on Data Science and systems, 19th IEEE international conference on Smart City and 7th IEEE international conference on Dependability in Sensor, Cloud and Big Data systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Xiao, Mingfei Wang, Huihui School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

ISBN: (纸本)9781665494571

Large-scale classification is an important task of machine learning, especially in the smart city field, which is a big data environment. In recent years, single-threaded optimization algorithms can no longer meet the needs of big data applications. When a single machine is trained, it will face the problem of insufficient memory and limited computing capacity. therefore, distributed algorithms have been proposed to solve big data classification, and have received much attention. Particularly, distributed gradient descent (GD) is a widely-used algorithm for solving big data problem. However, distributed algorithms based on GD always converge slowly and suffer from expensive time in the training process. To alleviate this problem, we propose a novel fast distributed stochastic gradient descent algorithm for big data classification in this paper. By formulating the original optimization problem as a series of subproblems for classification in each machine. In particular, we exploit a fast stochastic method combined with the Nesterov acceleration method for sub-problem optimization in parallel to improve the convergence speed, and thus reduce the training time. the experimental results on some public and benchmark data sets show that our proposed distributed algorithm can converge faster with the competitive accuracy performance compared with distributed GD-based methods, which is suitable to big data classification. © 2021 IEEE.

关键词： Training Machine learning algorithms Smart cities Big Data Benchmark testing Classification algorithms distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

REI: An autonomous distributed routing algorithm

REI: An autonomous distributed routing algorithm

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Kashiwazaki, Hiroki Takai, Yoshiaki Graduate School of Engineering Hokkaido University Sapporo 060-0811 Hokkaido Japan Information Initiative Center Hokkaido University Sapporo 060-0811 Hokkaido Japan

this paper proposes a network routing algorithm REI which has autonomous adaptability to network traffic conditions. When a routing node has some different paths to a given destination, we can evaluate these paths in terms of their latency (delay time) given in inbound data packets. Evaluating scores of the paths, every node works as a distributed autonomous agent for adaptive routing. By network simulations to compare with a conventional OSPF and enhanced ones, we show that the multiagents-based routing algorithm has good adaptability in congested path avoidance and network load balancing.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

AGIOS: Application-guided I/O Scheduling for parallel File systems

AGIOS: Application-guided I/O Scheduling for Parallel File S...

引用

19th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Boito, Francieli Zanon Kassick, Rodrigo Virote Navaux, Philippe O. A. Denneulin, Yves Univ Fed Rio Grande do Sul Inst Informat Porto Alegre RS Brazil Univ Grenoble INRIA LIG Lab Grenoble France

ISBN: (纸本)9781479920815

In this paper, we improve the performance of server-side I/O scheduling on parallel file systems by transparently including information about the applications' access patterns. Server-side I/O scheduling is a valuable tool on multi-application scenarios, where the applications' spatial locality suffers from interference caused by concurrent accesses to the file system. We present AGIOS, an I/O scheduling library for parallel file systems. We guide scheduler's decisions by including information about the applications' future requests. this information is obtained from traces generated by the scheduler itself, without changes in application or file system. Our approach shows performance improvements under different workloads of 46.3% on average when compared to a scenario without an I/O scheduler, and of 25.1% when compared to a scheduler which does not use information about future accesses.

关键词： Disk Access I/O I/O Scheduling parallel File systems

来源：评论

学校读者我要写书评

暂无评论

Optimization for instruction level parallelism by adding, spilling and rematerialization

Optimization for instruction level parallelism by adding, sp...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Ishii, Naohiro Sumiyoshi, Kazunari Ogi, Hiroaki Iwata, Kazunori Aichi Institute of Technology Toyota 470-0392 Japan Aichi University Aichi 470-0296 Japan

On the instruction-level parallel architecture such as VLIW, the performance is affected by the compiler technique. In this paper, we propose an integrated optimization technique which cooperates register reusing, spilling and rematerialization First, we develop a register allocation method that can be decided, whether the register must be reusing or spilled or rematerialized by the prediction of the execution timing of the instruction in the program, when registers are insufficient. We evaluate our method in comparison with conventional compiler technique for blocks of programs. Second, the spilling and the rematerialization are also applied to the software pipelining to improve the parallelism in the loops. It was shown that the spilling and the rematerialization adopted in the scheduling, improves the parallelism in the loop executions.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive Peer Selection Strategy in P2P-VoD systems based on Dynamic Metaheuristic

Adaptive Peer Selection Strategy in P2P-VoD systems based on...

引用

19th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Rohmer, thibaud Nakib, Amir Lepagnot, Julien Nafaa, Abdelhamid UPEC LISSI F-94440 Vitry Sur Seine France UPEC LISSI EA 3956 F-94440 Vitry Sur Seine France UHA MIA EA 3993 F-68093 Mulhouse France UCD PEL Dublin 4 Ireland

ISBN: (纸本)9781479920815

During the past decade, Peer-to-Peer Video-on Demand (VoD) systems have proved their efficiency for large deployments. they raise new challenges such as peers resource allocation. Most literature on resource allocation tackle the problem with optimal static rules found at offline study of the system. In this paper, we use a dynamic metaheuristic, called Multiple Local-Search Algorithm for Dynamic Optimization (MLSDO) to optimize the problem at hand. the obtained results show that using a dynamic resource allocation reduces the rejection rate while enhancing the entropy of the system, in the face of a dynamically changing title demand.

关键词： Modeling distributed application Networks Peer-to-Peer Video-on-Demand Resource Allocation Bayes Evolution strategy Multiple Local Search Dynamic Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：