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

19th iasted international conference on parallel and distributed computing and systems

作者： Alima, Luc Onana Beauport, Stefan Institut d'Informatique Université de Mons-Hainaut Avenue du Champ de Mars 6 57000 Mons Belgium

ISBN: (纸本)9780889867048

Structured peer-to-peer overlay networks provide a means for interconnecting a large set of computing nodes called peers in a distributed, scalable and self-organizing manner. Typically in such systems, each peer maintains contact information about a small subset of other peers called neighbors. these neighbors are often chosen to ensure that each lookup operation takes a logarithmic number of overlay hops under normal conditions. Relying solely on the number of overlay hops as the metric for the quality of the lookup operation is not sufficient both for the applications using the overlay network and, for the effective use of the underlying communication network which is typically the Internet. DKS [1] is a P2P middleware built upon the principle we called distributed K-ary search, which ensures that any lookup takes O(log k(N)) overlay hops, where N is the number of nodes in the system and K is the search arity. In a DKS overlay network, proximity is not considered. As a result, end-to-end latencies could be significantly large. In this paper we present EPDKS, a novel structured peer-to-peer overlay network that is based on the distributed K-ary search principle. EPDKS takes proximity into account by combining round-trip times and the number of IP hops for interconnecting peers, thereby reducing end-to-end latencies and making effective use of the underlying network. Furthermore, we propose improvements for some of the algorithms currently implemented in the DKS. Simulation results confirm our expectations that EPDKS ensures lower end-to-end latencies and smaller number of IP hops when compared to DKS.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Self-constrained resource allocation procedures for parallel task graph scheduling on shared computing grids

Self-constrained resource allocation procedures for parallel...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： N'Takpé, Tchimou Suter, Frédéric Nancy Université / LORIA UMR 7503 CNRS - INPL - INRIA - Nancy 2 - UHP Nancy 1 Campus Scientifique BP 239 F-54506 Vandoeuvre-lès-Nancy France

ISBN: (纸本)9780889867048

Two of the main characteristics of computation grids are their heterogeneity and the sharing of resources between different users. this is the cost of the tremendous computing power offered by such platforms. Scheduling several applications concurrently in such an environment is thus challenging. In this paper we propose a first step towards the scheduling of multiple parallel task graphs (PTG), a class of applications that can benefit of large and powerful platforms, by focusing on the allocation process. We consider the application of a resource constraint on the schedule and determine the number of processors allocated to the different tasks of a PTG while respecting that constraint. We present two different allocation procedures and validate them in simulation over a wide range of scenarios with regard to their respect of the resource constraint and their impact on the completion time of the scheduled applications. We find that our procedures provide a guarantee on the resource usage for a low cost in terms of execution time.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

A simple efficient electronic auction scheme

A simple efficient electronic auction scheme

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2007

作者： Wen, Chen Feiyu, Lei Department of Communications and Electronic Engineering School of Information Science and Technology Donghua University 1882 Yanan Road Shanghai 200051 China

ISBN: (纸本)0769530494

关键词： Zinc distributed computing Information science Communication system security Information security Cryptography Jacobian matrices Random number generation Broadcasting Bismuth

来源：评论

学校读者我要写书评

暂无评论

Visualization of large scientific data sets on a parallel system with a tiled display

Visualization of large scientific data sets on a parallel sy...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Segee, Bruce Perry, Mary Jane Carter, Caleb Blanchette, Roger Winchenbach, Samuel Department of Electrical and Computer Engineering University of Maine Orono ME United States School of Marine Sciences University of Maine Orono ME United States

ISBN: (纸本)9780889867048

As data collection technologies advance, almost every field of scientific research sees an increase in the amount and frequency of data that can be collected. In many cases, the first best method for preprocessing two and three dimensional data sets is to examine them visually, using some sort of plotting software. Although display technology is advancing and monitors are becoming available with increasing resolutions, this increase in available resolution does not necessarily match the rapid increase in data collection. this mismatch leaves researchers with only three choices for visual processing: to view the data in many small chunks, to view only a representative subset of the data, or to create a custom display for viewing much larger data sets at higher resolutions. this paper discusses one method of fullfilling the third option. the process used here is to create a customized display using nine consumer level monitors mounted in a three by three configuration resulting in a display with nine times the resolution of a single monitor. A custom viewing environment is also developed within this project that is designed to lend itself better to the tiled display than would an existing three dimensional data visualization application. the data used for this project consists of a large set of Oceanographic sensor readings taken from several deployments throughout the Gulf of Maine.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

A visualized parallel network simulator for modeling large-scale distributed applications

A visualized parallel network simulator for modeling large-s...

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2007

作者： Siming, Lin Xueqi, Cheng Jianming, Lv Institute of Computing Technology Chinese Academy of Sciences Beijing China Graduate School Chinese Academy of Sciences Beijing China

ISBN: (纸本)0769530494

Large-scale distributed systems, with thousands or even millions of nodes, produce complex and dynamic behaviors. Packet-level simulation is necessary to test and analyze these systems, such as grids, peer-to-peer (P2P) applications as well as worm and DDoS containment systems. However, the current network simulators are not convenient for application layer simulation. We present the NSME, a visualized parallel simulator that allows researchers to simulate their applications in a large virtual network with most details transparent to them. A hierarchical routing is used to enhance the fidelity of simulation and reduce the memory cost of network construction. A variation of CMB algorithm is implemented for parallel synchronization. We show the functions of NSME by three applications: 1) a self-similar background traffic model, 2) a Slammer worm spreading model, and 3) a P2P live streaming system, which demonstrate its effectiveness for simulating any large-scale distributed applications. the performance tests show that the memory cost of NSME is distinctly lower than NS2 and the parallel efficiency can reach about 60% in any of the above applications. © 2007 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

