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

Organizational dynamics in adaptive distributed search processes: effects on performance and the role of complexity

Frontiers of Information Technology & Electronic Engineering 2016年第4期17卷 283-295页

作者： Friederike WALL Department of Controlling and Strategic Management Alpen-Adria-Universitaet Klagenfurt

In this paper, the effects of altering the organizational setting of distributed adaptive search processes in the course of search are investigated. We put particular emphasis on the complexity of interactions between partial search problems assigned to search agents. Employing an agent-based simulation based on the framework of NK landscapes we analyze different temporal change modes of the organizational set-up. The organizational properties under change include, for example, the coordination mechanisms among search agents. Results suggest that inducing organizational dynamics has the potential to increase the effectiveness of distributed adaptive search processes with respect to various performance measures like the final performance achieved at the end of the search, the chance to find the optimal solution of the search problem, or the average performance per period achieved during the search process. However, results also indicate that the mode of temporal change in conjunction with the complexity of the search problem considerably affects the order of magnitude of these beneficial effects. In particular, results suggest that organizational dynamics induces a shift towards more exploration, i.e., discovery of new areas in the fitness landscape, and less exploitation, i.e., stepwise improvement.

关键词： Agent-based simulation Complexity Coordination distributed search NK landscapes

来源：评论

学校读者我要写书评

暂无评论

Supply Chain Coordination Using an Adaptive distributed search Strategy

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS 2012年第6期42卷 1424-1438页

作者： Gaudreault, Jonathan Pesant, Gilles Frayret, Jean-Marc D'Amours, Sophie Univ Laval FORAC Res Consortium Quebec City PQ G1V 0A6 Canada Ecole Polytech Montreal PQ H3T 1J4 Canada

A tree search strategy is said to be adaptive when it dynamically identifies which areas of the tree are likely to contain good solutions, using information that is gathered during the search process. This study shows how an adaptive approach can be used to enhance the efficiency of the coordination process of an industrial supply chain. The result is a new adaptive method (called the adaptive discrepancy search), intended for search in nonbinary trees, and that is exploitable in a distributed optimization context. For the industrial case studied (a supply chain in the forest products industry), this allowed reducing nearly half the time needed to obtain the best solution in comparison with a standard nonadaptive method. The method has also been evaluated for use with synthesized problems in order to validate the results that are obtained and to illustrate different properties of the algorithm.

关键词： Adaptive search discrepancy distributed search multiagent supply chain coordination

来源：评论

学校读者我要写书评

暂无评论

distributed search of learning objects into the Lor@ architecture

Distributed search of learning objects into the Lor@ archite...

引用

7th IASTED International Conference on Web-Based Education, WBE 2008

作者： Berenguer, Nuria Gomis Paton, Felipe Casanova Navarro, Leonel Iriarte Peco, Pedro Pernías Such, Manuel Marco Department of Languages and Computer Science University of Alicante Carretera San Vicente del Raspeig s/n 03690 San Vicente del Raspeig - Alicante Spain Department of Computer Science Agrarian University of Havana Autopista Nacional y Carretera de Tapaste San José de las Lajas La Habana Cuba. Apartado 18-19 Cuba

ISBN: (纸本)9780889867239

In this article we have studied the different types of current educational material searchers to try and discover their deficiencies and then try to solve them. With this aim we suggest a distributed search model for learning objects according to their metadata. We will also present an implementation of such model in Lor@ architecture.

关键词： distributed search E-learning Free software Learning objects Open content

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed search solution for federated cloud

引用

distributed AND PARALLEL DATABASES 2017年第3-4期35卷 411-433页

作者： Zhu, Yongqing Xu, Quanqing Shi, Haixiang Samsudin, Juniarto ASTAR Data Storage Inst Singapore Singapore

