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

international symposium on object-oriented Real-Time Distributed computing

作者： Zhaoyu Liu Stephen S. Yau Dichao Peng Yin Yin University of North Carolina Charlotte Charlotte NC USA Arizona State University Tempe AZ USA

ISBN: (纸本)9780769531328

Recent years have witnessed the emergence and rapid growth of distributed service infrastructures such as mobile ad hoc networks, P2P, PlanetLab and Grids. In such distributed infrastructures, an entity needs to utilize the services provided by other entities or the infrastructures, where trust is an important factor. There exists a gap between current trust research focusing limitedly on specific applications and a systematic, adaptable and customizable trust framework. The first limitation of current research is the lack of characterizing service-specific trust features. The second limitation lies in the restricted evaluation formulae of trust values. The trust value formulae are usually drawn from a particular mathematical model and may not satisfy some desirable properties. The third limitation is the lack of flexibility and adaptability of trust models. In this paper a comprehensive trust model is presented to address these limitations and provide a trust-based environment for distributed service infrastructures. Our simulation results demonstrate the robustness of the trust model against various attacks.

关键词： object oriented modeling Mathematical model Distributed computing Mobile ad hoc networks Robustness Web services Performance evaluation Particle measurements Time measurement Security

来源：评论

学校读者我要写书评

暂无评论

Performance Measurements of a Contact Searching Algorithm for Solving Large Deformation Problems

Performance Measurements of a Contact Searching Algorithm fo...

引用

IEEE international symposium on High Performance computing Systems and Applications (HPCS)

作者： É. Chamberland C. Robitaille A. Fortin Departmentde mathématiquesetde statistique Universite Laval QUE Canada

Solving contact problems including friction effects in a parallel environment is still a challenge. In this kind of problems, a number of deformable objects interact with each other undergoing large deformations. A typical example is a tire on a road. The interacting objects can be totally distinct objects or parts of a given object interacting with itself. Contact searching, that is identifying potential contact points on other objects (or on itself), is an expensive task in terms of computational costs. In this presentation, an algorithm for solving contact problems including searching contact points in a parallel environment will be described and analysed. The algorithm presented is original and has no constraint on how the domain decomposition is done. The complexity of the resulting algorithm is higher but allows the use of automatic domain decomposition. We will study its performances as a function of the number of degrees of freedom and processors.

关键词： Measurement High performance computing Friction Tires Roads Computational efficiency Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient automated marshaling of C++ data structures for MPI applications

Efficient automated marshaling of C++ data structures for MP...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Wesley Tansey Eli Tilevich Department of Computer Science Virginia Technology Center for High-End Computing Systems

We present an automated approach for marshaling C++ data structures in high performance computing (HPC) applications. Our approach utilizes a graphical editor through which the user can express a subset of an object's state to be marshaled and sent across a network. Our tool, MPI serializer, then automatically generates efficient marshaling and unmarshaling code for use with the message passing interface (MPI), the predominant communication middleware for HPC systems. Our approach provides a more comprehensive level of support for C++ language features than the existing state of the art, and does so in full compliance with the C++ language standard. Specifically, we can marshal effectively and efficiently non-trivial language constructs such as polymorphic pointers, dynamically allocated arrays, non-public member fields, inherited members, and STL container classes. Additionally, our marshaling approach is also applicable to third party libraries, as it does not require any modifications to the existing C++ source code. We validate our approach through two case studies of applying our tool to automatically generate the marshaling functionality of two realistic HPC applications. The case studies demonstrate that the automatically generated code matches the performance of typical hand-written implementations and surpasses current state-of-the-art C++ marshaling libraries, in some cases by more than an order of magnitude. The results of our case studies indicate that our approach can be beneficial for both the initial construction of HPC applications as well as for the refactoring of sequential applications for parallel execution.

关键词： Data structures Programming profession Application software Libraries parallel programming High performance computing Middleware Productivity object oriented modeling Message passing

来源：评论

学校读者我要写书评

暂无评论

