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

28th IEEE international symposium on Reliable distributed systems

作者： Vilaca, R. Pereira, J. Oliveira, R. Armendariz-Inigo, J. E. Gonzalez de Mendivi, J. R. Univ Minho Comp Sci & Technol Ctr Braga Portugal Univ Navarra Publ Dept Engn Matemat & Informat E-31080 Pamplona Spain

ISBN: (纸本)9780769538266

Data base clusters based on share-nothing replication techniques are currently widely accepted as a practical solution to scalability and availability of the data tier. A key issue when planning such systems is the ability to meet service level agreements when load spikes occur or cluster nodes fail. This translates into the ability to provision and deploy additional nodes. Many current research efforts focus on designing autonomic controllers to perform such reconfiguration, tuned to quickly react to system changes and spawn new replicas based on resource usage and performance measurements. In contrast, we are concerned about the inherent impact of deploying an additional node to an online cluster, considering both the time required to finish such an action as well as the impact on resource usage and performance of the cluster as a whole. If noticeable, such impact hinders the practicability of self-management techniques, since it adds an additional dimension that has to he accounted for. Our approach is to systematically benchmark a number of different reconfiguration scenarios to assess the cost of bringing a new replica online. We consider factors such as: workload characteristics, incremental and parallel recovery, flow control and outdatedness of the recovering replica. As a result, we show that research should be refocused from optimizing the capture and transmition of changes to applying them, which in a realistic setting dominates the cost of the recovery operation.

关键词： databases Replication Group Communication Performance and QoS Testing

来源：评论

学校读者我要写书评

暂无评论

Using a RESTful messaging and registry system to support a range a distributed applications

Using a RESTful messaging and registry system to support a r...

引用

8th international symposium on parallel and distributed Computing

作者： Baker, Mark Smith, Garry Grove, Matthew Lakhoo, Rahim Mills, Hugo Albing, Carl Univ Reading Sch Syst Engn Reading Berks England

ISBN: (纸本)9780769536804

Tycho was conceived in 2003 in response to a need by the GridRM [1] resource-monitoring project for a "light-weight", scalable and easy to use wide-area distributed registry and messaging system. Since Tycho's first release in 2006 a number of modifications have been made to the system to make it easier to use and more flexible. Since its inception, Tycho has been utilised across a number of application domains including wide-area resource monitoring, distributed queries across archival databases, providing services for the nodes of a Cray supercomputer, and as a system for transferring multi-terabyte scientific datasets across the Internet. This paper provides an overview of the initial Tycho system, describes a number of applications that utilise Tycho, discusses a number of new utilities, and how the Tycho infrastructure has evolved in response to experience of building applications with it.

关键词： RESTful HTTP PUT/GET Transactions Web 2.0

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

distributed Causal Model-based Diagnosis based on Interacting Behavioral Petri Nets

Distributed Causal Model-based Diagnosis based on Interactin...

引用

8th international symposium on parallel and distributed Computing

作者： Bennoui, Hammadi Chaoui, Allaoua Barkaoui, Kamel Univ Biskra Dept Comp Sci Biskra 07000 Algeria Univ Constantine Dept Comp Sci Constantine 25000 Algeria Conservatoire Natl Arts & Metiers F-75141 Paris 03 France

ISBN: (纸本)9780769536804

This paper deals with the problem of causal model-based diagnosis of distributed systems. The setting we consider is a collection of interacting behavioral Petri nets (BPNs). Each BPN model represents the causal behavioral model of one subsystem and its interactions with neighboring subsystems. Interactions among subsystems are modeled by tokens that pass from one model to another via common places. Diagnosis reasoning scheme exploits, in a first step a backward reachability analysis on each net model to obtain local diagnoses;and in a second step, it exploits a forward reachability analysis for ensuring that local diagnoses are consistent and form global ones.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2009 8th IEEE international symposium on Network Computing and Applications, NCA 2009

Proceedings - 2009 8th IEEE International Symposium on Netwo...

引用

2009 8th IEEE international symposium on Network Computing and Applications, NCA 2009

ISBN: (纸本)9780769536989

The proceedings contain 54 papers. The topics discussed include: an experimental study of diversity with off-the-shelf antivirus engines;simulating fixed virtual nodes for adapting wireline protocols to MANET;seed scheduling for peer-to-peer networks;proximity-aware distributed mutual exclusion for effective peer-to-peer replica management;towards improved overlay simulation using realistic topologies;analysis of round-robin implementations of processor sharing, including overhead;comparison of price-based static and dynamic job allocation schemes for grid computing systems;a rule based co-operative approach for cell selection in high speed cellular networks;sharing private information across distributed databases;energy-aware prefetching for parallel disk systems;attribute-based prevention of phishing attacks;TTM based security enhancement for inter-domain routing protocol;and introducing probability in RFID reader-to-reader anti-collision.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Case Study on System-Level Modeling by Aspect-Oriented Programming

A Case Study on System-Level Modeling by Aspect-Oriented Pro...

引用

10th international symposium on Quality Electronic Design

作者： Liu, Feng Mohamed, Otmane Ait Song, Xiaoyu Tan, Qingping National Lab of Parallel Distributed Processing Hunan China ECE department Concordia University Montreal QC Canada ECE department Portland State University Portland OR United States

ISBN: (纸本)9781424429523

The paper presents a novel and synergistic system-level modeling approach based on aspect-oriented programming (AOP) and SystemC. A case study on a 128-bit binary floating-point adder is performed to demonstrate the modeling strength of the approach. The validation experiment shows the effectiveness of the proposed approach. This work constitutes a first attempt to employ AOP in modeling digital systems.