Federated cloud enables data sharing across different organizations. This paper proposes a distributed search index (DS-index) solution to provide distributed search capability in federated cloud, with the target to support multi-attribute range queries with secondary indexes. DS-index deploys a three-layer architecture with a multi-attribute index overlay, a tree-based P2P network layer, and a federated cloud layer. We present a distributed search algorithm with the three-layer architecture. In order to facilitate distributed search, we propose a dynamic mapping algorithm for DS-index to map between different layers. In addition, a Markov Chain-based cost model is defined to facilitate node selection and mapping. With the dynamic mapping algorithm and cost model, the proposed DS-index solution is more cost-effective than the traditional P2P networks as it can reduce the network cost in terms of index maintenance cost and node selection cost. The experiments demonstrate that, our DS-index solution along with its cost model can save the computation resource and reduce network bandwidth consumption by around 30% comparing to the one without cost model. It can also reduce the number of node splits/merges by around 20% comparing to the state-of-the-art solution.

关键词： distributed search Federated cloud Secondary index Mapping algorithm Cost model Peer-to-peer network

来源：评论

学校读者我要写书评

暂无评论

NetSHa: In-Network Acceleration of LSH-Based distributed search

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2022年第9期33卷 2213-2229页

作者： Zhang, Penghao Pan, Heng Li, Zhenyu Cui, Penglai Jia, Ru He, Peng Zhang, Zhibin Tyson, Gareth Xie, Gaogang Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Purple Mt Labs Nanjing 211111 Peoples R China ByteDance Inc Beijing 100089 Peoples R China Queen Mary Univ London London E1 4NS England Chinese Acad Sci Comp Network Informat Ctr Beijing 100045 Peoples R China

Locality Sensitive Hashing (LSH) is widely adopted to index similar data in high-dimensional space for approximate nearest neighbor search. Demanding applications (e.g. web search) mean that LSH must exhibit low response times and high throughput. To achieve this, they tend to load balance between multiple machines. However, as the scale of concurrent queries and the volume of data grow, large numbers of index messages are required. Hence, the network is a key bottleneck. To address this gap, we propose NetSHa, which exploits the computational capacity of programmable switches. Specifically, we introduce a heuristic sort-reduce approach to drop potentially poor candidate answers while preserving search quality. Then, NetSHa aggregates good candidate answers from different index messages when transmitting them. Through this, it reduces the network communication cost. Furthermore, we introduce a best-effort replacement mechanism to improve its concurrency. We implement NetSHa on a Barefoot Tofino programmable switch and evaluate it using 7 real-world datasets. The experimental results show that NetSHa reduces the packet volume by 4 similar to 10 times and improves the search efficiency by least 3x in comparison with typical LSH-based distributed search frameworks.

关键词： Servers Indexes Costs Task analysis Hash functions Concurrent computing Aggregates Local sensitive hashing distributed search in-network computation

来源：评论

学校读者我要写书评

暂无评论

A performance analysis of transposition-table-driven work scheduling in distributed search

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2002年第5期13卷 447-459页

作者： Romein, JW Bal, HE Schaeffer, J Plaat, A Vrije Univ Amsterdam Fac Sci Dept Math & Comp Sci NL-1081 HV Amsterdam Netherlands Univ Alberta Dept Comp Sci Edmonton AB T6G 2H1 Canada

This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposition table at the heart of the parallel work scheduling. The scheme results in less synchronization overhead, less processor idle time, and less redundant search effort. Measurements on a 128-processor parallel machine show that the scheme achieves close-to-linear speedups;for large problems the speedups are even superlinear due to better memory usage. On the same machine, the algorithm is 1.6 to 12.9 times faster than traditional work-stealing-based schemes.

关键词： distributed search single-agent search work pushing transposition-table-driven work scheduling (TDS) IDA

来源：评论

学校读者我要写书评

暂无评论

Scalability Analysis of distributed search in Large Peer-to-peer Networks 4

Scalability Analysis of Distributed Search in Large Peer-to-...

引用

4th IEEE International Conference on Big Data (Big Data)

