Multi-rotor Unmanned Aerial Vehicles (UAVs) are interesting for commercial as well as for private use. Simple tasks like aerial photography are well known, but nowadays new scenarios, like on-board video processing or...
详细信息
ISBN:
(纸本)9781479944309
Multi-rotor Unmanned Aerial Vehicles (UAVs) are interesting for commercial as well as for private use. Simple tasks like aerial photography are well known, but nowadays new scenarios, like on-board video processing or complex sensor data processing, are gaining in importance. These scenarios require high-performance on-board processing which is not available in most of today's avionics architectures for civilian multi-rotor systems. Due to the limited installation space and weight requirements, the usage of highly integrated Multi-Processor System on Chips (MPSoCs), capable to implement real-time critical flight control algorithms and compute intensive custom payload functions is appealing. This paper presents fundamental requirements on the architecture and flight control algorithms of existing autonomously flying commercial multi-rotor UAVs. On this basis a new approach for an avionics architecture using the Xilinx ZYNQ (MPSoC) is proposed. In combination with the presentation of the proposed architecture new challenges will be discussed that result from the integration of mixed-critical applications on a single chip.
In this paper, we examine the suitability of CORBA-based solutions for meeting application requirements in the field of distributedparallel programming. We outline concepts defined within CORBA which are helpful for ...
详细信息
The notion of similarity is an important one in data mining. It can be used to provide useful structural information on data as well as enable clustering. In this paper we present an elegant method for measuring the s...
详细信息
ISBN:
(纸本)354067442X
The notion of similarity is an important one in data mining. It can be used to provide useful structural information on data as well as enable clustering. In this paper we present an elegant method for measuring the similarity between homogeneous datasets. The algorithm presented is efficient in storage and scale, has the ability to adjust to time constraints. and can provide the user with likely causes of similarity or dis-similarity. One potential application of our similarity measure is in the distributed data mining domain. Using the notion of similarity across databases as a distance metric one can generate clusters of similar datasets. Once similar datasets are clustered, each cluster can be independently mined to generate the appropriate rules for a given cluster. The similarity measure is evaluated on a dataset from the Census Bureau, and synthetic datasets from IBM.
In this paper, a replication-based parallel object model will be presented first, where object replication is used to improve the performance of load-balancing and to reduce the cost of object migration. After that, a...
详细信息
Developing complex computational-intensive and data-intensive scientific applications requires effective utilization of the computational power of the available computing platforms including grids, clouds, clusters, m...
详细信息
ISBN:
(纸本)9781467370820
Developing complex computational-intensive and data-intensive scientific applications requires effective utilization of the computational power of the available computing platforms including grids, clouds, clusters, multicore and many-core processors, and graphical processing units (GPUs). However, scientists who need to leverage such platforms are usually not parallel or distributed programming experts. Thus, they face numerous challenges when implementing and porting their software-based experimental tools to such platforms. In this paper, we introduce a sequential-to-parallel engineering approach to help scientists in engineering their scientific applications. Our approach is based on capturing sequential program details, planned parallelization aspects, and program deployment details using a set of domain-specific visual languages (DSVLs). Then, using code generation, we generate the corresponding parallel program using necessary parallel and distributed programming models (MPI, OpenCL, or OpenMP). We summarize three case studies (matrix multiplication, N-Body simulation, and signal processing) to evaluate our approach.
We describe our experience using PARED, an object oriented system for the adaptive solution of PDEs in a distributed computing environment. PARED handles selective mesh refinement and coarsening, mesh repartitioning f...
详细信息
We describe our experience using PARED, an object oriented system for the adaptive solution of PDEs in a distributed computing environment. PARED handles selective mesh refinement and coarsening, mesh repartitioning for load balancing and interprocessor mesh migration. PARED is an object-oriented system that runs on distributed memory parallel computers such as the IBM SP and network of workstations. In this paper, we report on the use of PARED to solve two- and three-dimensional PDEs. We show that our object-oriented technology provides great flexibility with a small overhead to support the highly desirable adaptive features of PARED.
This work presents a new approach to solve the location management problem by using the location areas approach. A combination of a genetic algorithm and the Hopfield neural network is used to find the optimal configu...
详细信息
For large planar adaptive arrays, the computational load and the terabyte data transmission are two challenging problems in the implementation of adaptive beamforming system. This paper considers the problem of design...
详细信息
ISBN:
(纸本)9781424421923
For large planar adaptive arrays, the computational load and the terabyte data transmission are two challenging problems in the implementation of adaptive beamforming system. This paper considers the problem of designing an efficient parallel adaptive algorithm using the two dimensional(2D) planar array. This paper extends the efficient parallel adaptive beamforming algorithm based on LCMV to adaptive 2D sensor array processing. The proposed 2D parallel adaptive algorithm can be easily implemented in distributed-parallel-processing system due to its parallel structure. It can save the data transmission as well as computing cost.
Grid systems are becoming the underlying infrastructure for many high-performance distributed scientific, applications. Resources in these systems have heterogeneous features, are connected by potentially unreliable n...
详细信息
ISBN:
(纸本)0769510116
Grid systems are becoming the underlying infrastructure for many high-performance distributed scientific, applications. Resources in these systems have heterogeneous features, are connected by potentially unreliable networks, and are often under different administrative management domains. These remarks show how a new generation of techniques, mechanisms and tools need to he considered, that can cope with the complexity of such systems and provide the performances suitable for scientific computing applications. In this paper, an architecture for monitoring services in Grid environments based on mobile agent technology is presented, One of the most interesting aspects of the proposed approach is the possibility of customizing the parameters to be monitored. After describing the general framework where agents will execute, an application for improving the capabilities of traditional network monitoring paradigms will be presented.
In this paper we address the mapping of mixed-criticality hard real-time applications on distributed embedded architectures. We assume that the architecture provides both spatial and temporal partitioning, thus enforc...
详细信息
ISBN:
(纸本)9780769545905
In this paper we address the mapping of mixed-criticality hard real-time applications on distributed embedded architectures. We assume that the architecture provides both spatial and temporal partitioning, thus enforcing enough separation between applications. With temporal partitioning, each application runs in a separate partition, and each partition is allocated several time slots on the processors where the application is mapped. The sequence of time slots for all the applications on a processor are grouped within a Major Frame, which is repeated periodically. We assume that the applications are scheduled using static-cyclic scheduling. We are interested to determine the task mapping to processors, and the sequence and size of the time slots within the Major Frame on each processor, such that the applications are schedulable. We have proposed a Tabu Search-based approach to solve this optimization problem. The proposed algorithm has been evaluated using several synthetic and real-life benchmarks.
暂无评论