关键词： System-Level Modeling AOP SystemC

来源：评论

学校读者我要写书评

暂无评论

Shared Transaction Markov Chains for Fluid Analysis of Massively parallel systems

Shared Transaction Markov Chains for Fluid Analysis of Massi...

引用

17th IEEE international symposium on Modeling, Analysis and Simulation of Computer and Telecommunication systems

作者： Hayden, Richard Bradley, Jeremy T. Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2BZ England

ISBN: (纸本)9781424449262

We introduce a low-level performance modelling formalism, Shared Transaction Markov Chains (STMCs), specifically designed for the capture and analysis of massively parallel stochastic systems through fluid techniques. We introduce the notion of a shared transaction between concurrently running Markov chains which allows a multi-phase synchronisation to accurately represent complex cooperation between modelling components in a compositional manner. We demonstrate the new modelling formalism on four distinct models and show how fluid analysis may be performed, with results, where appropriate. Our contribution is that this is the first such system tailored to the fluid performance analysis of transaction-based systems as found in computing applications such as peer-to-peer networks, web architectures and Publish-Subscribe networks. The second contribution is that STMCs permit composed phase-type distributed synchronisation which is more useful from a transaction modelling perspective.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

distributed Scheduling of parallel Hybrid Computations

Distributed Scheduling of Parallel Hybrid Computations

引用

20th international symposium on Algorithms and Computations (ISAAC 2009)

作者： Agarwal, Shivali Narang, Ankur Shyamasundar, Rudrapatna K. IBM India Res Lab New Delhi India Tata Inst Fundamental Res Bombay Maharashtra India

ISBN: (纸本)9783642106309

Multicore computing is fast becoming the norm. Improving parallel programming productivity without compromising performance on multicores is a serious challenge facing research community and systems vendors. Towards this end, efficient run-time scheduling of parallel programs helps programmer by dynamically mapping tasks onto processors and scheduling them in appropriate order. distributed scheduling of parallel computations on multiple places' while ensuring low time and message complexity in bounded space is a very challenging problem. We attempt to address this challenge for hybrid parallel computations which contain tasks that have pre-specified affinity to a place and also tasks that can be mapped to any place in the system. This paper presents online distributed scheduling algorithms for hybrid parallel computations assuming both unconstrained and bounded space per place. We also present the time and message complexity for distributed scheduling of hybrid computations. To the best of our knowledge, this is the first time distributed scheduling algorithms for hybrid parallel computations have been presented and analyzed for time and message bounds under both unconstrained space and bounded space.

关键词： Work Stealing Scheduling Multithreaded Computation Algorithm

来源：评论

学校读者我要写书评

暂无评论

Run-time conformance checking of mobile and distributed systems using executable models

Run-time conformance checking of mobile and distributed syst...

引用

7th Workshop on parallel and distributed systems: Testing, Analysis, and Debugging, PADTAD '09, in conjunction with the international symposium on Software Testing and Analysis, ISSTA 2009

作者： Saifan, Ahmad A. Posse, Ernesto Dingel, Juergen School of Computing Queen's University Kingston ON Canada

ISBN: (纸本)9781605586557

This paper describes an approach for conformance testing of mobile and distributed systems. The approach is based on kiltera - a novel, high-level language supporting the description and execution of models of concurrent, mobile, distributed, and timed computation. In our approach, a kiltera model of the system is constructed from a high-level model which describes system behavior using, e.g., a suitable UML profile. Check points are identified in the implementation under test (IUT) and the kiltera model and both are instrumented appropriately at these check points. During execution, relevant information flows from the IUT to the kiltera model which signals any non-conformance detected. Unique features of our approach include the support for mobility, distribution, time, dynamic creation and deletion of agents, and distributed monitoring. We describe the approach and a prototype implementation using a running example for illustration. Results of first, preliminary experiments are reported. Copyright 2009 ACM.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Of Choices, Failures and Asynchrony: The Many Faces of Set A...

引用

20th international symposium on Algorithms and Computations (ISAAC 2009)

作者： Alistarh, Dan Gilbert, Seth Guerraoui, Rachid Travers, Corentin Swiss Fed Inst Technol CH-1015 Lausanne Switzerland Technion Haifa Israel

ISBN: (纸本)9783642106309

Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal results in distributed computing. The complexity of set agreement in synchronous networks has also been a significant research challenge. Real systems, however, are neither purely synchronous nor purely asynchronous. Rather, they tend to alternate between periods of synchrony and periods of asynchrony. In this paper, we analyze the complexity of set agreement in a "partially synchronous" setting, presenting the first, (asymptotically) tight bound on the complexity of set;agreement in such systems. We introduce a novel technique for simulating, in fault-prone asynchronous shared memory, executions of an asynchronous and failure-prone message-passing system in which some fragments appear synchronous to some processes. We use this technique to derive a lower bound on the round complexity of set agreement in a partially synchronous system by a reduction from asynchronous wait-free set agreement. We also present an asymptotically matching algorithm that relies on a distributed asynchrony detection mechanism to decide as soon as possible during periods of synchrony. By relating environments with differing degrees of synchrony, our simulation technique is of independent;interest. In particular, it allows us to obtain a new lower bound on the complexity of early deciding k-set agreement complementary to that of [12], and to re-derive the combinatorial topology lower bound of [13] in an algorithmic way.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：