Efficient algorithms for a class of partitioning problems

The problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems is addressed. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. Polynomial exact and approximate algorithms are described for this class that are better than any of the previously reported algorithms. The approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic take can then be carried out using fast search techniques

Partitioning problems in parallel, pipelined and distributed computing

The problem of optimally assigning the modules of a parallel program over the processors of a multiple computer system is addressed. A Sum-Bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple satellite system: partitioning multiple chain structured parallel programs, multiple arbitrarily structured serial programs and single tree structured parallel programs. In addition, the problems of partitioning chain structured parallel programs across chain connected systems and across shared memory (or shared bus) systems are also solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple computer architectures for a wide range of problems of practical interest

Network emulation focusing on QoS-Oriented satellite communication

This chapter proposes network emulation basics and a complete case study of QoS-oriented Satellite Communication

Autonomous satellite constellation for enhanced Earth coverage using coupled selection equations

This paper presents a novel solution to the problem of autonomous task allocation for a self-organising constellation of small satellites in Earth orbit. The method allows the constellation members to plan manoeuvres to cluster themselves above particular target longitudes on the Earth’s surface. This is enabled through the use of Coupled Selection Equations, which represent a dynamical systems approach to combinatorial optimisation problems, and whose solution tends towards a Boolean matrix which describes pairings of the satellites and targets which solves the relevant assignment problems. Satellite manoeuvres are actuated using a simple control law which incorporates the results of the Coupled Selection Equations. Three demonstrations of the efficacy of the method are given in order of increasing complexity - first with an equal number of satellites and targets, then with a surplus of satellites, including agent failure events, and finally with a constellation of two different satellite types. The method is shown to provide efficient solutions, whilst being computationally non-intensive, quick to converge and robust to satellite failures. Proposals to extend the method for on-board processing on a distributed architecture are discussed

Approximate algorithms for partitioning and assignment problems

The problem of optimally assigning the modules of a parallel/pipelined program over the processors of a multiple computer system under certain restrictions on the interconnection structure of the program as well as the multiple computer system was considered. For a variety of such programs it is possible to find linear time if a partition of the program exists in which the load on any processor is within a certain bound. This method, when combined with a binary search over a finite range, provides an approximate solution to the partitioning problem. The specific problems considered were: a chain structured parallel program over a chain-like computer system, multiple chain-like programs over a host-satellite system, and a tree structured parallel program over a host-satellite system. For a problem with m modules and n processors, the complexity of the algorithm is no worse than O(mnlog(W sub T/epsilon)), where W sub T is the cost of assigning all modules to one processor and epsilon the desired accuracy

The Rockstar Phase-Space Temporal Halo Finder and the Velocity Offsets of Cluster Cores

We present a new algorithm for identifying dark matter halos, substructure, and tidal features. The approach is based on adaptive hierarchical refinement of friends-of-friends groups in six phase-space dimensions and one time dimension, which allows for robust (grid-independent, shape-independent, and noise-resilient) tracking of substructure; as such, it is named Rockstar (Robust Overdensity Calculation using K-Space Topologically Adaptive Refinement). Our method is massively parallel (up to 10^5 CPUs) and runs on the largest current simulations (>10^10 particles) with high efficiency (10 CPU hours and 60 gigabytes of memory required per billion particles analyzed). A previous paper (Knebe et al 2011) has shown Rockstar to have class-leading recovery of halo properties; we expand on these comparisons with more tests and higher-resolution simulations. We show a significant improvement in substructure recovery as compared to several other halo finders and discuss the theoretical and practical limits of simulations in this regard. Finally, we present results which demonstrate conclusively that dark matter halo cores are not at rest relative to the halo bulk or satellite average velocities and have coherent velocity offsets across a wide range of halo masses and redshifts. For massive clusters, these offsets can be up to 350 km/s at z=0 and even higher at high redshifts. Our implementation is publicly available at http://code.google.com/p/rockstar .Comment: 20 pages, 14 figures. Minor revisions to match accepted versio

Ubiquitous Internet in an integrated satellite-terrestrial environment: The SUITED solution

yesThe current Internet architecture appears to not be particularly suited to addressing the emerging needs of new classes of users who wish to gain access to multimedia services made available by ISPs, regardless of their location, while in motion and with a guaranteed level of quality. One of the main objectives of so-called nextgeneration systems is to overcome the limitations of today¿s available Internet by adopting an approach based on the integration of different mobile and fixed networks. The SUITED project moves in this direction since it aims at contributing to the design and deployment of the global mobile broadband system (GMBS), a unique satellite/terrestrial infrastructure ensuring nomadic users access to Internet services with a negotiated QoS. A description of the main features of the GMBS architecture, characterized by the integration of a multisegment access network with a federated ISP network is given in this article. The GMBS multimode terminal is schematically described, and an overview of the so-called QoS-aware mobility management scheme, devised for such a heterogeneous scenario,is provided

Design and prototype of a train-to-wayside communication architecture

Telecommunication has become very important in modern society and seems to be almost omnipresent, making daily life easier, more pleasant and connecting people everywhere. It does not only connect people, but also machines, enhancing the efficiency of automated tasks and monitoring automated processes. In this context the IBBT (Interdisciplinary Institute for BroadBand Technology) project TRACK (TRain Applications over an advanced Communication networK), sets the definition and prototyping of an end-to-end train-to-wayside communication architecture as one of the main research goals. The architecture provides networking capabilities for train monitoring, personnel applications and passenger Internet services. In the context of the project a prototype framework was developed to give a complete functioning demonstrator. Every aspect: tunneling and mobility, performance enhancements, and priority and quality of service were taken into consideration. In contrast to other research in this area, which has given mostly high-level overviews, TRACK resulted in a detailed architecture with all different elements present