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

11th International Conference on parallel and distributed computing, applications and technologies, pdcat 2010

作者： Gao, Lei Zeng, Guangzhou School of Computer Science and Technology Shandong University Jinan Shandong China

ISBN: (纸本)9780769542874

The distributed optimal path planning (D-OPP) problem has been a bottleneck restricting the performance of Peer-to-Peer (P2P) workflow systems which have met the development trend of workflow systems and been one of the most important domains of distributed computing. The essence of this problem is to solve the dynamical global optimization in local views without centralized mechanism. Aiming at this problem, an innovative hybrid P2P location network consisting of spanning graph location network (SGLN) and workload balancing network (WBN) is proposed based on a novel variable length coding which encodes the logical relationship of workflow model. SGLN achieves one hop routing complexity with 100% location precision and zero extra routing bandwidth at a coarse granularity. And WBN realizes an optimal decentralized dynamic task scheduling at a fine granularity by constructing a randomized network which can keep stable topology and a heuristic random sampling with fast converge at the optimal peers. The combination of SGLN and WBN provides an optimal solution to the D-OPP problem and a novel cooperative computing paradigm to distributed computing. © 2010 IEEE.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Commit protocols for a distributed transactional memory

Commit protocols for a distributed transactional memory

引用

11th International Conference on parallel and distributed computing, applications and technologies, pdcat 2010

作者： Müller, Marc-Florian Möller, Kim-Thomas Schöttner, Michael Institut für Informatik Heinrich-Heine-Universität Düsseldorf Universitätsstr. 1 40225 Düsseldorf Germany

ISBN: (纸本)9780769542874

Concurrency control in distributed and parallel applications has been studied for many years but is still an ongoing research topic. Transactional memory addresses this challenge for multicore processors by proposing to execute critical sections as restartable transactions combined with optimistic synchronization. Thus the programmer has not to reason about complex lock management and deadlocks. We believe that some of these ideas are also useful for distributed systems. Therefore, we are developing the Object Sharing Service (OSS) providing transparent data sharing for clusters and grids. OSS supports different consistency models for replica management within one application. In this paper we present the design and implementation of different transaction commit protocols for supporting transactional consistency. The main challenge of the resulting distributed transactional memory (DTM) is how to mask network latency allowing to commit transactions fast. Experiments with synthetic micro benchmarks and a MapReduce application on the Grid'5000 platform show that a DTM is efficiently providing strong consistency for shared data. © 2010 IEEE.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Wavelength assignment for parallel FFT communication pattern on linear arrays by lattice embedding

Wavelength assignment for parallel FFT communication pattern...

引用

6th International Conference on parallel and distributed computing, applications and technologies, pdcat 2005

作者： Chen, Yawen Shen, Hong Japan Advanced Institute of Science and Technology Asahidai 1-8 Nomi-Shi Ishikawa 923-1292 Japan

ISBN: (纸本)0769524052

Fast Fourier Transform(FFT) represents a common communication pattern shared by a large class of scientific and engineering problems and wavelength assignment is a key issue to increase efficiency and reduce cost in Wavelength Division Multiplexing (WDM) optical networks. In this paper, we propose a new scheme for the wavelength assignment of parallel FFT communication pattern on WDM linear arrays. By lattice embedding, the number of wavelengths required to realize parallel FFT communication pattern on WDM linear arrays significantly improves the known result. Our proposed embedding method also provides a new approach to the hypercube layout problem considering connections dimension by dimension rather than all connections as in the traditional approach. © 2005 IEEE.

关键词： Communication systems

来源：评论

学校读者我要写书评

暂无评论

A post-scheduling optimization algorithm of distributed real-time tasks

A post-scheduling optimization algorithm of distributed real...

引用

6th International Conference on parallel and distributed computing, applications and technologies, pdcat 2005

作者： Fang, Ming Yuan, You-Guang Liang, Hong-Tao College of Computer Science Harbin Engineering University Harbin 150001 China Wuhan Digital Engineering Institute Wuhan 430074 China

ISBN: (纸本)0769524052

To overcome the disadvantages of existing algorithms in scheduling distributed real-time tasks, this paper proposes a post-scheduling optimization algorithm (PSO) based on a novel structure called Scheduled Clusters Tree. As the experiments shows, PSO can minimize the number of required processors without affecting the optimal scheduling length generated by duplication-based algorithms, e.g., TDS or OSA algorithm. The time complexity of PSO algorithm is O(d|V|2) when TDS is adopted, or O(d2|V|2) when OSA is adopted. Where |V is the number of tasks and d is the maximum degree of tasks in the corresponding DAG. © 2005 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Enhancing attack survivability of Gnutella-like P2P networks by targeted immunization scheme

Enhancing attack survivability of Gnutella-like P2P networks...

引用

6th International Conference on parallel and distributed computing, applications and technologies (pdcat 2005)

作者： Huang, XL Li, Y Yang, RJ Ma, FY Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China

ISBN: (纸本)0769524052

Gnutella-like Peer-to-Peer Networks, due to their extreme connectivity fluctuations, are highly robust against random failures. However, such error tolerance comes at a high price of attack survivability. In this paper, to enhance such attack survivability, we propose a new formulation used for defense against deliberately attacks based on two leading concepts: cost and load The cost measures how expensive it is to cure an attacked or infected node, and the load measures how important a link between two nodes is when propagating attacks or updating immunization information reversely. The combination of these factors leads us to introduce the concept of optimal targeted immunization, which formalizes the ideas of minimizing the risk of epidemic outbreaks in these networks. Using this analysis framework, we then devise a novel efficient targeted immunization scheme. The simulation results under a realistic Gnutella network show that our immunization scheme outperforms other existing methods, producing an arresting increase of the network attack tolerance at a lower price of eliminating malicious attacks.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A performance study of task allocation algorithms in a distributed computing System (DCS)

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2003年第9期E86D卷 1611-1619页

