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

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： Ritter, Alan L. Hearne, James W. Nelson, Philip A. Computer Science Western Washington University BellinghamWA98225 United States

ISBN: (纸本)9781604236446

We discuss various methods which have been applied to grouping words into syntactic and semantic categories, primarily how they deal with the problems of sparsity and computational complexity. We then present a method of distributional clustering, and discuss the parallelization of the most computationally intensive part of this process. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Preface to the special issue on Formal Approaches to parallel and distributed systems 2018

引用

JOURNAL OF LOGICAL AND ALGEBRAIC MEthODS IN PROGRAMMING 2020年 116卷

作者： Loulergue, Frederic No Arizona Univ Sch Informat Comp & Cyber Syst Flagstaff AZ 86011 USA Univ Orleans INSA Ctr Val Loire LIFO EA 4022 Orleans France

this special issue contains extended versions of selected papers from the 5th international Symposium on Formal Approaches to parallel and distributed systems (4PAD 2018). the symposium was held in Orleans, France on July 19th, 2020 in conjunction with the 2018 international conference on High Performance computing & Simulation (HPCS 2018). (C) 2020 Elsevier Inc. All rights reserved.

关键词： distributed systems Synchronous and asynchronous communication Choregraphies CPU-GPU heterogeneous systems parallelism semantics Synthesis

来源：评论

学校读者我要写书评

暂无评论

Exercise management scheme for a distributed e-learning system

Exercise management scheme for a distributed e-learning syst...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Kawamura, Takao Kuramochi, Kazuo Sugahara, Kazunori Department of Information and Knowledge Engineering Tottori University 4-101 Koyama-Minami Tottori Japan

ISBN: (纸本)9780889867048

We have proposed and implemented a distributed asynchronous Web-based training (WBT) system. In order to improve the scalability and robustness of this system, all exercises and functions, such as scores user's answers are realized on mobile agents. these agents are distributed to computers, and they can be constructed with a P2P network that modified Content-Addressable Network (CAN). In this paper, we present the exercise management scheme for the proposed WBT system. In a WBT system based on client/server model, management of exercises is simply achieved by manipulating data, since all contents are concentrated in one server computer. In the proposed system, however, we need to pay attention to distributed agents for management of exercises. In order to achieve operation of exercise management, i.e., adding, deleting and updating exercises on the distributed WBT system, we use steps with considering multi-agent based distributed environment: specifying an agent which provides an exercise and searching its node as pre-operation, and sending an agent to the expected node and notifying other cooperating agents as post-operation.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

MSOMS: A meta simulation Framework for Optimizing Multidomain Simulation

MSOMS: A meta simulation Framework for Optimizing Multidomai...

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Khan, Moinul H. Georgia Inst Technol Austin TX 78739 USA

ISBN: (纸本)9780889866386

Complex system design and analysis requires simulations with different views or domains. Multi-domain simulation models typically are a collection of simulation model integrated through various means. these concurrent models may be implemented to be closely integrated or distributed as parallel-distributed simulation or mix of the two. Performance of a coupled simulation between multiple domain models depends on various factors. Some of them are, integration backplane architecture, messaging schemes, sharing scheme, level of coupling, fidelity of domain models etc. Framework for Optimizing Multidomain Simulation (MSOMS) is a framework which can be used to estimate performance and effectiveness of integration methods under various scenarios. the framework is referred as meta-simulation, since it is a "simulation of a simulation". this paper captures formulation and demonstration of MSOMS. We compared two possible implementations of a multi-domain model using MSOMS as a case study.

关键词： multidomain modeling HLA distributed simulation

来源：评论

学校读者我要写书评

暂无评论

A distributed peer-to-peer grid scheduler

A distributed peer-to-peer grid scheduler

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Liu, Cong Baskiyar, Sanjeev Wang, Chengjun Auburn Univ Auburn AL 36849 USA

ISBN: (纸本)9780889866386

In a grid computing environment, dynamicity, and geographically distributed sites, make task scheduling problems challenging to solve. It is hard for a local site to obtain precise real-time information about other sites given that specific information on a site such as load and computing resources may change rapidly. Moreover, in data grid environment, large scale data intensive applications make scheduling problems even more challenging since both computational and data storage resources must be taken into consideration. In this paper we propose an innovative peer-to-peer scheduler to solve these problems. this scheduler is distributed and scalable. We used simulation to evaluate the performance of the scheduler under different circumstances, such as different number of hops to search suitable sites and different number of incoming tasks. Results show that our scheduler can successfully schedule around 75% of incoming tasks within their deadlines in average. For computation-intensive tasks, it can successfully schedule more than 90% of incoming tasks.

关键词： data grid peer-to-peer scheduler distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

parallel molecular computation of modular-multiplication based on tile assembly model

Parallel molecular computation of modular-multiplication bas...

