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

Sequence-preserving parallel IP lookup using multiple SRAM-based pipelines

JOURNAL OF parallel AND distributed COMPUTING 2009年第9期69卷 778-789页

作者： Jiang, Weirong Prasanna, Viktor K. Univ So Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90089 USA

SRAM (static random access memory)-based pipelined algorithmic solutions have become competitive alternatives to TCAMs (ternary content addressable memories) for high-throughput IP lookup. Multiple pipelines can be utilized in parallel to improve the throughput further. However, several challenges must be addressed to make such solutions feasible. First, the memory distribution over different pipelines, as well as across different stages of each pipeline, must be balanced. Second, the traffic among these pipelines should be balanced. Third, the intra-flow packet order (i.e. the sequence) must be preserved. In this paper, we propose a parallel SRAM-based multi-pipeline architecture for IP lookup. A two-level mapping scheme is developed to balance the memory requirement among the pipelines as well as across the stages in each pipeline. To balance the traffic, we propose an early caching scheme to exploit the data locality inherent in the architecture. Our technique uses neither a large reorder buffer nor complex reorder logic. Instead, a flow-aware queuing scheme exploiting the flow information is used to maintain the intra-flow sequence. Extensive simulation using real-life traffic traces shows that the proposed architecture with 8 pipelines can achieve a throughput of up to 10 billion packets per second, i.e. 3.2 Tbps for minimum size (40 bytes) packets, while preserving intra-flow packet order. (c) 2009 Elsevier Inc. All rights reserved.

关键词： IP lookup Pipeline SRAM Router

来源：评论

学校读者我要写书评

暂无评论

Congestion Control Algorithm based on Loss Trend Oriented to Many-to-many Reliable Multicast

Congestion Control Algorithm based on Loss Trend Oriented to...

引用

3rd International workshop on e-Activity (IWEA2009)/10th ACIS International Conference on Software Engineering Artificial Intelligence, Networking and parallel/distributed Computing

作者： Liu Li Zhou Zhong Liu Dongmei Wu Wei State Key Lab Virtual Real Technol & Syst Beijing 100191 Peoples R China Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China

ISBN: (纸本)9780769536422

Congestion control algorithms of existing reliable multicast protocols are mainly derived from end-to-end model, which has high resource requirements and sometimes suppresses the package sending too much. Many-to-many reliable multicast requires efficient congestion control over a one-to-many model. It's an important mechanism to use many-to-many multicast in LAN (Local Area Network) in distributed simulation. In this paper, a congestion control algorithm based on loss trend for many-to-many reliable multicast is proposed. It predicts future package loss of receivers on the analysis of historic loss and buffer variety, and then control the congestion by adjusting the sending rate in advance. This algorithm aims at the reliable multicast in LAN. The main idea of the algorithm is to lower the possibility of multicast package loss, and then the nodes can afford the cost of package recovery. It alleviates the congestion on the depression of package loss possibility by regulating the sending rate. Experiment results indicate that the algorithm can keep a high throughput of many-to-many reliable multicast with relatively real-time performance.

关键词： many-to-many reliable multicast congestion control distributed simulation

来源：评论

学校读者我要写书评

暂无评论

Eurographics Symposium on parallel Graphics and Visualization, EGPGV 2009

Eurographics Symposium on Parallel Graphics and Visualizatio...

引用

9th Eurographics Symposium on parallel Graphics and Visualization, EGPGV 2009

ISBN: (纸本)9783905674156

The proceedings contain 14 papers. The topics discussed include: time-constrained high-fidelity rendering on local desktop grids;interactive physical simulation on multicore architectures;dynamic grid refinement for fluid simulations on parallel graphics architectures;simulation of radio wave propagation by beam tracing;parallelized matrix factorization for fast BTF compression;parallelized matrix factorization for fast BTF compression;fast parallel unbiased diffeomorphic atlas construction on multi-graphics processing units;a flexible adaptation service for distributed rendering;wait-free shared-memory irradiance cache;data-parallel hierarchical link creation for radiosity;and a decomposition approach for optimizing large-scale parallel image composition on multi-core MPP systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Timed High-order π Calculus and Multi-resolution Time Constraints