A Framework of Community Management with object Deputy Mechanism for IP Multimedia Subsystem

A Framework of Community Management with Object Deputy Mecha...

引用

symposium on Applications and the Internet (SAINT)

作者： Akio Yamamoto Yasuhiro Araki Michael Sweeney Hewlett Packard Laboratories USA

This paper presents an approach to the problem of community data management in the IP multimedia subsystem (IMS) environment. More specifically, it describes a framework of the community management with the use of object deputy data model, which is developed as a key component of the enhanced platform for IMS to provide group-centric, media-rich interactive services. Furthermore, on the basis of data management paradigm over hybrid peer-to-peer (P2P) network combined with the IMS architecture, we consider binding a database capability for the community management with each super-peer on the network. In addition, we introduce the concept of "public community identity" to identify each community on the IMS network and route a SIP request addressed to a specific community based on a set of filter criteria included in the user/service profile.

关键词： Communities Data models Peer to peer computing Mobile communication Multimedia communication IP networks object oriented modeling

来源：评论

学校读者我要写书评

暂无评论

Decentralized market-based resource allocation in a heterogeneous computing system

Decentralized market-based resource allocation in a heteroge...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： James Smith Edwin K. P. Chong Anthony A. Maciejewski Howard Jay Siegel Department of Electrical and Computer Engineering Colorado State University Fort Collins CO USA Mathematics Department Colorado State University Fort Collins CO USA Colorado State University Dept. of Electrical and Computer Engineering Fort Collins 80523-1373 USA

We present a decentralized market-based approach to resource allocation in a heterogeneous overlay network. The presented resource allocation strategy assigns overlay network resources to traffic dynamically based on current utilization, thus, enabling the system to accommodate fluctuating demand for its resources. We present a mathematical model of our resource allocation environment that treats the allocation of system resources as a constrained optimization problem. Our presented resource allocation strategy is based on solving the dual of this centralized optimization problem. The solution to the dual of our centralized optimization problem suggests a simple decentralized algorithm for resource allocation that is extremely efficient. Our results demonstrate the near optimality of the proposed approach through extensive simulation of a real-world environment. That is, the conducted simulation study utilizes components taken from a real-world middleware application environment and clearly demonstrates the practicality of the approach in a realistic setting.

关键词： Resource management Computer networks Service oriented architecture Educational technology Communication system traffic control Computer science Mathematics Active appearance model Telecommunication traffic Traffic control

来源：评论

学校读者我要写书评

暂无评论

Design-Pattern based parallel Programming Model and System Implementation

Design-Pattern based Parallel Programming Model and System I...

引用

The 4th international Conference on Wireless Communications, Networking and Mobile computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

作者： Huabei Wu School of Computer Science and Technology Tianjin University 92 Weijin Road Nankai District Tianjin 300072 PR of China

Design patterns make it easier to reuse successful designs and architectures. Expressing proven techniques as design patterns makes them more accessible to developers of new systems and helps a designer get a design faster. In sequential and object-oriented programming domain design patterns have played a very important role but in parallel programming the application of design patterns is very few. We propose a design-pattern based parallel programming model and implement a parallel programming environment in the SMP platform to help the developers to build their parallel application system efficiently. The experiment results show our system is effective and competent.

关键词： parallel programming Design pattern Higher order function Reusable component

来源：评论

学校读者我要写书评

暂无评论

Load balancing in the SOAJA web service platform

Load balancing in the SOAJA web service platform

引用

international Multiconference on Computer Science and Information Technology, IMCSIT

作者： Richard Olejnik Iyad Alshabani Bernard Toursel Eryk Laskowski Marek Tudruj Computer Science Laboratory of Lille (UMR CNRS 8022) University of Science and Technology of Lille France Polish Academy of Sciences Warsaw Poland Polish Japanese Institute of Information Technology Warsaw Poland

