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

Managing large distributed dynamic graphs for smart city network applications

APPLIED NETWORK SCIENCE 2019年第1期4卷 1页

作者： Voloch, Nadav Voloch-Bloch, Noa Zadok, Yair Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Ctr Acad Studies Dan Sch High Tech Studies Hayotsrim 2 IL-6021816 Or Yehuda Israel

Smart cities and traffic applications can be modelled by dynamic graphs for which vertices or edges can be added, removed or change their properties. In the smart city or traffic monitoring problem, we wish to detect if a city dynamic graph maintains a certain local or global property. Monitoring city large dynamic graphs, is even more complicated. To treat the monitoring problem efficiently we divide a large city graph into sub-graphs. In the distributed monitoring problem we would like to define some local conditions for which the global city graph G maintains a certain property. Furthermore, we would like to detect if a local city change in a sub-graph affect a global graph property. Here we show that turning the graph into a non-trivial one by handling directed graphs, weighted graphs, graphs with nodes that contain different attributes or combinations of these aspects, can be integrated in known urban environment applications. These implementations are demonstrated here in two types of network applications: traffic network application and on-line social network smart city applications. We exemplify these two problems, show their experimental results and characterize efficient monitoring algorithms that can handle them.

关键词： Graph theory distributed and parallel computing Large dynamic graphs Geographic graph applications Fastest path problem On-line social networks

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms over communicating membrane systems

引用

BIOSYSTEMS 2003年第2期70卷 123-133页

作者： Ciobanu, G Natl Univ Singapore Sch Comp Dept Comp Sci Singapore 119260 Singapore

This paper presents fundamental distributed algorithms over membrane systems with antiport carriers. We describe distributed algorithms for collecting and dispersing information, leader election in these systems, and the mutual exclusion problem. Finally, we consider membrane systems producing correct results despite some failures at some of the components or the communication links. We show that membrane systems with antiport carriers provide an appropriate model for distributed computing, particularly for message-passing algorithms interpreted here as membrane transport in both directions, namely when two chemicals behave as input and output messages and pass the membranes in both directions using antiport carriers. (C) 2003 Elsevier Science Ireland Ltd. All rights reserved.

关键词： membrane systems antiport carriers distributed and parallel computing broadcast convergecast flooding leader election mutual exclusion fault tolerance consensus

来源：评论

学校读者我要写书评

暂无评论

Teams of autonomous agents for job-shop scheduling problems: An experimental study

引用

JOURNAL OF INTELLIGENT MANUFACTURING 2004年第4期15卷 455-462页

作者： Aydin, ME Fogarty, TC S Bank Univ Sch Comp Informat Syst & Math London SE1 0AA England

ATeams-teams of autonomous agents co-operating by sharing solutions through a common-memory have been proposed as a means of solving combinatorial optimization problems. In this paper, the ATeam architecture is tested on the job-shop scheduling problem. The results show that the method can work, but that it depends on the portfolio of agents and on the way in which the memory is managed.

关键词： multi-agent systems distributed and parallel computing simulated annealing taboo search

来源：评论

学校读者我要写书评

暂无评论

Garbage collection in object oriented condensed graphs

引用

7th International Conference on parallel Processing and Applied Mathematics

作者： John, Sunil Morrison, John P. Natl Univ Ireland Univ Coll Cork Dept Comp Sci Ctr Unified Comp Cork Ireland

ISBN: (纸本)9783540681052

Even though Object Orientation has been proven to be an effective programming paradigm for software development, it has not been shown to be an ideal solution for the development of large scale parallel and distributed systems. There are a number of reasons for this: the parallelism and synchronisation in these systems has to be explicitly managed by the programmer;few Object Oriented languages have implicit support for Garbage Collection in parallel applications;and the state of a systems of concurrent objects is difficult to determine. In contrast, the Condensed Graph model provides a way of explicitly expressing parallelism but with implicit synchronisation;its implementation in the Web-Com system provides for automatic garbage collection and the dynamic state of the application is embodied in the topology of the Condensed Graph. These characteristics free programmers from the difficult and error prone process of explicitly managing parallelism and thus allows them to concentrate on expressing a solution to the problem rather than on its low level implementation. Object Oriented Condensed Graphs are a computational paradigm which combines Condensed Graphs with object orientation and this unified model leverages the advantages of both paradigms. This paper illustrates the Garbage Collection mechanism of Object Oriented Condensed Graphs as well as its basic concepts.

关键词： condensed graphs object oriented systems software engineering distributed and parallel computing

来源：评论

学校读者我要写书评

暂无评论

Teams of autonomous agents for job-shop scheduling problems: An experimental study

Teams of autonomous agents for job-shop scheduling problems:...

引用

3rd International Symposium on Intelligent Manufacturing Systems

作者： Aydin, ME Fogarty, TC S Bank Univ Sch Comp Informat Syst & Math London SE1 0AA England

关键词： multi-agent systems distributed and parallel computing simulated annealing taboo search

来源：评论

学校读者我要写书评

暂无评论

distributed parallelization of Greedy Mobile Network Optimization Algorithms

Distributed Parallelization of Greedy Mobile Network Optimiz...

引用

21st International Conference on Software, Telecommunications and Computer Networks (SoftCOM)

作者： Ye, Yuanzhou Cadenas, Oswaldo Megson, Graham Univ Reading Sch Syst Engn Arieso Ltd Reading Berks England Univ Westminster Sch Elect & Comp Sci London England

ISBN: (纸本)9789532900439