Timed High-order π Calculus and Multi-resolution Time Const...

引用

3rd International workshop on e-Activity (IWEA2009)/10th ACIS International Conference on Software Engineering Artificial Intelligence, Networking and parallel/distributed Computing

作者： Zheng, Wei Zhu, Yi-an Duan, Fang-fang Northwestern Polytech Univ Software Coll Xian 710072 Peoples R China

ISBN: (纸本)9780769536422

With the expansion of real-time software system scale, component-based real-time software is becoming mainstream. Timed pi calculus and High-order pi calculus as the software calculus system both can not describe dynamic nature of component-based real-time software. They also give the THO-pi calculus which is time-character According to making constraint to high-order process activities, They give the evolution rules of THO-pi calculus, they give an new weak-time mutual simulation which is among the high-order process and they also give the concept about multi-resolution time constraint for the system-level calculus application. This article research paves the way for the dynamic architecture of component-based real-time software and the establishment of component-based real-time software's description language.

关键词： component-based real-time software timed high-order pi calculus weak-timed mutual-simulation relationship multi-resolution time constraints

来源：评论

学校读者我要写书评

暂无评论

simulation of P Systems with Active Membranes on CUDA

Simulation of P Systems with Active Membranes on CUDA

引用

International workshop on High Performance Computational Systems Biology (HiBi 2009)

作者： Cecilia, Jose M. Guerrero, Gines D. Garcia, Jose M. Martinez-del-Amor, Miguel A. Perez-Hurtado, Ignacio Perez-Jimenez, Mario J. Univ Murcia Dpto Ingn & Tecnol Comp Grp Arquitectura & Computac Paralela Campus Espinardo E-30100 Murcia Spain Univ Seville Dept Comp Sci & Art Intelligence Res Grp Nat Comp Seville 41012 Spain

ISBN: (纸本)9780769538099

P systems or membrane systems provide a high level computational modeling framework that combines the structural and dynamic aspects of biological systems in a relevant and understandable way. P systems are massively parallel distributed. and non-deterministic systems. In this paper, we describe the implementation of a simulator for the class of recognizer P systems with active membranes by using the GPU (Graphics Processing Unit). We compare the high-performance parallel simulator for the GPU it) the simulator developed on a single CPU (Central Processing Unit), and we show that the GPU is better suited than file CPU to simulate P systems due to its highly parallel nature.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 4th workshop on Workflows in Support of Large-Scale Science, WORKS '09, in Conjunction with SC 2009

Proceedings of the 4th Workshop on Workflows in Support of L...

引用

4th workshop on Workflows in Support of Large-Scale Science, WORKS '09, in Conjunction with SC 2009

ISBN: (纸本)9781605587172

The proceedings contain 14 papers. The topics discussed include: publish/subscribe as a model for scientific workflow interoperability;a navigation model for exploring scientific workflow provenance graphs;scheduling data-intensive workflows on storage constrained resources;pipeline-centric provenance model;web enabling desktop workflow applications;a simulation toolkit to investigate the effects of grid characteristics on workflow completion time;a data-driven workflow language for grids based on array programming principles;plasma fusion code coupling using scalable I/O services and scientific workflows;workflow management for paramedical emergency operations within a mobile-static distributed environment;workflow representation and runtime based on lazy functional streams;composing and executing parallel data-flow graphs with shell pipes;and towards scientific workflow patterns.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel statistical model checking of biochemical networks 8

Efficient parallel statistical model checking of biochemical...

引用

8th International workshop on parallel and distributed Methods in VerifiCation, PDMC 2009

作者： Ballarini, P. Forlin, M. Mazza, T. Prandi, D. Microsoft Research - University of Trento Centre for Computational and Systems Biology Italy

