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

Efficient metacomputing of elliptic linear and non-linear problems

JOURNAL OF parallel AND distributed COMPUTING 2003年第5期63卷 564-577页

作者： Barberou, N Garbey, M Hess, M Resch, MM Rossi, T Toivanen, J Tromeur-Dervout, D Univ Houston Dept Comp Sci Houston TX 77204 USA Univ Lyon 1 CDCSP ISTIL F-69622 Villeurbanne France Univ Stuttgart HLRS D-7000 Stuttgart Germany Univ Jyvaskyla Dept Math Informat Technol SF-40351 Jyvaskyla Finland

Metacomputing is a method of using the GRID, which originated in the US and quickly was also picked up by European and Japanese researchers where a number of challenging projects were aiming at the exploitation of such distributed resources. Especially the GLOBUS project (The globus project: a status report, proceedings IPPS/SPDP'98 Heterogeneous Computing workshop, 1998, pp. 4-18) has contributed to the success of metacomputing substantially. However, high latency and low bandwidth have made people doubt the feasibility of this concept for big simulation codes. In this paper we present new numerical methods that help to exploit such configurations and overcome the problems of low network performance. To proof the feasibility of our approach we show results of simulations in an innovative GRID environment of supercomputers. (C) 2003 Elsevier Science (USA). All rights reserved.

关键词： GRID metacomputing simulation numerical methods

来源：评论

学校读者我要写书评

暂无评论

Reducing the size of routing tables for large-scale network simulation 17

Reducing the size of routing tables for large-scale network ...

引用

17th workshop on parallel and distributed simulation

作者： Hiromori, A Yamaguchi, H Yasumoto, K Higashino, T Taniguchi, K Osaka Univ Grad Sch Engn Sci Suita Osaka 565 Japan

ISBN: (纸本)0769519709

In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted Especially, routing tables, which indicate the directions to forward packets, are considered to consume memory space. A simple general routing table requires O(N-2) space where N is the number of nodes. An algorithmic routing approach recently proposed by Heung et al. only requires O(N) space for representing routing tables, however this can be applied in the case that all the routes between two nodes are contained in a spanning tree (i.e. very limited routing strategies are allowed). In this paper we propose a new method to reduce the size of routing tables under any routing strategy. Given a general simple routing table, our method represents a routing table as the combination of an algorithmic routing based table and a general routing table, by translating a part of the given general routing table into the algorithmic routing based one. In order to reduce the size of the routing table, we find a (near-optimal)algorithmic routing based table that represents most part of the given routing table. Our experimental results have shown that our method could reduce the size of the table to 10% of the given routing table in hierarchical networks.

关键词： Computational modeling Computer architecture Computer networks Computer simulation Concurrent computing Information science Large-scale systems Network servers Routing protocols Space technology

来源：评论

学校读者我要写书评

暂无评论

Analysis of parallel downloading for large file distribution 9

Analysis of parallel downloading for large file distribution

引用

9th IEEE International workshop on Future Trends of distributed Computing Systems

作者： Koo, SGM Rosenberg, C Xu, DY Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

ISBN: (纸本)0769519105

Recently, the scheme of,parallel downloading (PD) has been adopted by a number of Internet file downloading applications. With the wide deployment of content distribution networks and peer-to-peer networks, PD is expected to be more commonly used for file distribution. There have been experiments showing that PD results in higher aggregated downloading throughput and therefore shorter downloading time experienced by clients. However these experimental studies focused on the performance experienced by a particular user and did not consider the impact of PD on the network when it is largely deployed. In this paper we present our efforts toward an in-depth understanding of large-scale deployment of PD through simulation and analysis. Our results suggest that while PD may achieve a shorter downloading time, its impact on the network and server is significant. Our analysis is also used for network dimensioning and content distribution service provisioning. We show that with proper admission control and dimensioning, single-server downloading can perform just as well as PD, without the complexity and overhead incurred by PD.

关键词： parallel downloading CDN large file distribution network dimensioning

来源：评论

学校读者我要写书评

暂无评论

Enabling large-scale multicast simulation by reducing memory requirements 17

Enabling large-scale multicast simulation by reducing memory...

引用

17th workshop on parallel and distributed simulation, PADS 2003

作者： Xu, Donghua Riley, G.F. Ammar, M.H. Fujimoto, R. College of Computing Georgia Institute of Technology AtlantaGA30332-0280 United States College of Engineering School of ECE Georgia Institute of Technology AtlantaGA30332-0250 United States

ISBN: (纸本)0769519709

The simulation of large-scale multicast networks often requires a significant amount of memory that can easily exceed the capacity of current computers, both because of the inherently large amount of state necessary to simulate message routing and because of design oversights in the multicast portion of existing simulators. We describe three approaches to substantially reduce the memory required by multicast simulations: 1) We introduce a novel technique called "negative forwarding table" to compress multicast routing state. 2) We aggregate the routing state objects from one replicator per router per group per source to one replicator per router. 3) We employ the NIx-Vector technique to replace the original unicast IP routing table. We implemented these techniques in the ns2 simulator to demonstrate their effectiveness. Our experiments show that these techniques enable packet level multicast simulations on a scale that was previously unachievable on modern workstations using ns2. © 2003 IEEE.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

The embedded triangles algorithm for distributed estimation in sensor networks

The embedded triangles algorithm for distributed estimation ...

引用

12th IEEE workshop on Statistical Signal Processing

作者： Delouille, V Neelamani, R Chandrasekaran, V Baraniuk, RG Rice Univ Dept Elect & Comp Engn Houston TX 77251 USA

ISBN: (纸本)0780379977