作者： Sarker, BK Tripathi, AK Vidyarthi, DP Uehara, K Kobe Univ Grad Sch Sci & Technol Kobe Hyogo 6578501 Japan Banaras Hindu Univ Dept Comp Engn Varanasi 221005 Uttar Pradesh India Banaras Hindu Univ Dept Comp Sci Varanasi 221005 Uttar Pradesh India

A distributed computing System (DCS) contributes in proper partitioning of the tasks into modules and allocating them to various nodes so as to enable parallel execution of their modules by individual different processing nodes of the system. The scheduling of various modules on particular processing nodes may be preceded by appropriate allocation of modules of the different tasks to various processing nodes and then only the appropriate execution characteristic can be obtained. A number of algorithms have been proposed for allocation of tasks in a DCS. Most of the solutions proposed had simplifying assumptions. The very first assumption has been: consideration of a single task with their corresponding modules only;second, no consideration of the status of processing nodes in terms of the previously allocated modules of various tasks and third, the capacity and capability of the processing nodes. This work proposes algorithms for a realistic situation wherein multiple tasks with their modules compete for execution on a DCS dynamically considering their architectural capability. In this work, we propose two algorithms based on the two well-known A* and CA for the task allocation models. The paper explains the algorithms elaborately by illustrated examples and presents a comparative performance study among our algorithms and the algorithms for task allocation proposed in the various literatures. The results demonstrate that our CA based task allocation algorithm achieves better performance compared with the other algorithms.

关键词： distributed computing System (DCS) Inter-Module communication (IMC) Task Allocation (TA) Load and Multiple Task Allocation (MTA)

来源：评论

学校读者我要写书评

暂无评论

The anatomy study of load balancing in distributed system

The anatomy study of load balancing in distributed system

引用

7th International Conference on parallel and Distrubuted computing, applications and technologies

作者： Yan, K. Q. Wang, S. C. Chang, C. P. Tseni, L. Y. Chaoyang University of Technology Taiwan National Tsing Hua University Taiwan

ISBN: (纸本)9780769527369

In recent years, network bandwidth and quality has been drastically improved in a speed even much faster than the enhancement of computer performance. Various communication and computing tasks in the fields can be integrated and applied in a distributed system in nowadays. However, those resources are heterogeneous and dynamic in distributed systems connecting a broad range of resources. This study proposed a hybrid load balancing policy to maintain performance and stability of distributed system.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A distributed genetic algorithm with adaptive diversity maintenance for ordered problems 20

A distributed genetic algorithm with adaptive diversity main...

引用

20th International Conference on parallel and distributed computing, applications and technologies, pdcat 2019

作者： Ohira, Ryoma Islam, Md. Saiful School of Information Communication and Technology Griffith University Southport Australia

ISBN: (纸本)9781728126166

Maintaining population diversity is critical to the performance of a Genetic Algorithm (GA). Applying appropriate strategies for measuring population diversity is important in order to ensure that the mechanisms for controlling population diversity are provided with accurate feedback. Sequence-wise approaches to measuring population diversity have demonstrated their effectiveness in assisting with maintaining population diversity for ordered problems, however these processes increase the computational costs for solving ordered problems. Research in distributed GAs have demonstrated how applying different distribution models can affect an GA's ability to scale and effectively search the solution space. This paper proposes a distributed GA with adaptive parameter controls for solving ordered problems such as the travelling salesman problem(TSP), capacitated vehicle routing problem (CVRP) and the job-shop scheduling problem (JSSP). Extensive experimental results demonstrate the superiority of the proposed approach. © 2019 IEEE.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

A parallel pairwise alignment with pruning for large genomic sequences 18

A parallel pairwise alignment with pruning for large genomic...

引用

18th International Conference on parallel and distributed computing, applications and technologies, pdcat 2017

作者： Zhu, Xiangyuan Li, Bing Li, Kenli Shao, Ping Pan, Yi School of Computer Science Zhaoqing University Zhaoqing526061 China Department of Computer Science Georgia State University AtlantaGA30302 United States College of Information Science and Engineering Hunan University Changsha410082 China

ISBN: (纸本)9781538631515

Pairwise sequence alignment is a common and fundamental task in Computational Biology, which constitutes the basis for many Bioinformatics applications. In the post-genomic era, there is an increasing demand to align long DNA sequences to discover their functions. In this paper, we propose a parallel pairwise alignment algorithm for large genomic sequences by recursively dividing the whole genomic sequences into small pieces, with an effective pruning strategy to reduce search and computation space. We implemented rigorous tests on a 4-core computer using real genomic sequences and artificially generated sequences. The results show that our implementation can achieve speedup 10.64 with 99.75% accuracy compared to the sequential algorithm. As far as we know, this is the first time that MBP (mega base-pairs) sequences are globally aligned with an affine gap penalty. © 2017 IEEE.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

Using grid computing to enable distributed radar data retrieval and processing

Using grid computing to enable distributed radar data retrie...

引用

7th International Conference on parallel and Distrubuted computing, applications and technologies

作者： Arias, Diego Rivera, Wilson Univ Puerto Rico Dept Elect & Comp Engn Parallel & Distributed Comp Lab Mayaguez PR 00680 USA

ISBN: (纸本)9780769527369

We describe a tool that implements a set of services to manipulate and store data from a radar network in a transparent way to end users. A major requirement of this system is data availability and reliability. Consequently, we have implemented a redundancy schema based on the Information Dispersal Algorithm (IDA). Preliminary results show that the IDA based replication provides better reliability and less storage spending than traditional replication.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：