The aim of the service oriented adaptative Java applications (SOAJA) project is to develop a service-oriented infrastructure, which enables efficient running of Java applications in complex, networked computing Grid environments. The SOAJA environment provides components and services for static and dynamic load balancing based on Java object observation. SOAJA can be used to design large scale computing tasks to be executed based on idle time of processor nodes. Java distributed applications consist of parallel objects which SOAJA allocates to Grid nodes at runtime. In this paper, we present mechanisms and algorithms for automatic placement and adaptation of application objects, in response to evolution of resource availability. These mechanisms enable to control the granularity data processing and distribution of the application on the Grid platform.

关键词： Load management Web services Java Computer networks Grid computing Large-scale systems Runtime Availability Automatic control Data processing

来源：评论

学校读者我要写书评

暂无评论

Ontology Based Knowledge Processing Model

Ontology Based Knowledge Processing Model

引用

international symposium on Knowledge Acquisition and Modeling, KAM

作者： Lin Zhang Department of Computer and Information Engineering Wuhan Polytechnic University Wuhan Hubei China

The objective of knowledge processing system is to promote knowledge integration, sharing and retrieval in distributed and heterogeneous environment. This paper puts forward an ontology-based model-OBKPM for knowledge processing, which promises better access to relevant knowledge by producing a global domain ontology that is used for establishing semantic connections among the local ontologies of autonomous knowledge sources as well as for retrieving those sources. In OBKPM, a bottom-up integration approach with two-stage mapping process is proposed to solve both the semantic heterogeneities and the query answering problems. In this approach, local ontologies and the global ontology are all treated in graph-based representation, and the overall integration and access process will be briefly illustrated through examples.

关键词： Ontologies XML object oriented modeling Surface-mount technology File servers Knowledge acquisition Distributed computing Knowledge engineering Information retrieval Design methodology

来源：评论

学校读者我要写书评

暂无评论

Absolute Slicing in Peer-to-peer Systems

Absolute Slicing in Peer-to-peer Systems

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Alberto Montresor Roberto Zandonati University of Trento Italy

Peer-to-peer (P2P) systems are slowly moving from application-specific architectures to a generic service- oriented design framework. The idea is to allow a dynamic collection of P2P applications to cohabit into a single system, with applications starting and terminating at will, or even changing their requirements at run-time. This raises an interesting problem in connection with managing resource assignment in a large-scale, heterogeneous and unreliable environment. Recently, the distributed slicing service has been proposed to allow for an automatic partitioning of P2P networks into groups (slices) that represent a controllable amount of some resource. A particular instantiation of such service has been described, called ordered slicing, in which nodes are ranked based on some metrics and then assigned to a slice based on their position in the ranking. In this paper, we present an alternative version of the problem called absolute slicing. Here, the goal is to assign a specified number of nodes to a slice and maintain such assignment in spite of churn. We propose a simple algorithm that solves the problem by combining well-known protocols such as peer sampling and aggregation, and we experimentally evaluate its performance.

关键词： Peer to peer computing Protocols Sampling methods Runtime Application software environmental management Resource management Large-scale systems Automatic control Power system management

来源：评论

学校读者我要写书评

暂无评论

Collaborative object-oriented visualization environment

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2007年第2期32卷 209-234页

作者： Ryu, So-Hyun Kim, Hyung-Jun Park, Jin-Sung Kwon, Yong-won Jeong, Chang-Sung Korea Univ Dept Elect Engn Seoul 136701 South Korea

In this paper, we present a Collaborative object-oriented Visualization environment (COVE) which provides a flexible and extensible framework for collaborative visualization. COVE integrates collaborative and parallel computing environments based on a distributed object model. It is built as a collection of concurrent objects: collaborative and application objects which interact with one another to construct collaborative parallel computing environments. The former enables COVE to execute various collaborative functions, while the latter allows it to execute fast parallel visualization in various modes. Also, flexibility and extensibility are provided by plugging the proper application objects into COVE at run-time, and making them interact with one another through collaboration objects. For our experiment, three visualization modes for volume rendering are designed and implemented to support the fast and flexible analysis of volume data in a collaborative environment.

关键词： collaborative visualization parallel computing distributed object

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：