引用

JOURNAL OF parallel AND distributed computing 2007年第7期67卷 797-815页

作者： Mittal, Neeraj Mohan, Prajwal K. Univ Texas Dept Comp Sci Richardson TX 75083 USA Intel Corp Digital Home Grp Hillsboro OR 97124 USA

In the group mutual exclusion problem, each critical section has a type or a group associated with it. Processes requesting critical sections belonging to the same group (that is, of the same type) may execute their critical sections concurrently. However, processes requesting critical sections belonging to different groups (that is, of different types) must execute their critical sections in a mutually exclusive manner. Most algorithms for solving the group mutual exclusion problem that have been proposed so far in the literature treat all groups equally. this is quite acceptable if a process, at the time of making a request for critical section, selects a group for the critical section uniformly. However, if some groups are more likely to be selected than others, then better performance can be achieved by treating different groups in a different manner. In this paper, we propose an efficient algorithm for solving the group mutual exclusion problem when group selection probabilities are nonuniformly distributed. Our algorithm has a message complexity of 2n - 1 per request for critical section, where n is the number of processes in the system. It has low synchronization delay of one message hop and low waiting time of two message hops. the maximum concurrency of our algorithm is n, which implies that if all processes have requested critical sections of the same type then all of them may execute their critical sections concurrently. Finally, the amortized message-size complexity of our algorithm is O(1). Our experimental results indicate that our algorithm outperforms the existing algorithms, whose complexity measures are comparable to that of ours, by as much as 50% in some cases. (C) 2007 Elsevier Inc. All rights reserved.

关键词： message-passing system resource management group mutual exclusion token-based algorithm non-uniform group selection priority-based scheme

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the iasted international conference on Modelling and Simulation 2007

Proceedings of the IASTED International Conference on Modell...

引用

18th iasted international conference on Modelling and Simulation, MS 2007

ISBN: (纸本)9780889866638

the proceedings contain 116 papers. the topics discussed include: camera operation estimation algorithm using low level vision in digital video;spam filtering improvement of an e-mail server by the cooperation of multi-filter firewall and virtual networks;on static pricing of threshold-policies at a single queue;rain attenuation modelling for low earth orbiting satellite ground station at S - band in Europe;on Alamouti scheme performance in spatially correlated fading and pilot assisted channel prediction;on the covariance function of a mobile-to-mobile communication link;parallel implementation of multi-resolution models in distributed simulation system;performance analysis and simulation of an equivalent model of serial queues for computer networks;anger filter in agent simulation of human behavior;impact of wind generators on the stability of power system network;and modeling and simulation of computational techniques used in numerical protective relays.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a novel CMP cache structure for hybrid workloads

Performance evaluation of a novel CMP cache structure for hy...

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2007

作者： Xuemei, Zhao Sammut, Karl Fangpo, He School of Informatics and Engineering Flinders University Australia

ISBN: (纸本)0769530494

the Chip Multiprocessor (CMP) architecture offers parallel multi-thread execution and fast retrieval of shared data that is cached on-chip. In order to obtain the best possible performance with the CMP architecture, the cache architecture must be optimised to reduce time lost during remote cache and off-chip memory accesses. Many researchers proposed CMP cache architectures to improve the system performance, but they have not considered parallel execution of mixed single-thread and multi-thread workloads. In this paper, we propose a hybrid workload-aware cache architecture SPS2, in which each processor has both private and shared L2 caches. We describe the corresponding SPS2 cache coherence protocol with state transition graph. Performance evaluation demonstrates that the proposed SPS2 cache structure has better performance than traditional private L2 and shared L2 when hybrid workloads are applied. © 2007 IEEE.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the iasted international conference on parallel and distributed computing and Networks, as part of the 24th iasted international Multi-conference on Applied Informatics

Proceedings of the IASTED International Conference on Parall...

引用

iasted international conference on parallel and distributed computing and Networks, as part of the 24th iasted international Multi-conference on APPLIED INFORMATICS

ISBN: (纸本)0889865701

the proceedings contain 51 papers. the topics discussed include: using an updating of DHCP in mobile ad-hoc networks;searching and detecting spatial LSB steganographic images on the Internet;development of parallel direct sparse linear solvers within a parallel finite element code;checkpointing and rollback-recovery protocol integrated with VsSG protocol for RYW session guarantee;achieving realtime capabilities in Ethernet networks by edge-coloring of communication conflict-multigraphs;cross-layer designs for mitigating range attacks in ad hoc networks;grid load balancing using an echo system of intelligent ants;critical path routing (CPR) protocol for mobile ad hoc networks;ADPROC: an adaptive routing framework to provide QoS in wireless sensor networks;evaluating the use of Motes and Tinyos for a mobile sensor platform;and a comparison study of optical MIN networks with parallel planes.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Co-operation of processes in parallel simulated annealing

Co-operation of processes in parallel simulated annealing

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Czech, Zbigniew J. Silesia Univ Technol Gliwice Poland

ISBN: (纸本)9780889866386

the co-operation of parallel simulated annealing processes to solve the vehicle routing problem with time windows (VRPTW) is considered. the objective is to investigate how the number of parallel processes and the frequency of processes co-operation influence the accuracy of solutions to the VRPTW. the accuracy of solutions is measured by their proximity to the best known solution.

关键词： parallel simulated annealing bicriterion optimization vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：