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

parallel Adaptive Mobile Web Clipping 03

proceedings of the Sixth ACM International workshop on Modeling, Analysis and simulation of Wireless and Mobile Systems, MSWiM 2003

作者： Vrenios, Alexander Distributed Systems Research Lab 1565 E. Marconi Ave. Phoenix AZ 85022 United States

We describe a unique approach to improving the performance of a Web clipping portal by exploiting inherent parallelism in the syntax of widely used markup languages, and by employing a parallel computing platform as a... 详细信息

ISBN: (纸本)1581137664

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

proceedings of the International workshop on Challenges of Large Applications in distributed Environments, CLADE 2003

Proceedings of the International Workshop on Challenges of L...

引用

International workshop on Challenges of Large Applications in distributed Environments, CLADE 2003

ISBN: (纸本)0769519849

The proceedings contain 16 papers. The topics discussed include: distributed parallel computing using windows desktop systems;a load balancing tool for distributed parallel loops;a diskless checkpointing algorithm for super-scale architectures applied to the fast Fourier transform;dynamic replication to improve input/output scalability of genomic alignment;towards a grid-based architecture for traditional Chinese medicine;towards a grid-based architecture for traditional Chinese medicine;issues in runtime algorithm selection for grid environments;resource co-allocation for parallel tasks in computational grids;scalable state replication with weak consistency;runtime support for changing the communication model in large scale applications;impact of admission and cache replacement policies on response times of jobs on data grids;and distributing simulation work based on component activity: a new approach to partitioning hierarchical DEVS models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hybrid Packet/Fluid flow network simulation 17

Hybrid Packet/Fluid flow network simulation

引用

17th workshop on parallel and distributed simulation

作者： Kiddle, C Simmonds, R Williamson, C Unger, B Univ Calgary Dept Comp Sci Calgary AB T2N 1N4 Canada

ISBN: (纸本)0769519709

Packet-level discrete-event network simulators use an event to model the movement of each packet in the network. This results in accurate models, but requires that many events are executed to simulate large, high bandwidth networks. Fluid-based network simulators abstract the model to consider only changes in rates of traffic flows. This can result in large performance advantages, though information about the individual packets is lost making this approach inappropriate for many simulation and emulation studies. This paper presents a hybrid model in which packet flows and fluid flows coexist and interact. This enables studies to be performed with background traffic modeled using fluid flows and foreground traffic modeled at the packet level. Results presented show up to 20 times speedup using this technique. Accuracy is within 4% for latency and 15% for jitter in many cases.

关键词： network simulation simulation abstraction techniques fluid simulation scalable network simulation

来源：评论

学校读者我要写书评

暂无评论

Utility analysis of parallel simulation 17

Utility analysis of parallel simulation

引用

17th workshop on parallel and distributed simulation

作者： Nicol, DM Dartmouth Coll Hanover NH 03755 USA

ISBN: (纸本)0769519709

parallel computers are used to execute discrete-event simulations in contexts where a serial computer is unable to provide answers fast enough, and/or is unable to hold the simulation state in memory. Traditional research in parallel simulation has focused on the degree to which a parallel simulator provides speedup. This paper takes a different view and asks how a parallel simulator provides increased user defined utility as a result of being able to simulate larger problem sizes. We develop a model where the utility of simulating a particular simulation is an increasing function of the problem size, and ask whether overall utility accrues faster on a parallel computer if one uses it to simulate one large problem in parallel, several smaller problem instances concurrently and each in parallel, or concurrently many small problem instances on single processors. We show that under our model assumptions, utility is accrued faster either by running one large problem instance in parallel using all the available processors, or by running one small problem instance per processor, concurrently. When we consider how to optimize the utility per unit cost we find that one either runs a large problem using all available processors, multiple small problems with one per processor or a small problem using exactly one processor Determination of the optimal configuration depends on the user's assessment of how rapidly utility grows with the problem size. Our main contribution is to show the linkage between the effectiveness of parallel simulation and a user's perception of the value of larger problem sizes. We show that if that utility grows less than linearly in the problem size, then use of parallelism is sub-optimal. We give precise relationships between our model parameters that govern when parallelism optimizes utility, and when it optimizes price-performance. We see that when model parameters are in a "normal" range, a user's perception of utility must grow significantly-e.g.

关键词： Analytical models Computational modeling Computer simulation Concurrent computing Context modeling Cost function Couplings Discrete event simulation Educational institutions parallel processing

来源：评论

学校读者我要写书评

暂无评论

CCL v3.0: Multiprogrammed semi-asynchronous checkpoints 17

CCL v3.0: Multiprogrammed semi-asynchronous checkpoints

引用

17th workshop on parallel and distributed simulation

作者： Quaglia, F Santoro, A Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy

ISBN: (纸本)0769519709

CCL (Checkpointing and Communication Library) is a recently developed software in support of optimistic parallel simulation on myrinet based clusters. Beyond classical low latency message delivery functionalities, this library implements CPU offloaded, semi-asynchronous checkpointing functionalities based on data transfer capabilities provided by a programmable DMA engine on board of myrinet network cards. The latest version of CCL (v2.4), designed for M2M-PCI32C myrinet cards, only supports monoprogrammed semi-asynchronous checkpoints. This forces re-synchronization between CPU and DMA activities each time a new checkpoint request must be issued at the simulation application level while the last issued one is still being carried out by the DMA engine. In this paper we present CCL v3.0 that, exploiting hardware features of more advanced M3M-PCI64C myrinet cards, supports multiprogrammed semi-asynchronous checkpoints. The multiprogrammed approach allows higher degree of concurrency between checkpointing and other simulation specific operations carried out by the CPU, with obvious benefits on performance. We also report the results of the evaluation of those benefits for the case of a personal communication system simulation application.

关键词： Checkpointing Concurrent computing Costs Delay Discrete event simulation Engines Hardware Reduced instruction set computing Remuneration Software libraries

来源：评论

学校读者我要写书评

暂无评论

Resource co-allocation for parallel tasks in computational grids

Resource co-allocation for parallel tasks in computational g...

引用

International workshop on Challenges of Large Applications in distributed Environments, CLADE 2003

作者： Wang, Lizhe Cai, Wentong Lee, Bu-Sung See, Simon Jie, Wei School of Computer Engineering Nanyang Technological University Singapore Sun Microsystems Inc. Singapore Institute of High Performance Computing Singapore

ISBN: (纸本)0769519849

Tasks running in computational Grids may require multiple types of resources simultaneously. Thus, co-allocation of multiple types of resources is needed when scheduling tasks. Traditional list scheduling heuristics cannot address the problem of resource co-allocation in computational Grids. This paper presents models for computational Grids and parallel tasks running in computational Grids. Based on these models, a parallel task scheduling algorithm for resource co-allocation in computational Grids is proposed. The algorithm identifies the critical resource of parallel tasks and tries to schedule a task as early as possible when all the resources required by the task are available. simulation results show that the algorithm can gain performance improvement, especially in the resource competitive computational Grid. © 2003 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：