引用

19th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Li, Yongnan Xiao, Limin Ruan, Li Beihang Univ State Key Lab Software Dev Environm Beijing 100191 Peoples R China Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China

ISBN: (纸本)9781479920815

DNA computing is a new method for computation using the technology in molecular biology. the enormous parallel computing ability of DNA computing brings new opportunities and challenges to the development of cryptography. DNA cryptography is a cutting-edge sciences which combines classical cryptogram and molecular computing. Finite field GF(2(n)) is one of the most commonly used mathematic sets for cryptography. this paper proposes a parallel molecular computing system to compute the modular-multiplication, an operation combining multiplication and reduction, over finite field GF(2(n)). the operation of reduction is executed after the completion of the operation of multiplication. An instance of computing modular-multiplication is introduced to show the details of our system. the time complexity is theta(n) and the space complexity is theta(n(2)).

关键词： Modular-multiplication Tile assembly model Finite field GF(2(n)) DNA computing

来源：评论

学校读者我要写书评

暂无评论

Efficient support of fine-grained futures in Java

Efficient support of fine-grained futures in Java

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Zhang, Lingli Krintz, Chandra Soman, Sunil Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9780889866386

A future is a parallel programming language construct that enables programmers to specify potentially asynchronous computations. We present and empirically evaluate a novel implementation of futures for Java. Our futures implementation is a JVM extension that couples estimates of future computational granularity with underlying resource availability to enable automatic and adaptive decisions of when to spawn futures in parallel or to execute them sequentially. Our system builds from, combines. and extends (i) lazy task creation and (ii) a JVM sampling infrastructure previously used solely for dynamic and adaptive compilation. We empirically evaluate our system using different benchmarks, triggers for automatic spawning of futures, processor availability, and JVM configurations. We show that our future implementation for Java is efficient and scalable for fine-grained Java futures without requiring programmer intervention.

关键词： Java futures fine-grained parallel programming task scheduling profile-guided

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Approach to Tuning distributed Operating System Load Balancing Algorithms 19

Machine Learning Approach to Tuning Distributed Operating Sy...

引用

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： Meehan, J. Michael Ritter, Alan Computer Science Department Western Washington University BellinghamWA98225 United States

ISBN: (纸本)9781604236446

this work concerns the use of machine learning techniques (genetic algorithms) to optimize load balancing policies in the openMosix distributed operating system. Parameters/alternative algorithms in the openMosix kernel were dynamically altered/selected based on the results of a genetic algorithm fitness function. In this fashion optimal parameter settings and algorithms choices were sought for the loading scenarios used as the test cases. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

RHT: Supporting range queries in DHT-based P2P systems

RHT: Supporting range queries in DHT-based P2P systems

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Liu, Lintao Ryu, Kyung Dong Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA IBM Corp TJ Watson Res Ctr Hawthorne NY 10532 USA

ISBN: (纸本)9780889866386

An efficient range query processing support is required for distributed Hash Table (DHT)-based P2P networks as consistent hashing destroys the inherent order of numeric keys. In this paper, we present a lightweight and efficient mechanism, called Range Hash Tree (RHT), to support range queries on DHTs. In RHT, key space is partitioned into small ranges such that data items within one range can be stored on one node. To quickly resolve a range query, we introduce a scalable encoding algorithm that can represent the key space partitioning status with a small RHT Signature. Compared to other approaches, RHT provides a bounded query delay, which is independent of the size of range query and the number of matching data items. Our experiments show that RHT works efficiently on both uniform and much skewed data distributions.

关键词： range queries distributed Hash Table signature Peer-to-Peer distributed computing

来源：评论

学校读者我要写书评

暂无评论

A totally distributed iterative scheme for web services addressing and discovery

A totally distributed iterative scheme for web services addr...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Milanesio, M. Ruffo, G. Schifanella, R. Department of Computer Science University of Turin Torino Italy

ISBN: (纸本)9780889867048

Both web services framework and peer-to-peer networks provide a discovery process, but as current P2P systems focus more on the discovery of content in the form of common files (possibly associated with metadata), a centralized UDDI registry serves content in the form of metadata describing web services. thus, the intersection between P2P and Web services is clear, so that it recently gained lots of interest: there is the need of finding a way to exploit the high potential of web services without paying in terms of scalability or single-point-of-failures. Our aim in this paper is two-fold: on the one hand, we want to present a high level protocol for the addressing and the discovery of web services that is totally decentralized and based on a structured P2P topology. On the other hand, we introduce a way to solve the exact match key-based routing problem, that afflicts structured P2P systems. this model guarantees that all addressed web services will be discovered in a logarithmic number of hops, as it is based on a distributed Hash Table. One of the key innovation is the possibility of customizing the categorization of web services using tags, which are becoming very common in the so called Web 2.0.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：