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

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Govind, S. Govindarajan, R. Kuri, Joy Supercomputer Education and Research Centre Indian Institute of Science Bangalore 560012 India Dept. of Computer Science and Automation Indian Institute of Science Bangalore 560012 India Centre for Electronics Design and Technology Indian Institute of Science Bangalore 560012 India

ISBN: (纸本)1424409101

Network processors today consists of multiple parallel processors (microengines) with support for multiple threads to exploit packet level parallelism inherent in network workloads. With such concurrency, packet ordering at the output of the network processor cannot be guaranteed. This paper studies the effect of concurrency in network processors on packet ordering. We use a validated Petri net model of a commercial network processor, Intel IXP 2400, to determine the extent of packet reordering for IPv4 forwarding application. Our study indicates that in addition to the parallel processing in the network processor, the allocation scheme for the transmit buffer also adversely impacts packet ordering. In particular, our results reveal that these packet reordering results in a packet retransmission rate of up to 61%. We explore different transmit buffer allocation schemes namely, contiguous, strided, local, and global which reduces the packet retransmission to 24%. We propose an alternative scheme, Packet Sort, which guarantees complete packet ordering while achieving a throughput of 2.5 Gbps. Further, Packetsort outperforms the in-built packet ordering schemes in the IXP processor by up to 35%. © 2007 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Advanced parallel Processing Technologies: 7th international symposium, APPT 2007 Proceedings

引用

7th international symposium on Advanced parallel Processing Technologies, APPT 2007

ISBN: (纸本)9783540768364

The proceedings contain 81 papers. The topics discussed include: scalability for Petaflops systems;chip multi-threading and the SPARC evolution;the multicore programming challenge;replication-based partial dynamic scheduling heterogeneous network processors;the optimum location of delay latches between dynamic pipeline stages;a novel fault-tolerant parallel algorithm;the design on SEU-tolerant information processing system of the on-board-computer;balancing thread partition for efficiency exploiting speculative thread-level parallelism;design and implementation of a high-speed reconfigurable modular arithmetic unit;virtual disk monitor based on multi-core EFI;an optimal design method for de-synchronous circuit based on control graph;and property-preserving composition of distributed system components.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Agile parallel applications

Agile parallel applications

引用

Joint Meeting of the international symposium on distributed Computing and Applications to Business, Engineering and Science/international Conference on parallel Algorithms and Computing Evironments

作者： Anthony, R. J. Univ Greenwich Old Royal Naval Coll Dept Comp Sci London SE10 9LS England

Non-dedicated loosely coupled systems are popular platforms for cluster- and grid-based parallel processing, fundamentally because they have good cost-performance ratios and are scalable. However, these platforms represent highly dynamic environments in which performance and efficiency can be seriously impacted by changes in environmental conditions. This is especially significant where the runtime configuration has been determined statically, either at compilation time or at the start of execution. This paper introduces the concept of agile parallel processing in which the application manages several aspects of its own run-time behaviour, including deployment granularity. This approach reduces the emphasis on the preconfiguration of components, and relies instead on inbuilt learning and discovery capabilities. To facilitate investigation into the extent to which a self-managing approach can be beneficial to parallel processing, an experimental framework has been developed. The framework provides a range of services such as dynamic worker discovery and performance calibration, and policy-controlled facilities such as resource management and adaptation to suit environmental conditions. The framework integrates these services with the parallel application code. The operation and performance of policy-based dynamic deployment scheduling in dynamic environments is analysed in detail.

关键词： scheduling parallel processing dynamic deployment self-management policy-based computing

来源：评论

学校读者我要写书评

暂无评论

Robust stabilizing leader election

Robust stabilizing leader election

引用

9th international symposium on Stabilization, Safety and Security of distributed systems (SSS 2007)

作者： Delporte-Gallet, Carole Devismes, Stephane Fauconnier, Hugues LIAFA Université D. Diderot France LaRIA Université de Picardie Jules Verne France

ISBN: (纸本)9783540766261

We mix two approaches of the fault-tolerance: robustness and stabilization. Using these approaches, we propose leader election algorithms that tolerate both transient and crash failures. Our goal is to show the implement ability of the robust self- and/or pseudo-stabilizing leader election in various systems with weak reliability and synchrony assumptions. We try to propose, when it is possible, communication-efficient implementations. Also, we exhibit some assumptions required to obtain robust stabilizing leader election algorithms. Our results show that the gap between robustness and stabilizing robustness is not really significant when we consider fix-point problems such as leader election.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A semi-distributed axiomatic game theoretical mechanism for replicating data objects in large distributed computing systems