We consider the problem of verifying stochastic models of biochemical networks against behavioral properties expressed in temporal logic terms. Exact probabilistic verification approaches such as, for example, CSL/PCTL model checking, are undermined by a huge computational demand which rule them out for most real case studies. Less demanding approaches, such as statistical model checking, estimate the likelihood that a property is satisfied by sampling executions out of the stochastic model. We propose a methodology for efficiently estimating the likelihood that a LTL property f holds of a stochastic model of a biochemical network. As with other statistical verification techniques, the methodology we propose uses a stochastic simulation algorithm for generating execution samples, however there are three key aspects that improve the efficiency: first, the sample generation is driven by on-the-fly verification of f which results in optimal overall simulation time. Second, the confidence interval estimation for the probability of f to hold is based on an efficient variant of the Wilson method which ensures a faster convergence. Third, the whole methodology is designed according to a parallel fashion and a prototype software tool has been implemented that performs the sampling/verification process in parallel over an HPC architecture. © Ballarini, Forlin, Mazza & Prandi.

关键词： Stochastic models

来源：评论

学校读者我要写书评

暂无评论

On determining how many computers to use in parallel VLSI simulation 09

On determining how many computers to use in parallel VLSI si...

引用

23rd International workshop on Principles of Advanced and distributed simulation

作者： Xu, Qing Tropper, Carl McGill Univ Sch Comp Sci Montreal PQ H3A 2A7 Canada

ISBN: (纸本)9780769537139

parallel discrete event simulation has been established as a technique which has great potential to speed up the execution of gate level circuit simulation. A fundamental problem posed by a parallel environment is the decision of whether it is best to simulate a particular circuit sequentially or on a parallel platform. Furthermore, in the event that a circuit should be simulated on a parallel platform, it is necessary to decide how many computing nodes should be used on the given platform. In this paper we propose a machine learning algorithm as an aid in making these decisions. The algorithm is based on the well-known K-Nearest Neighbor algorithm. After an extensive training regime, it was shown to make a correct prediction 99% of the time on whether to use a parallel or sequential simulator. The predicted number of nodes to use on a parallel platform was shown to produce an average execution time which was not more than 12% of the smallest execution time. The configuration which resulted in the minimal execution time was picked 61 % of the time.

关键词： execution time parallel Lines Machine learning algorithms discrete event simulation Platform Circuit simulation simulating Ganglia Very large scale integration Computers nearest neighbor algorithm Legal Executions

来源：评论

学校读者我要写书评

暂无评论

A Performance Evaluation of the Lightweight Time Warp Protocol in Optimistic parallel simulation of REVS-based Environmental Models 09

A Performance Evaluation of the Lightweight Time Warp Protoc...

引用

23rd International workshop on Principles of Advanced and distributed simulation

作者： Liu, Qi Wainer, Gabriel Carleton Univ Dept Syst & Comp Engn Ctr Visualizat & Simulat Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9780769537139

The Lightweight Time Warp (LTW) protocol offers a novel approach to high-performance optimistic parallel discrete-event simulation, especially when a large number of simultaneous events need to be executed at each virtual time. With LTW, the local simulation space on each node is partitioned into two sub-domains, allowing purely optimistic simulation to be driven by only a few full-fledged logical processes (LPs), while most processes are turned into lightweight LPs, free from the burden associated with Time Warp (TW) execution. This paper presents a comparative performance evaluation of the TW and LTW protocols for simulating several DEVS-based environmental models. The experiments indicate that the LTW protocol improves performance in terms of shortened execution time, reduced memory usage, lowered operational cost, and enhanced system stability.

关键词： Environmental Models Lightweight Time Warp DEVS models Optimistic parallel simulation

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Adaptive Mechanism for parallel simulation Replication 09

An Efficient and Adaptive Mechanism for Parallel Simulation ...

引用

23rd International workshop on Principles of Advanced and distributed simulation

作者： Ewald, Roland Leye, Stefan Uhrmacher, Adelinde M. Univ Rostock D-18059 Rostock Germany

ISBN: (纸本)9780769537139

simulation replication is a necessity for all stochastic simulations. Its efficient execution is particularly important when additional techniques are used on top, such as optimization or sensitivity analysis. One way to improve replication efficiency is to ensure that the best configuration of the simulation system is used for execution. A selection of the best configuration is possible when the number of required replications is sufficiently high, even without any prior knowledge on simulator performance or problem instance. We present an adaptive replication mechanism that combines portfolio theory with reinforcement learning: it adapts itself to the given problem instance at runtime and can be restricted to an efficient algorithm portfolio.

关键词： simulation Replication James II Algorithm Selection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：