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

21st IEEE international Conference on parallel and distributed systems ICPADS

作者： Peake, Ian D. Vuyyuru, Abhijay Blech, Jan Olaf Vergnaud, Nicolas Fernando, Lasith RMIT Univ Melbourne Vic Australia Int Inst IT Bangalore Karnataka India

ISBN: (纸本)9780769557854

We present an architecture for cloud-based analysis of manufacturing environments and derived robot actions. We report on our implemented facility that combines visual cloud-based analysis of a robot environment and derived actions of robots plus appropriate means for human interaction with these cloud based services via hand gestures to interact with analysis results and robots. The facility will enable study of the software engineering of most-feasible combinations of human interaction interfaces with remote equipment.

关键词： software engineering Cloud-based automation

来源：评论

学校读者我要写书评

暂无评论

An Improved KM Algorithm for Computing Structural Index of DAE System

An Improved KM Algorithm for Computing Structural Index of D...

引用

12th international symposium on distributed Computing and Applications to Business, engineering and Science (DCABES)

作者： Zeng, Yan Wu, Xuesong Cao, Jianwen Chinese Acad Sci Inst Software Lab Parallel Software & Computat Sci Software Beijing 100190 Peoples R China

ISBN: (纸本)9780769550602

This paper proposes an improved KM algorithm to computing the structural index of linear time-invariant Differential Algebraic Equation (DAE) systems. The problem is of practical significance in index reduction based on structural index of DAE system and combinatorial relaxation theory. This improved KM algorithm combines greedy idea and classical KM algorithm. It first computes matches as much as possible using greedy technology, and then call KM algorithm to search the matches for the unmatched vertices during the step of greedy technology. The improved KM algorithm reduces the running time bound by a factor of r, the number of matches searched using greedy algorithm. Generally, the time complexity is O(r(2) + (n - r)n(2)), the optimal time is O(n(2)).

关键词： DAE Index Reduction Structural Index Bipartite Graph Greedy KM Algorithm

来源：评论

学校读者我要写书评

暂无评论

Numerical engineering:: design of PDE black-box solvers

引用

MATHEMATICS AND COMPUTERS IN SIMULATION 2000年第4-5期54卷 269-277页

作者： Schönauer, W Univ Karlsruhe Rech Zentrum D-76128 Karlsruhe Germany

The design of PDE black-box solvers (for nonlinear systems of elliptic and parabolic PDEs) needs many compromises between efficiency and robustness which we call 'Numerical engineering'. The requirements for a black-box solver are formulated and the way how to meet them is presented, guided by many years of practical experience in the design of the program packages FIDISOL/CADSOL, VECFEM and LINSOL. The basic approach to the new finite difference element method (FDEM) program package, an FDM on an unstructured FEM grid, is discussed. The common feature of all these methods is the error equation that allows a transparent balancing of all errors. The discretization errors are estimated from difference formulae of different consistency orders. The error balancing must include the iterative solution of the large and sparse linear systems by the LINSOL program package. The real challenge is the parallelization on distributed memory parallel computers which is solved by corresponding data structures with optimal communication patterns and redistribution after each grid refinement cycle. (C) 2000 IMACS. Published by Elsevier Science B.V. All rights reserved.

关键词： G4 mathematical software algorithm design and analysis efficiency parallel and vector implementations reliability and robustness

来源：评论

学校读者我要写书评

暂无评论

Dependability Evaluation of Middleware Technology for Large-scale distributed Caching 31

Dependability Evaluation of Middleware Technology for Large-...

引用

IEEE 31st international symposium on software Reliability engineering (ISSRE)

作者： Cotroneo, Domenico Natella, Roberto Rosiello, Stefano Univ Napoli Federico II Naples Italy

ISBN: (纸本)9781728198705