A semi-distributed axiomatic game theoretical mechanism for ...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Khan, Samee Ullah Ahmad, Ishfaq Department of Computer Science and Engineering University of Texas Arlington TX 76019 United States

ISBN: (纸本)1424409101

Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, which is NP-complete in general. A majority of conventional replica placement techniques falter on issues of scalability or solution quality. To counteract such issues, we propose a game theoretical replica placement technique, in which computational agents compete for the allocation or reallocation of replicas onto their servers in order to reduce the user perceived access delays. The technique is based upon six well-defined axioms, each guaranteeing certain basic game theoretical properties. This eccentric method of designing game theoretical techniques using axioms is unique in the literature and takes away from the designers the cumbersome mathematical details of game theory. The distinctive feature of these axioms is that when amassed together, their individual properties constrict into one system-wide performance enhancement property, which in our case is the reduction of access time. The control of the proposed technique is "semi-distributed" in nature, wherein all the heavy processing is done on the servers of the distributed system and the central body is only required to take a binary decision: (0) not to replicate or (1) to replicate. This semi-distributed approach makes the technique scalable and helps solutions to converge in a fast turn-around time without loosing much of the solution quality. Experimental comparisons are made against: 1) branch and bound, 2) greedy, 3) genetic, 4) Dutch auction, and 5) English auction. As attested by the results, the proposed technique maintains superior solution quality in terms of lower communication cost and reduced execution time. © 2007 IEEE.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Stabilized edge-based finite element simulation of free-surface flows

引用

international JOURNAL FOR NUMERICAL METHODS IN FLUIDS 2007年第6-8期54卷 965-993页

作者： Elias, Renato N. Coutinho, Alvaro L. G. A. Univ Fed Rio de Janeiro Ctr Parallel Computat BR-21945970 Rio De Janeiro Brazil Univ Fed Rio de Janeiro Dept Civil Engn BR-21945970 Rio De Janeiro Brazil

Free-surface flows occur in several problems in hydrodynamics, Such as fuel or water sloshing in tanks, waves breaking in ships, offshore platforms, harbours and coastal areas. The computation of such highly nonlinear flows is challenging since free-surfaces commonly present merging, fragmentation and breaking parts. leading to the use of interface-capturing Eulerian approaches. In Such methods the surface between two fluids is captured by the use of a marking function which is transported in a flow field. In this work we present a three-dimensional parallel edge-based incompressible SUPG/PSPG finite element method to cope with free-surface problems with volume-of-fluid (VOF) extensions to track the evolving free Surface. The pure advection equation for the scalar marking function was solved by a fully implicit parallel edge-based SUPG finite element formulation. We studied variants of this formulation, considering the effects of discontinuity capturing and a particular tangent transformation designed to increase interface sharpness. Global mass conservation is enforced adding or removing mass proportionally to the absolute value of the normal velocity of the interface. We introduce a parallel dynamic deactivation algorithm to solve the marking function equation only in a small region around the interface. The implementation is targeted to distributed memory systems with cache-based processors. The performance and accuracy of the proposed solution method were tested with several validation problems. Copyright (c) 2007 John Wiley & Sons, Ltd.

关键词： free surface interface capturing stabilized finite elements edge-based formulation volume-of-fluid

来源：评论

学校读者我要写书评

暂无评论

A novel fault-tolerant parallel algorithm

引用

7th international symposium on Advanced parallel Processing Technologies

作者： Wang, Panfeng Du, Yunfei Fu, Hongyi Zhou, Haifang Yang, Xuejun Yang, Wenjing Natl Univ Def Technol Natl Lab Paralleling & Distributed Proc Coll Comp Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9783540768364

The mean-time-between-failure of current high-performance computer systems is much shorter than the running times of many computational applications, whereas those applications are the main workload for those systems. Currently, checkpoint/restart is the most commonly used scheme for such applications to tolerate hardware failures. But this scheme has its performance limitation when the number of processors becomes much larger. In this paper, we propose a novel fault-tolerant parallel algorithm FPAPR. First, we introduce the basic idea of FPAPR. Second, we specify the details of how to implement a FPAPR program by using two NPB kernels as examples. Third, we theoretically analyze the overhead of FPAPR, and find out that the overhead of FPAPR decreases with the increase of the number of processors. At last, the experimental results on a 512-CPU cluster show the overhead introduced by the algorithm is very small.

