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

9th Working IEEE/IFIP Conference on Software Architecture (WICSA) on Architecture Across Boundaries/CompArch Conference

作者： Baresi, Luciano Guinea, Sam Politecn Milan Dipartimento Elettr & Informaz Milan Italy

ISBN: (纸本)9780769543512

distributed systems comprise a significant number of entities that must be properly coordinated to reach a goal. These systems present high turnover of elements, and demand for solutions that keep their coordination as decentralized as possible to avoid bottlenecks. The paper discusses why it is important to address these characteristics from a system's conception and proposes A-3, an innovative architectural solution that adopts the concept of group as an abstraction for organizing an application into semi-independent slices, providing a single and coherent view of these aggregates, and coordinating the interactions inside and among groups. The paper presents the A-3 model and defines it as an innovative architectural style, describes a Java-based framework that supports A-3 and provides users with the proper means to exploit the style, and exemplifies all the main concepts on a simple scenario where autonomous robotic vacuum cleaners are coordinated to properly clean a museum.

关键词： Software architecture distributed computing

来源：评论

学校读者我要写书评

暂无评论

Latency Modeling and Minimization for Large-scale Scientific Workflows in distributed Network Environments 44

Latency Modeling and Minimization for Large-scale Scientific...

引用

44th Annual Simulation Symposium (ANSS 2011) / Spring Simulation Multiconference (SpringSim '11)

作者： Wu, Qishi Gu, Yi Liao, Yuchen Lu, Xukang Lin, Yunyue Rao, Nageswara S. V. Univ Memphis Dept Comp Sci Memphis TN 38152 USA Oak Ridge Natl Lab Comp Sci & Math Div Oak Ridge TN 37831 USA

ISBN: (纸本)9781617828362

Large-scale e-science applications feature complex work-flows consisting of many computing modules. Mapping such workflows in distributed network environments and minimizing their latency are crucial to those applications that require fast system response and prompt user interaction. We model the time cost of each workflow component and design an efficient algorithm to compute the exact end-to-end delay of the entire workflow by explicitly accounting for the resource sharing dynamics. We further propose a workflow mapping approach to minimize the workflow latency using a recursive optimization procedure. The validity of the cost models and the accuracy of the latency computing algorithm are verified in comparison with an approximate solution, a dynamic system simulation program, and a workflow engine deployed in a real network. The performance superiority of the proposed mapping approach is illustrated by extensive simulation-based comparisons with existing algorithms.

关键词： Modeling latency workflow distributed computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Exchange of Information in a distributed Tracking Environment

Efficient Exchange of Information in a Distributed Tracking ...

引用

Conference on Signal Processing, Sensor Fusion, and Target Recognition XX

作者： Shea, Peter J. Blake, Eric Black River Syst Co Lakeville MN 55044 USA

ISBN: (纸本)9780819486240

Modern tracking and fusion settings involve multiple platforms in different locations, tracking different target tracks, focusing on different regions of interest, while using different update rates and sensor resolutions with the goal of providing increased situation awareness in the region by fusing together the diversity of information from each platform. In this paper, a decentralized, distributed fusion architecture is presented along with results and trade studies comparing performance to that of a centralized fusion architecture. The decentralized distributed architecture is designed to work with legacy tracking systems and uses an efficient message passing scheme to share information and coordinate tracks across a diverse group of platforms. This system does not rely on a central node and allows for track information to be maintained at the local level while utilizing track information from other platforms to increase situation awareness. We compare the performance between our distributed approach and a centralized system using simulated airborne sensors operating in overlapping regions of interest with target densities and routes chosen to demonstrate tradeoffs between the different architectures. Preliminary results show that the decentralized distributed system provides similar performance to the centralized fusion system in terms of situation awareness relative to traditional tracking metrics, but at the cost of using an increased communication bandwidth to provide frequent updates to neighboring platforms. Results demonstrate the tradeoff between flexibility and optimality - configuration of the distributed decentralized system to provide increased flexibility and robustness comes at the cost of reduced situation awareness as compared to the centralized system.

关键词： Sensors Data transmission Computer architecture Detection and tracking algorithms distributed computing Surveillance Target detection Computer simulations Telecommunications Network architectures

来源：评论

学校读者我要写书评

暂无评论

DisNet: A Framework for distributed Graph Computation

DisNet: A Framework for Distributed Graph Computation

引用

International Conference on Advances in Social Networks Analysis and Mining (ASONAM)

作者： Lichtenwalter, Ryan Chawla, Nitesh V. Univ Notre Dame Dept Comp Sci Notre Dame IN 46556 USA

ISBN: (纸本)9780769543758

With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring important properties of networks have asymptotic lower bounds that are quadratic, cubic, or higher in the number of vertices. For analysis of social networks, transportation networks, communication networks, and a host of others, computation is intractable. In these networks computation in serial fashion requires years or even decades. Fortunately, these same computational problems are often naturally parallel. We present here the design and implementation of a master-worker framework for easily computing such results in these circumstances. The user needs only to supply two small fragments of code describing the fundamental kernel of the computation. The framework automatically divides and distributes the workload and manages completion using an arbitrary number of heterogeneous computational resources. In practice, we have used thousands of machines and observed commensurate speedups. Writing only 31 lines of standard C++ code, we computed betweenness centrality on a network of 4.7M nodes in 25 hours.

关键词： Algorithm design and analysis Approximation algorithms C++ language Data structures DisNet Instruction sets Libraries Parallel processing Writing asymptotic lower bounds betweenness centrality communication network analysis distributed computing distributed graph computation graph algorithm graph algorithms graph theory heterogeneous computational resources map-reduce master-worker framework network science network theory (graphs) parallel algorithms parallel processing social network analysis standard C++ code transportation network analysis

来源：评论

学校读者我要写书评

暂无评论

Evaluating the performance of distributed approaches for modal identification

Evaluating the performance of distributed approaches for mod...

引用

Conference on Sensors and Smart Structures Technologies for Civil, Mechanical, and Aerospace Systems 2011

作者： Krishnan, Sriram S. Sun, Zhuoxiong Irfanoglu, Ayhan Dyke, Shirley J. Yan, Guirong Purdue Univ Sch Mech Engn W Lafayette IN 47906 USA Purdue Univ Sch Civil Engn W Lafayette IN 47906 USA Univ Western Sydney Penrith NSW 1797 Australia

ISBN: (纸本)9780819485434

In this paper two modal identification approaches appropriate for use in a distributed computing environment are applied to a full-scale, complex structure. The natural excitation technique (NExT) is used in conjunction with a condensed eigensystem realization algorithm (ERA), and the frequency domain decomposition with peak-picking (FDD-PP) are both applied to sensor data acquired from a 57.5-ft, 10 bay highway sign truss structure. Monte-Carlo simulations are performed on a numerical example to investigate the statistical properties and sensitivity to noise of the two distributed algorithms. Experimental results are provided and discussed.

关键词： Modal Identification distributed computing FDD ERA

来源：评论

学校读者我要写书评

暂无评论

A distributed Multi-Channel Demand-Adaptive P2P VoD System with Optimized Caching and Neighbor-Selection

A Distributed Multi-Channel Demand-Adaptive P2P VoD System w...

引用

Conference on Applications of Digital Image Processing XXXIV

作者： Zhang, Hao Chen, Minghua Parekh, Abhay Ramchandran, Kannan Univ Calif Berkeley Dept EECS Berkeley CA 94720 USA Chinese Univ Hong Kong Dept Informat Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9780819487452

We design a distributed multi-channel P2P Video-on-Demand (VoD) system using "plug-and-play" helpers. Helpers are heterogenous "micro-servers" with limited storage, bandwidth and number of users they can serve simultaneously. Our proposed system has the following salient features: (1) it jointly optimizes over helper-user connection topology, video storage distribution and transmission bandwidth allocation;(2) it minimizes server load, and is adaptable to varying supply and demand patterns across multiple video channels irrespective of video popularity;and (3) it is fully distributed and requires little or no maintenance overhead. The combinatorial nature of the problem and the system demand for distributed algorithms makes the problem uniquely challenging. By utilizing Lagrangian decomposition and Markov chain approximation based arguments, we address this challenge by designing two distributed algorithms running in tandem: a primal-dual storage and bandwidth allocation algorithm and a "soft-worst-neighbor-choking" topology-building algorithm. Our scheme provably converges to a near-optimal solution, and is easy to implement in practice. Packet-level simulation results show that the proposed scheme achieves minimum sever load under highly heterogeneous combinations of supply and demand patterns, and is robust to system dynamics of user/helper churn, user/helper asynchrony, and random delays in the network.

关键词： Video Computer simulations Clocks Algorithms Detection and tracking algorithms distributed computing Internet Switches Switching Lithium

来源：评论

学校读者我要写书评

暂无评论

Proteins Separation in distributed Environment Computation

引用

11th International Conference on Computational Science and Its Applications (ICCSA)

作者： Chau, Ming Garcia, Thierry Spiteri, Pierre Adv Solut Accelerator 199 Rue Oppidum F-34170 Castelnau Le Lez France INP ENSEEIHT IRIT BP 7122 F-31071 Toulouse France

ISBN: (纸本)9783642218866;9783642218873

In the present study we consider the parallel simulation on a peer-to-peer demonstrator for the computation of a 3D differential equations, which model the behavior of the continuous-flow electrophoresis problem. The physical model considered is constituted by the Navier-Stokes equation coupled with a convection-diffusion equation and a Laplacian equation. By using appropriate discretization of the coupled boundary value problems, we can prove the convergence of synchronous and more generally asynchronous relaxation methods. Finally parallel experiments on the peer-to-peer demonstrator are presented and analyzed.

关键词： Parallel computing distributed computing continuous-flow electrophoresis asynchronous iteration PISO algorithm

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Deployment Strategy and Performance Evaluation of LCG File Catalog Service

引用

JOURNAL OF GRID computing 2011年第3期9卷 345-354页

作者： Mendez Munoz, Victor Amoros Vicente, Gabriel Kaci, Mohammed CSIC Mixed Inst Inst Fis Corpuscular IFIC Grid & E Sci Grp Valencia 46071 Spain Univ Valencia Valencia 46071 Spain

The LHC computing Grid (LCG) leads by CERN, has solved with the LCG File Catalog (LFC) the major problem of scaling the data management catalog. However, additional performance issues should be faced to deploy a painless catalog service. With this aim, we present a decentralized LFC server configuration, and its performance evaluation compared with the traditional LFC deployment. A performance analysis is shown, including not only the catalog server, but also analysing the client side overhead. We find that the LFC service has in the clients a relevant workload of the overall service. The experimental results show that the proposed LFC deployment for servers and clients, improves the performance of the service.

关键词： distributed computing Grid computing Performance Catalog

来源：评论

学校读者我要写书评

暂无评论

distributed computing task assignment and lightpath establishment (TALE)

Distributed computing task assignment and lightpath establis...

引用

High-Speed Networks Workshop

作者： Liu, Xin Wei, Wei Yu, Xiang Qiao, Chunming Wang, Ting SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA NEC Lab Amer Princeton NJ 08540 USA

ISBN: (纸本)9781424415809

For a future WDM network to efficiently support distributed computing applications that require both execution by multiple geographically separated computing nodes and data transferring between them, traditional approaches to establishing lightpaths between given source destination pairs are not sufficient because a computing task may be executed on any one of several computing nodes having the necessary resources. Therefore, lightpath establishment has to be considered jointly with task assignment to achieve best performance. In this paper, we design and evaluate approaches to the joint optimization of the task assignment and lightpath establishment (TALE) problem. We first formulate the off-line version of the TALE problem and then devise a branch and bound algorithm to obtain the minimum number of wavelengths required to support a set of given jobs. In addition, we propose efficient heuristics to deal with the TALE problem in both off-line and on-line versions. Finally, we demonstrate and compare the performances of proposed heuristics through simulation.

关键词： optical paths distributed computing wavelength division multiplexing network Branch and bound algorithms OFF LINE optimum performance Heuristics

来源：评论

学校读者我要写书评

暂无评论

A path to achieving a self-managed Grid middleware

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2011年第1期27卷 10-19页

作者： Nou, Ramon Julia, Ferran Hogan, Kevin Torres, Jordi Barcelona SuperComp Ctr Barcelona 08034 Spain Tech Univ Catalonia UPC Comp Architecture Dept Barcelona 08034 Spain

Tantamount to the overall performance delivered by a Grid environment is the quality of the middleware on which distributed Grid applications can run. Due to its complex nature, this middleware can be difficult to investigate in full detail and can also be problematic to tune efficiently, especially when running on a production type environment. Thanks to the BSC Monitoring Framework, a set of tools that can instrument and analyze Java applications as well as the entire system, we were able to undertake both global and fine-grained investigation into one of the most popular Grid middleware of the moment, Globus Toolkit 4. The steps taken, revealed some interesting findings and resulted in the detection of some job management problems in this middleware. Primarily, the main issue was that it was possible to reach a situation which caused jobs to be lost on the node due to an overloading amount of jobs being processed by the system. Again, the BSC-MF was used to investigate this issue further and helped extract a possible solution to prevent the node becoming a point of contention in the architecture. A simple but effective policy was formulated, which prioritized the finishing and acceptance of jobs over the response time and throughput, and was evaluated as a solution to the problem. It was determined that, due to the dynamic nature of the problem, it could be best resolved by adding self-managing capabilities to the middleware. Using the new policy, a prototype of an autonomous system was built and succeeded in allowing more jobs to be accepted and finished correctly. The improvement over the original GT4 middleware was significant and resulted in better performance by a factor of 30%. The path from investigation to development, as described in this paper, might serve as a guide to others involved in the field who are interested in extracting knowledge about a Grid node, extending the Grid middleware or adding self-managing behaviour to their applications. (C) 2010

关键词： MIDDLEWARE PROBLEM solving PERFORMANCE evaluation distributed computing COMPUTER systems COMPUTATIONAL grids (Computer systems) JAVA (Computer program language) SOFTWARE architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：