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

3rd international Conference on parallel and distributed processing and applications

作者： Shao, HG Wang, WN Xie, R Chen, X Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China Reg Network Ctr E China China Educ & Res Network Shanghai 200030 Peoples R China

ISBN: (纸本)3540297693

In this paper, we proposed a new QoS framework with distributed Adaptive Resource Management (DARM). DARM provides end-to-end QoS guarantees to individual flows with minimal overhead, while keeping the scalability characteristic of DiffServ. In DARM, per-flow admission control and resource reservation, in conjunction with a novel IPv6 flow label mechanism, can be processed instantaneously in a fully distributed and independent manner at edge of network without hop-by-hop signaling. In addition, DARM is capable of reconfiguring network resource adaptively according to dynamically changing of traffic load. Through extensive simulations, the results clearly exhibit that DARM has a better overall performance comparing to the IntServ and DiffServ.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A quorum based group k-mutual exclusion algorithm for open distributed environments

A quorum based group <i>k</i>-mutual exclusion algorithm for...

引用

3rd international Conference on parallel and distributed processing and applications

作者： Lawi, A Oda, K Yoshida, T Kyushu Inst Technol Program Creat Informat Iizuka Fukuoka 820 Japan

ISBN: (纸本)3540297693

This paper presents a quorum-based group k-mutual exclusion algorithm for open distributed computing systems that can evolve their behavior based on membership changes in the environment. The algorithm consists of two main layers;the quorum-consensus and quorum-reconfiguration. The quorum consensus layer is used to handle requests from and to the application layer, and it directly adopts a proposed kcoterie based algorithm of the group k-mutual exclusion in the static environments without any change to its protocol. Thus, the message complexity and quorum availability are the same as in the static environments. The quorum reconfiguration reconstructs information structure of the k-coterie by simply implementing the properties of two quorum input operations called coterie-join and coterie-cross. The reconfiguration layer is simple to use and has a great ability to complete any operation during reconfiguration powerfully thus system does not enter the halt state.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Online adaptive fault-tolerant routing in 2D torus

Online adaptive fault-tolerant routing in 2D torus

引用

3rd international Conference on parallel and distributed processing and applications

作者： Li, YM Peng, ST Chu, WM Hosei Univ Tokyo 1848584 Japan Univ Aizu Aizu Wakamatsu 9658580 Japan

ISBN: (纸本)3540297693

In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty nodes. The proposed algorithms find a fault-free path between any two nonfaulty nodes with high probability in linear time by using only the local routing information of the network. The results of our empirical analysis through simulations show that the algorithms can find a fault-free path between any two nonfaulty nodes with high probability. For example, in a torus of size up to 128 x 128, where, the number of faulty nodes up to 15%, the heuristucsquare routing algorithm finds a fault-free path with a probability of 90% or higher. The experimental results are impressive for 2D torus with only four links per node.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Bounds on information combining

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2005年第2期51卷 612-619页

作者： Land, I Huettinger, S Hoeher, PA Huber, JB Aalborg Univ Dept Commun Technol Digital Commun Div DK-9220 Aalborg Denmark Univ Kiel Fac Engn Informat & Coding Theory Lab D-24143 Kiel Germany Univ Erlangen Nurnberg Inst Informat Transmiss D-91058 Erlangen Germany

When the same data sequence is transmitted over two independent channels, or when a data sequence is transmitted twice but independently over the same channel, the independent observations can be combined at the receiver side. From an information-theory point of view, the overall mutual information between the data sequence and the received sequences represents a combination of the mutual information of the two channels. This concept is termed information combining. In this paper, a lower bound and an upper bound on the combined information is presented, and it is proved that these bounds are tight. Furthermore, this principle is extended to the computation of extrinsic information on single code bits for a repetition code and for a single parity-check code of length three, respectively. For illustration of the concept and the bounds on information combining, two applications are considered. First, bounds on the information processing characteristic (IPC) of a parallel concatenated code are derived from its extrinsic information transfer (EXIT) chart. Second, bounds on the EXIT chart for an outer repetition code and for an outer single parity-check code of a serially concatenated coding scheme are computed.

关键词： extrinsic information extrinsic information transfer (EXIT) chart information combining information processing characteristic (IPC) iterative decoding mutual information parallel concatenated codes

来源：评论

学校读者我要写书评

暂无评论

A personalized and scalable service broker for the global computing environment

A personalized and scalable service broker for the global co...

引用

3rd international symposium on parallel and distributed processing and applications, ispa 2005

作者： Park, Kyung-Lang Kim, Chang-Soon Kwon, Oh-Young Park, Hyoung-Woo Kim, Shin-Dug Department of Computer Science Yonsei University 134 Shinchon-Dong Seodaemun-Ku Seoul 120-749 Korea Republic of Dept. of Computer Engineering Korea University of Technology and Education P.O. BOX 55 Chonan 330-600 Korea Republic of Korea Institute of Science and Technology Information P.O. BOX 122 Yusong Taejun 305-806 Korea Republic of

ISBN: (纸本)3540297693

Service broker is a software component that maps user's request to proper services. By using the broker, users can access various services without any knowledge of the services. However, design of the service broker for GCE (Global Computing Environment) is quite difficult because a broker cannot cope with all the information of services which are spread over the world. Thus, we need to build new architectural foundations for global service brokering. In this paper, we propose a scalable broker system for GCE based on the federation of personalized brokers. In our broker system, every user can have a service broker. The broker maintains the information of services related to the user and exchanges the information with neighboring brokers if necessary. As a result, the broker can provide proper services to users faster and a burden of brokers can also be decreased. Experimental results show that the proposed service broker can reduce the average service discovery time and the average operation overhead of each broker comparing to other brokering architectures. © Springer-Verlag Berlin Heidelberg 2005.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