关键词： high-performance computing fault tolerance parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Data grid model based on structured P2P overlay network

引用

7th international symposium on Advanced parallel Processing Technologies

作者： Song, Wei Zhao, Yuelong Zeng, Wenying Wang, Wenfeng S China Univ Technol Sch Comp Sci & Engn Guangzhou 510640 Peoples R China

ISBN: (纸本)9783540768364

Data Grid provides integrated view of distributed data scattered across networks. Current Data Grid systems are centrally controlled. In this paper, we present a structured P2P based Data Grid model (P-DataGrid Model, PDG) which makes use of construction and routing algorithms of P-Grid a structured P2P system. PDG is organized as virtual multi-branch tree with binary tree as main body. Formal description of PDG is firstly introduced. Then we discuss the realization issues of PDG such as establishment of model, data storage service, information service, etc. Among these issues, our emphasis is on joining of nodes, registration and location of replica. Furthermore, we analyze the successful probability of location. Constructing Data Grid on structured P2P overlay can bring great advantages of scalability, decentralized control and reliability.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Nonuniformly communicating noncontiguous data: A case study with PETSc and MPI

Nonuniformly communicating noncontiguous data: A case study ...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Balaji, P. Buntinas, D. Balay, S. Smith, B. Thakur, R. Gropp, W. Mathematics and Computer Science Division Argonne National Laboratory

ISBN: (纸本)1424409101

Due to the complexity associated with developing parallel applications, scientists and engineers rely on high-level software libraries such as PETSc, ScaLAPACK and PESSL to ease this task. Such libraries assist developers by providing abstractions for mathematical operations, data representation and management of parallel layouts of the data, while internally using communication libraries such as MPI and PVM. With high-level libraries managing data layout and communication internally, it can be expected that they organize application data suitably for performing the library operations optimally. However, this places additional overhead on the underlying communication library by making the data layout noncontiguous in memory and communication volumes (data transferred by a process to each of the other processes) nonuniform. In this paper, we analyze the overheads associated with these two aspects (noncontiguous data layouts and nonuniform communication volumes) in the context of the PETSc software toolkit over the MPI communication library. We describe the issues with the current approaches used by MPICH2 (an implementation of MPI), propose different approaches to handle these issues and evaluate these approaches with micro-benchmarks as well as an application over the PETSc software library. Our experimental results demonstrate close to an order of magnitude improvement in the performance of a 3-D Laplacian multi-grid solver application when evaluated on a 128 processor cluster. ©2007 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Pseudo trust: Zero-knowledge based authentication in anonymous peer-to-peer protocols

Pseudo trust: Zero-knowledge based authentication in anonymo...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Lu, Li Han, Jinsong Hu, Lei Huai, Jinpeng Liu, Yunhao Ni, Lionel M. State Key Lab. of Information Security Graduate School Chinese Academy of Sciences Beijing China Dept. of Computer Science and Engineering Hong Kong University of Science and Technology Kowloon Hong Kong School of Computer Science Beihang University Beijing China State Key Lab. of Software Developing Environment Beihang University Beijing China

ISBN: (纸本)1424409101

Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence, there exists an inherent tradeoff between trust and anonymity. To the best of our knowledge, there is currently no P2P protocol that provides complete mutual anonymity as well as authentication and trust management. We propose a zero-knowledge authentication scheme called Pseudo Trust (PT), where each peer, instead of using its real identity, generates an unforgeable and verifiable pseudonym using a one-way hash function. A novel authentication scheme based on Zero-Knowledge Proof is designed so peers can be authenticated without leaking any sensitive information. With the help of PT, most existing identity-based trust management schemes become applicable in mutual anonymous P2P systems. We analyze the levels of security and anonymity in PT, and evaluate its performance using trace-driven simulations and a prototype implementation. The strengths of Pseudo Trust include the lack of need for a centralized trusted party or CA, high scalability and security, low traffic and cryptography processing overheads, and man-in-middle attack resistance. We aim for the Pseudo Trust design to be included in the P2P trust and anonymity context. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：