We propose a new iterative distributed estimation algorithm for Gaussian hidden Markov graphical models with loops. We decompose a loopy graph into a number of linked embedded triangles and then apply a parallel block-Jacobi iteration comprising local linear minimum mean-square-error estimation on each triangle (involving a simple 3 x 3 matrix inverse computation) followed by an information exchange between neighboring nodes and triangles. A simulation study demonstrates that the algorithm converges extremely rapidly, outperforming a number of existing algorithms. Embedded triangles are simple, local, scalable, fault-tolerant, and energy-efficient, and thus ideally suited for wireless sensor networks.

关键词： Computational modeling Concurrent computing Embedded computing Energy efficiency Fault tolerance Graphical models Hidden Markov models Iterative algorithms Matrix decomposition Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Large-scale TCP models using optimistic parallel simulation 17

Large-scale TCP models using optimistic parallel simulation

引用

17th workshop on parallel and distributed simulation, PADS 2003

作者： Yaun, G. Carothers, C.D. Kalyanaraman, Shivkumar Department of Computer Science Rensselaer Polytechnic Institute TroyNY12180 United States Department of Electrical and Computer Systems Engineering Rensselaer Polytechnic Institute TroyNY12180 United States

ISBN: (纸本)0769519709

Internet data traffic is doubling each year, yet bandwidth does not appear to be growing as fast as expected and thus short falls in available bandwidth, particularly at the "last mile" may result. To address these bandwidth allocation and congestion problems, researchers are proposing new overlay networks that provide a high quality of service and a near lossless guarantee. However, the central question raised by these new services is what impact will they have in the large? To address these and other network engineering research questions, high performance simulation tools are required. However, to date, optimistic techniques have been viewed as operating outside of the performance envelope for Internet protocols, such as TCP, OSPF and BGP. We dispel those views and demonstrate that optimistic protocols are able to efficiently simulate large scale TCP scenarios for realistic, network topologies using a single Hyper-Threaded computing system costing less than $7000 USD. For our real world topology, we use the core AT&T US network. Our optimistic simulator yields extremely high efficiency and many of our performance runs produce zero rollbacks. Our compact modelling framework reduces the amount of memory required per TCP connection and thus our memory overhead per connection for one of our largest experimental network topologies was 2.6 KB. That value was comprised of all events used to model TCP packets, TCP connection state and routing information. © 2003 IEEE.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

proceedings. Thirteenth International workshop on Research Issues in Data Engineering: Multi-lingual Information Management. RIDE-MILM 2003 (IEEE ***.03TH8687)

Proceedings. Thirteenth International Workshop on Research I...

引用

International workshop on Research Issues in Data Engineering

The following topics are dealt with: NLP (natural language processing) technologies for MLIM (multi-lingual information management); system issues in MLIM; and multilingual text processing.

关键词： Natural languages Indexes

来源：评论

学校读者我要写书评

暂无评论

Time-parallel trace-driven simulation of CSMA/CD 03

Time-parallel trace-driven simulation of CSMA/CD

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： H. Wu R.M. Fujimoto M. Ammar Georgia Institute of Technology College of Computing Georgia Institute of Technology Atlanta GA USA

ISBN: (纸本)9780769519708

Time-parallel simulation defines a methodology that can be applied to certain specific simulation problems. We present a time-parallel approach for trace-driven simulation of the CSMA/CD protocol. The "memoryless" property of the physical system under moderate traffic loads allows for efficient time-parallel simulation. We also present two optimization techniques: the estimation of idle points and the incremental fix-up computation. The former can improve the probability that a subtrace begins with a known initial system state. The latter can speedup the fix-up computation that is required when the estimation of the initial state is incorrect.

关键词： Multiaccess communication Computational modeling Strips Concurrent computing Discrete event simulation Educational institutions Protocols Telecommunication traffic State estimation Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

proceedings Seventh IEEE International Symposium on distributed simulation and Real-Time Applications

Proceedings Seventh IEEE International Symposium on Distribu...

引用

International workshop/Symposium on distributed simulation and Real-Time Applications (DS-RT)

The following topics are dealt with: high level architecture (HLA) and grid issues; real time systems; quality of service (QoS) and multimedia; parallel and distributed simulation; methodology and Web-based simulation... 详细信息

关键词： Real time systems Multimedia computing parallel processing Internet Virtual reality Collaborative work

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of a fault-tolerant adaptive router for parallel computers

Design and evaluation of a fault-tolerant adaptive router fo...

引用

International workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems

作者： Yoshinaga, T Hosogoshi, H Sowa, M Univ Electrocommun Grad Sch Informat Syst Tokyo 1828585 Japan

ISBN: (纸本)0769520197

In this paper, we propose a design methodology for fault tolerant adaptive routers for parallel and distributed computers. The key idea of our method is integrating minimal and non-minimal routing that is supported by independent virtual channels (VCs). Distinguishing the routing functions for each set of VCs simplifies the design of fault-tolerant algorithms. After describing the method, we show an application of a routing algorithm for two-dimensional mesh and torus networks. This algorithm, called Detour-NF, supports three routing modes: deterministic, minimal fully adaptive and non-minimal fault-tolerant operations. We also discuss the hardware cost and operational speed of minimal and non-minimal routers based on our design, which uses hardware description language (HDL). Communication performance and fault-tolerance are demonstrated by an HDL simulation. The experimental results show that supporting both minimal and non-minimal routing modes is advantageous for high-bandwidth and low-latency communication, as well as fault-tolerance.

关键词： fault-tolerance adaptive router non-minimal routing algorithm hardware design communication performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：