Hadoop YARN is evolving to become the de-facto standard that allows multiple data processing engines such as interactive SQL, real-time streaming, data science and batch processing to handle data stored in a single pl...
详细信息
this paper presents a methodology of distributed control system design for autonomous cooperative control of intelligent mobile robots. Following the natural concept of control architecture evolution, a bottom-up appr...
详细信息
ISBN:
(纸本)9781479959556
this paper presents a methodology of distributed control system design for autonomous cooperative control of intelligent mobile robots. Following the natural concept of control architecture evolution, a bottom-up approach for control system design is presented. First, microcomputer based intelligent device modules, such as multiple infrared range finding sensor modules, and odometry and locomotor control modules, are constructed as a device manager layer on a distributed multi-microcontroller network based hardware structure to detect walls and obstacles and to move around the surroundings of a two-wheeled mobile robot. then functional control modules, such as landmark and obstacle recognition and localization, robot motion control are implemented based on the device layer. Environment features such as lines and corners are estimated using a set of range sensors and a vision sensor. Next, some intelligent behavior modules, such as wall following, obstacle rounding, and target seeking, and environment mapping are implemented as cooperative activities based on the functional control modules. Upon these hierarchical activity modules, a non-centralized control approach is applied to implement the autonomous coordination of concurrent activities among behavior modules for the high-level tasks such as sensory navigation in unknown environments. the system integration and implementation issues are discussed for the proposed approach.
In SOA (Service-Oriented Architecture), the service match making process is conducted in the registry. When the amount of requests increases, the communication load between registry and requesters could also increase,...
详细信息
ISBN:
(纸本)9781538658628
In SOA (Service-Oriented Architecture), the service match making process is conducted in the registry. When the amount of requests increases, the communication load between registry and requesters could also increase, which may overload the registry and result in a longer response time. this could be worse when the service match making is based on semantic rather than syntax. To address this issues, we proposed, in this paper, an extension of the SOA to reduce the response time and registry loading by reallocating the major service match making tasks to service providers. An experiment is also conducted to compare the performance of the proposed architecture with original SOA to illustrate the feasibility of the proposed approach.
Grid is a computational environment in which applications can use multiple distributed computational resources in a safe, coordinated, efficient and transparent way. Data Integration Middleware Systems (DIMS) are orig...
详细信息
Large distributed computer systems have been successfully employed to solve modern scientific problems that were previously impracticable. Tools exist to bind together notably underutilized high speed computers and si...
详细信息
ISBN:
(纸本)9780769528335
Large distributed computer systems have been successfully employed to solve modern scientific problems that were previously impracticable. Tools exist to bind together notably underutilized high speed computers and sizable storage resources, creating architectures that provide performance and capacity that scales withthe quantity of resources invested. In various forms such as Internet computing, desktop grids, and even "big iron" grids, users and administrators find it difficult, however, to obtain aggregate systems that are more reliable than their underlying components and simple to utilize in concert. In this work, we will propose a model for controlling complex distributed systems and its application to the construction of scientific repositories.
In this paper we deal withthe problem of monitoring network latency. Indeed, latency is a key network metric related to both network performance and Quality of Service, since it directly impacts on the overall user...
详细信息
ISBN:
(纸本)9798400706486
In this paper we deal withthe problem of monitoring network latency. Indeed, latency is a key network metric related to both network performance and Quality of Service, since it directly impacts on the overall user's experience. High latency leads to unacceptably slow response times of network services, and may increase network congestion and reduce the throughput, in turn disrupting communications and the user's experience. A common approach to monitoring network latency takes into account the frequently skewed distribution of latency values, and therefore specific quantiles are monitored, such as the 95th, 98th, and 99th percentiles. We present a parallel, message-passing based version of the FRUGAL algorithm that can be used for monitoring network latency quickly and accurately. A distributed version is also discussed.
the proceedings contain 82 papers. the topics discussed include: a new list scheduling method based on structural properties of task graphs;network based genetic algorithm;a memory management architecture for a mobile...
ISBN:
(纸本)0769505716
the proceedings contain 82 papers. the topics discussed include: a new list scheduling method based on structural properties of task graphs;network based genetic algorithm;a memory management architecture for a mobile computing environment;domination in bounded interval tolerance graphs;a constant queue partial permutation routing algorithm for cube-connected-cycles multicomputer systems;packet loss detection scheme for retransmission-based real-time data transfer;a totally ordered and secure multicast protocol for distributed virtual environment;access control model in object-oriented systems;concurrent exception handling in a distributed object-oriented computing environment;and a generalized approach for transferring data-types with arbitrary communication libraries.
Ghost cells are important for distributed memory parallel operations that require neighborhood information, and are required for correctness on the boundaries of local data partitions. Ghost cells are one or more laye...
详细信息
ISBN:
(纸本)9781538606179
Ghost cells are important for distributed memory parallel operations that require neighborhood information, and are required for correctness on the boundaries of local data partitions. Ghost cells are one or more layers of grid cells surrounding the external boundary of the local partition, which are owned by other data partitions. they are used by the local partition when neighbor information is required. Finding ghost cells in structured data is trivial and can normally be done by calculating on cell indices. Obtaining ghost cells for unstructured grid data, however, is a nontrivial task. It requires an analysis of the connectivity of the grid in order to find neighbor cells. When the grid is distributed, the operation is further complicated by the need to determine which processes own the neighbor cells, and coordinating communication withthem. this is a problem when operating on unstructured grid data sets that do not already have ghost cells. parallel visualization algorithms will usually assume that a cell does not exist if it is not in the local data partition. Without ghost cells, this leads to operations that need neighborhood information, such as point data interpolated from cell data, being calculated incorrectly at partition boundaries. Production visualization tools generally support the existence of ghost cells, but not their generation, especially for unstructured grids. In the literature, there is no documented algorithm for generating in parallel one or more layers of ghost cells for unstructured grid data which has already been partitioned. We present a new algorithm to compute ghost cells in parallel on distributed unstructured data sets with no global cell or point IDs. Given a partitioned data set without ghost cells, this algorithm is capable of producing any number of layers of ghost cells necessary to support parallel operations. Performance results and timing comparisons to ParaView's D3 filter are presented. A number of optimizations to th
In April 2008, we organised the 7thinternational workshop on Performance Modelling, Evaluation and Optimization of Ubiquitous computing and Networked Systems (PMEO-UCNS'2008) held in conjunction withthe IEEE-IPD...
详细信息
In April 2008, we organised the 7thinternational workshop on Performance Modelling, Evaluation and Optimization of Ubiquitous computing and Networked Systems (PMEO-UCNS'2008) held in conjunction withthe IEEE-IPDPS, 14-18 April 2008, Miami, Florida, USA. We selected seven high quality papers (out of 17 papers, which were presented at the workshop) and invited the authors of the selected papers to extend them and submit them for a complete new peer-review for consideration in this special issue.
Consider the following NP-hard problems: Given a graph G, find minimum 2-edge connected and 2-vertex connected subgraphs spanning all vertices of G. Over the past few years, exciting sequential algorithms for approxim...
详细信息
Consider the following NP-hard problems: Given a graph G, find minimum 2-edge connected and 2-vertex connected subgraphs spanning all vertices of G. Over the past few years, exciting sequential algorithms for approximating such minimum subgraphs have been produced [6], [10]. the approximation factors are improved from 2 to 3/2 for both of the problems. Yet the techniques involved are all based on augmenting depth-first-search trees and no similar progress has been carried to the parallel context. this paper presents NC algorithms to achieve approximation factors of 3/2 + epsilon for these two problems without computing depth-first-search trees.
暂无评论