distributed caching systems (e.g., Memcached) are widely used by service providers to satisfy accesses by millions of concurrent clients. Given their large-scale, modern distributed systems rely on a middleware layer to manage caching nodes, to make applications easier to develop, and to apply load balancing and replication strategies. In this work, we performed a dependability evaluation of three popular middleware platforms, namely Twemproxy by Twitter, Mcrouter by Facebook, and Dynomite by Netflix, to assess availability and performance under faults, including failures of Memcached nodes and congestion due to unbalanced workloads and network link bandwidth bottlenecks. We point out the different availability and performance trade-offs achieved by the three platforms, and scenarios in which few faulty components cause cascading failures of the whole distributed system.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Patterns of GraphBLAS Algorithms: Tales from the Trenches

Patterns of GraphBLAS Algorithms: Tales from the Trenches

引用

32nd IEEE international parallel and distributed Processing symposium (IPDPS)

作者： McMillan, Scott Carnegie Mellon Univ Software Engn Inst Pittsburgh PA 15213 USA

ISBN: (纸本)9781538655559

During the years spent developing the GraphBLAS Template Library and then the C API Specification (in that order), I spent time developing algorithms using the interfaces to try and develop a better understanding (through this experimentation) of what could be achieved with the primitives. In this talk I will give a summary of what has been implemented, some lessons learned, and some patterns that have repeated in a number of instances.

关键词： software algorithms software engineering Geographic information systems distributed processing Conferences Libraries Research and development"

来源：评论

学校读者我要写书评

暂无评论

Experiences in Quantum software engineering

Experiences in Quantum Software Engineering

引用

37th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Scheerer, Max Klamroth, Jonas Garhofer, Simon Knable, Florian Denninger, Oliver FZI Res Ctr Informat Technol Karlsruhe Germany Univ Tubingen Embedded Syst Tubingen Germany Fraunhofer Inst Ind Engn IAO Stuttgart Germany

ISBN: (纸本)9798350311990

The field of Quantum Computing (QC) is increasingly becoming applicable for a wide range of computationally intensive problems. Especially Variational Quantum Algorithms (VQA) are promising as they allow dealing with the practical challenges of current quantum devices (also referred to as Noisy Intermediate-Scale Quantum devices). However, developing VQAbased solutions is not a straightforward process but involves several development phases, each with different design decisions and implications. In this paper, we share experiences made in developing VQA-based solutions for two different industrial case studies. Based on the solutions, we extracted five generic development phases quantum engineers must take into consideration when engineering quantum solutions. We have embedded the phases in a model (i.e. a phase model) to show their natural order and to illustrate the phases that require more development iterations. The main objective of this paper is not only to share and discuss our findings and experiences but also to provide the phase model as a starting point or guideline to structure the development process.

关键词： Quantum software engineering quantum computing quantum development model

来源：评论

学校读者我要写书评

暂无评论

A Framework for Designing and Evaluating distributed Real-Time Applications 14

A Framework for Designing and Evaluating Distributed Real-Ti...

引用

18th IEEE/ACM international symposium on distributed Simulation and Real Time Applications (DS-RT)

作者： Valadares, Arthur Lopes, Cristina Videira Univ Calif Irvine Bren Sch Informat & Comp Sci Irvine CA 92697 USA

ISBN: (纸本)9781479961436

distributed Real-Time (DRT) systems are among the most complex software systems in the field of Computer Science. The contradictory nature of distributed computing and real-time requirements forces prioritization that is dependent on domain-specific knowledge. This combination of distributed and real-time system requirements generates a new set of properties, and requires a new conceptual framework. In this paper, we present a conceptual framework for developing DRT systems. We divide our framework in 3 phases: example applications, design properties, and evaluation. We demonstrate our framework properties with our own distributed Virtual Environment architecture and other 2 examples: Google's Cluster Architecture and collision avoidance systems. Finally we discuss evaluation of DRT systems through the lens of our own architecture, and conclude with general lessons to apply to other DRT systems. Our conceptual framework enables developers of DRT systems to foresee and address issues early in the design. Additionally, we expose general lessons and good practices of evaluation for other DRT systems.