作者： Ke, Weimao Mostafa, Javed Drexel Univ Coll Comp & Informat Philadelphia PA 19104 USA Univ N Carolina Sch Informat & Lib Sci Chapel Hill NC 27599 USA

ISBN: (纸本)9781467390057

We study decentralized searches in large-scale, self-organized peer-to-peer networks and investigate the influences of network size and degree distribution (neighborhood size) on search efficiency. Experimental results show that searches are efficient and scalable in large networks, especially with large neighborhood sizes (degrees). Analysis of the data supports a proposed scalability model, in which search path length L (efficiency) is proportional to a poly-logarithmic function of network size N, with degree dm (majority neighborhood size) as the log base. The model explains 90% (R-2) of variances in search path lengths. search time (search path length) predicted by the model shows great potential for efficient searches in real-scale networks of up to a billion distributed systems.

关键词： distributed search Scalability Efficiency Peer-to-peer networks Decentralization

来源：评论

学校读者我要写书评

暂无评论

NetANNS: A High-Performance distributed search Framework Based On In-Network Computing 19

NetANNS: A High-Performance Distributed Search Framework Bas...

引用

19th IEEE International Symposium on Parallel and distributed Processing with Applications (IEEE ISPA)

作者： Zhang, Penghao Pan, Heng Li, Zhenyu Xie, Gaogang Cui, Penglai Chinese Acad Sci Inst Comp Technol Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China Purple Mt Labs Nanjing Peoples R China Chinese Acad Sci Comp Network Informat Ctr Beijing Peoples R China

ISBN: (纸本)9781665435741

Approximate nearest neighbor search (ANNS) is the most basic and important algorithm in Database, Machine Learning and other applications. With the expansion of cloud computing, the academia focuses on the study of how to optimize distributed frameworks based on approximate nearest neighbor search such as MapReduce, and Memcached. We implement a new distributed ANNS search framework (NetANNS). The main contributions of NetANNS are to accelerate the data preprocessing with programmable switch, and integrate a variety of efficient ANNS algorithms so that it can choose the most suitable algorithm for each datasets. The experiments show that the search efficiency of NetANNS is about 2x than the common distributed ANNS frameworks which are implemented based on the framework of MapReduce.

关键词： approximate nearest neighbor search distributed search in-network computation

来源：评论

学校读者我要写书评

暂无评论

Visual Analysis of distributed search Traffic in a Peer-to-peer Network 10

Visual Analysis of Distributed Search Traffic in a Peer-to-p...

引用

10th International Conference on Communication Software and Networks (ICCSN)

作者： Ke, Weimao Drexel Univ Coll Comp & Informat Philadelphia PA 19104 USA

ISBN: (纸本)9781538672242

We study distributed searches in fully decentralized peer-to-peer networks. This papers reports on a study that aims to understand the robustness and load balancing of a distributed search network. We focus on a visual analysis of search traffic, load distribution, and edge density when the network experiences adversaries. The analysis reveals that the network tends to rely more heavily on an even smaller portion of nodes for searches when an increasing number of nodes become unavailable. In the meanwhile, nodes become more exploratory and tend to engage more of those previously unutilized. The trade-off between a more skewed traffic distribution and a greater edge density in related scenarios is important to the robustness of the network and requires further ***

关键词： distributed search robustness load balancing effciency peer-to-peer networks decentralization

来源：评论

学校读者我要写书评

暂无评论

Web service architectures for distributed search in databases

Web service architectures for distributed search in database...

引用

2nd IEEE International Conference on Intelligent Systems

作者： Ivanova, E Bulgarian Acad Sci Inst Comp & Commun Syst BU-1113 Sofia Bulgaria

Web Service technologies are applied to obtain selective search in distributed databases. Two Web Service architectures are proposed for distributed search. An application with this functionality is described.

ISBN: (纸本)0780382781

关键词： database distributed search Web services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：