The Mobile Network Optimization (MNO) technologies have advanced at a tremendous pace in recent years. And the Dynamic Network Optimization (DNO) concept emerged years ago, aimed to continuously optimize the network in response to variations in network traffic and conditions. Yet, DNO development is still at its infancy, mainly hindered by a significant bottleneck of the lengthy optimization runtime. This paper identifies parallelism in greedy MNO algorithms and presents an advanced distributed parallel solution. The solution is designed, implemented and applied to real-life projects whose results yield a significant, highly scalable and nearly linear speedup up to 6.9 and 14.5 on distributed 8-core and 16-core systems respectively. Meanwhile, optimization outputs exhibit self-consistency and high precision compared to their sequential counterpart. This is a milestone in realizing the DNO. Further, the techniques may be applied to similar greedy optimization algorithm based applications.

关键词： Dynamic Network Optimization Mobile Network Optimization distributed and parallel computing Quality of Service Inter Process Communications

来源：评论

学校读者我要写书评

暂无评论

Infrastructure, requirements and applications for e-Science 14

Infrastructure, requirements and applications for e-Science

引用

14th Symposium on Computer Architecture and High Performance computing

作者： Perrott, R Queens Univ Belfast Sch Comp Sci Belfast Antrim North Ireland

Recent developments in the international arena has meant the technology is now mature enough to bring together those required for the implementation of a grid computing facility. This paper examines the requirements a... 详细信息

ISBN: (纸本)0769517722

关键词： grid computing distributed and parallel computing eScience

来源：评论

学校读者我要写书评

暂无评论

parallelGDB: A parallel Graph Database based on Cache Specialization 11

<i>ParallelGDB</i>: A Parallel Graph Database based on Cache...

引用

15th International Database Engineering and Applications Symposium (IDEAS)

作者： Barguno, Luis Muntes-Mulero, Victor Dominguez-Sal, David Valduriez, Patrick UPC DAMA Barcelona Spain INRIA LIRMM Rocquencourt France

ISBN: (纸本)9781450306270

The need for managing massive attributed graphs is becoming common in many areas such as recommendation systems, proteomics analysis, social network analysis or bibliographic analysis. This is making it necessary to move towards parallel systems that allow managing graph databases containing millions of vertices and edges. Previous work on distributed graph databases has focused on finding ways to partition the graph to reduce network traffic and improve execution time. However, partitioning a graph and keeping the information regarding the location of vertices might be unrealistic for massive graphs. In this paper, we propose parallel-GDB, a new system based on specializing the local caches of any node in this system, providing a better cache hit ratio. parallelGDB uses a random graph partitioning, avoiding complex partition methods based on the graph topology, that usually require managing extra data structures. This proposed system provides an efficient environment for distributed graph databases.

关键词： Graph database Cache specialization Graph algorithms distributed and parallel computing distributed graphs

来源：评论

学校读者我要写书评

暂无评论

Balancing Thread-level and Task-level parallelism for Data-Intensive Workloads on Clusters and Clouds

Balancing Thread-level and Task-level Parallelism for Data-I...

引用

IEEE International Conference on Cluster computing (CLUSTER)

作者： Choudhury, Olivia Rajan, Dinesh Hazekamp, Nicholas Gesing, Sandra Thain, Douglas Emrich, Scott Univ Notre Dame Dept Comp Sci & Engn Notre Dame IN 46556 USA

ISBN: (纸本)9781467365987

The runtime configuration of parallel and distributed applications remains a mysterious art. To tune an application on a particular system, the end-user must choose the number of machines, the number of cores per task, the data partitioning strategy, and so on, all of which result in a combinatorial explosion of choices. While one might try to exhaustively evaluate all choices in search of the optimal, the end user's goal is simply to run the application once with reasonable performance by avoiding terrible configurations. To address this problem, we present a hybrid technique based on regression models for tuning data intensive bioinformatics applications: the sequential computational kernel is characterized empirically and then incorporated into an ab initio model of the distributed system. We demonstrate this technique on the commonly-used applications BWA, Bowtie2, and BLASR and validate the accuracy of our proposed models on clouds and clusters.

关键词： bioinformatics cloud computing multi-threading parallel processing regression analysis bioinformatics application cluster computing data-intensive workload distributed application hybrid technique parallel application regression model task-level parallelism thread-level parallelism Bioinformatics Computational modeling Data models Genomics Instruction sets parallel processing Predictive models cluster and cloud computing distributed and parallel computing genome alignment predictive modeling parallel PROCESSING (COMPUTERS) Bioinformatics Cloud computing simple regression (model) Prediction models instruction sets Multithreading data models cluster computing Computational modeling Clouds Genomics regression analysis

来源：评论

学校读者我要写书评

暂无评论

distributed and parallel Computation of the Canonical Direct Basis 14th

Distributed and Parallel Computation of the Canonical Direct...

引用

14th International Conference on Formal Concept Analysis (ICFCA)

作者： Viaud, Jean-Francois Bertet, Karell Missaoui, Rokia Demko, Christophe Univ La Rochelle Lab L3i La Rochelle France Univ Quebec Outaouais Gatineau PQ Canada

ISBN: (纸本)9783319592718;9783319592701

Mining association rules, including implications, is an important topic in Knowledge Discovery research area and in Formal Concept Analysis (FCA). In this paper, we present a novel algorithm that computes in a parallel way the canonical direct unit basis of a formal context in FCA. To that end, the algorithm first performs a horizontal split of the initial context into subcontexts and then exploits the notion of minimal dual transversal to merge the canonical direct unit bases generated from subcontexts.

关键词： Formal context Implication Canonical direct unit basis distributed and parallel computing Dual transversal

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：