An investigation into the application of different performance prediction methods to distributed enterprise applications

An investigation into the application of different performan...

引用

3rd international Workshop on Performance Modelling, Evaluation, and Optimization of parallel and distributed Systems held in Conjunction with the 18th international parallel and distributed processing symposium

作者： Bacigalupo, DA Jarvis, SA He, LG Spooner, DP Dillenberger, DN Nudd, GR Univ Warwick High Performance Syst Grp Coventry CV4 7AL W Midlands England IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA

Response time predictions for workload on new server architectures can enhance Service Level Agreement-based resource management. This paper evaluates two performance prediction methods using a distributed enterprise application benchmark. The historical method makes predictions by extrapolating from previously gathered performance data, while the layered queuing method makes predictions by solving layered queuing networks. The methods are evaluated in terms of: the systems that can be modelled;the metrics that can be predicted;the ease with which the models can be created and the level of expertise required;the overheads of recalibrating a model;and the delay when evaluating a prediction. The paper also investigates how a prediction-enhanced resource management algorithm can be tuned so as to compensate for predictive inaccuracy and balance the costs of SLA violations and server usage.

关键词： performance prediction distributed enterprise application layered queuing modelling historical performance data resource management service level agreement

来源：评论

学校读者我要写书评

暂无评论

Communication benchmarking and performance modelling of MPI programs on cluster computers

引用

JOURNAL OF SUPERCOMPUTING 2005年第2期34卷 201-217页

作者： Grove, DA Coddington, PD Univ Adelaide Sch Comp Sci Adelaide SA 5005 Australia

This paper gives an overview of two related tools that we have developed to provide more accurate measurement and modelling of the performance of message-passing communication and application programs on distributed memory parallel computers. MPIBench uses a very precise, globally synchronised clock to measure the performance of MPI communication routines. It can generate probability distributions of communication times, not just the average values produced by other MPI benchmarks. This allows useful insights to be made into the MPI communication performance of parallel computers, and in particular how performance is affected by network contention. The Performance Evaluating Virtual parallel Machine (PEVPM) provides a simple, fast and accurate technique for modelling and predicting the performance of message-passing parallel programs. It uses a virtual parallel machine to simulate the execution of the parallel program. The effects of network contention can be accurately modelled by sampling from the probability distributions generated by MPIBench. These tools are particularly useful on clusters with commodity Ethernet networks, where relatively high latencies, network congestion and TCP problems can significantly affect communication performance, which is difficult to model accurately using other tools. Experiments with example parallel programs demonstrate that PEVPM gives accurate performance predictions on commodity clusters. We also show that modelling communication performance using average times rather than sampling from probability distributions can give misleading results, particularly for programs running on a large number of processors.

关键词： parallel computing cluster computing performance modelling

来源：评论

学校读者我要写书评

暂无评论

parallel performance of a 3D elliptic solver

引用

3rd international Conference on Numerical Analysis and Its applications

作者： Lirkov, I Bulgarian Acad Sci Cent Lab Parallel Proc BU-1113 Sofia Bulgaria

ISBN: (纸本)3540249370

It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic problems have good numerical properties and a potential for high parallel efficiency. The asymptotic estimate for their convergence rate is as for the incomplete factorization methods but the efficiency of the parallel algorithms based on circulant preconditioners are asymptotically optimal. In this paper parallel performance of a circulant block-factorization based preconditioner applied to a 3D model problem is investigated. The aim of this presentation is to analyze the performance and to report on the experimental results obtained on shared and distributed memory parallel architectures. A portable parallel code is developed based on Message Passing Interface (MPI) and OpenMP (Open Multi processing) standards. The performed numerical tests on a wide range of parallel computer systems clearly demonstrate the high level of parallel efficiency of the developed parallel code.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

DGMonitor: A performance monitoring tool for sandbox-based desktop grid platforms

DGMonitor: A performance monitoring tool for sandbox-based d...

引用

作者： Cicotti, P Taufer, M Chien, AA Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA Scripps Res Inst Dept Mol Biol La Jolla CA 92037 USA Univ Texas Dept Comp Sci El Paso TX 79968 USA

ISBN: (纸本)0769521320

Accurate, continuous resource monitoring and profiling are critical for enabling performance tuning and scheduling optimization. In desktop grid systems that employ sandboxing, these issues are challenging because (1) subjobs inside sandboxes are executed in a virtual computing environment and (2) the state of this virtual environment within the sandboxes is reset to an initial empty state after a subjob completion. DGMonitor is a monitoring tool which builds a global, accurate, and continuous view of real resource utilization for desktop grids with sandboxing. Our monitoring tool measures performance unobtrusively and reliably, uses a simple performance data model, and is easy to use. Our measurements demonstrate that DGMonitor can scale to large desktop grids (up to 12000 PCs) with low monitoring overhead in terms of resource consumption (less than 0.1% per machine). Though we originally developed DGMonitor with the Entropia DCGrid platform, our tool is easily portable and integrated into other desktop grid systems. In all of these systems, DGMonitor data can support existing and novel information services, particularly for performance tuning and scheduling. In this paper, the high scalability and monitoring power of DGMonitor are demonstrated with the Entropia DCGrid platform and the BOINC platform respectively.

关键词： performance monitoring and profiling sandboxing techniques distributed computing

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed processing and applications 2005

引用

丛书名： Lecture Notes in Computer Science

2005年

作者： Yi Pan Daoxu Chen Minyi Guo Jiannong Cao Jack Dongarra

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：