关键词： distributed processing DRT systems Google cluster architecture collision avoidance systems computer science design properties phase distributed computing distributed realtime applications distributed virtual environment architecture domain-specific knowledge evaluation phase example applications phase Fault tolerance Fault tolerant systems Hardware parallel processing Real-time systems Scalability Sensors Fault tolerant systems distributed computing real-time systems dead reckoning tracer computer science distributed processing parallel PROCESSING (COMPUTERS) Fault tolerance Scalability conceptual framework Computer hardware Sensors airborne anticollision system Beacon collision avoidance systems software systems

来源：评论

学校读者我要写书评

暂无评论

Profiling-based Adaptive Contention Management for software Transactional Memory

Profiling-based Adaptive Contention Management for Software ...

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： He, Zhengyu Yu, Xiao Hong, Bo Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

ISBN: (纸本)9780769546759

In software transactional memory (STM) systems, the contention management (CM) policy decides what action to take when a conflict occurs. CM is crucial to the performance of STM systems. However, the performance of existing CMs is sensitive to transaction workload and system platforms. A static policy is therefore unsatisfactory. In this paper, we argue that adaptive contention management is necessary and feasible. We further present a profiling-based method that can choose a suitable CM for a given workload and system platform during run-time. We also propose to use logic-time (transactional commit or abort events) to measure the profiling length and compare it with the traditional physical-time-based method. Experimental results demonstrate that our proposed adaptive contention manager (ACM) outperforms static CMs across benchmarks and platforms. In particular, the ACM that uses the number of aborts for the profiling length performs better than others.

关键词： Meltdown Platform Runtime Self tuning BENCHMARKS STACK TRITIUM MONITOR Scanning Tunneling Microscope Memory Memory computer software Workload Conflict (Psychology) computer programs

来源：评论

学校读者我要写书评

暂无评论

Integrated framework for development and execution of component-based Grid applications

Integrated framework for development and execution of compon...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd IEEE international parallel and distributed Processing symposium

作者： Getov, Vladimir Univ Westminster Harrow Sch Comp Sci London HA1 3TP England

ISBN: (纸本)9781424416936

Component-based software technologies have emerged as a modern approach to software development for distributed and Grid applications. However, the lack of longer-term experience and the complexity of the target systems demand more research results in the field. This paper provides an overview of three different approaches to developing component-based Grid applications. In order to re-use legacy codes, the wrapper software approach can be adopted in its two flavours - hand-written or automatically generated wrapper code. Another approach applicable to existing object-oriented software is to componentise the code by introducing appropriate modifications. The third approach is component-oriented development from scratch. We compare and contrast the three approaches and highlight their advantages and weaknesses.

关键词： software design

来源：评论

学校读者我要写书评

暂无评论

parallel Construction of Approximate kNN Graph

Parallel Construction of Approximate <i>k</i>NN Graph

引用

11th international symposium on distributed Computing and Applications to Business, engineering and Science (DCABES)

作者： Wang, Dilin Zheng, Yanmei Cao, Jianwen Chinese Acad Sci Lab Parallel Software & Computat Sci Software Inst Software Beijing 100190 Peoples R China

ISBN: (纸本)9780769548180

Building k-nearest neighbor (kNN) graphs is a necessary step in such areas as data mining and machine learning. So in this paper, we attempt to study the kNN furthermore, we first propose a parallel algorithm for approximate kNN graph construction and then apply the kNN graph to the application of clustering. Experiments show that our MPI/OpenMP mixed mode codes can make the construction of approximate kNN graph faster and make the parallelization and implementation easier. Finally, we compare the results of agglomerative clustering methods by using our parallel algorithm to illustrate the applicability of this method.

关键词： Approximate kNN MPI/OpenMP parallel algorithms Clustering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：