BitWorker, a Decentralized Distributed Computing System based on BitTorrent

In this paper we present BitWorker, a platform for community distributed computing based on BitTorrent. Any splittable task can be easily specified by a user in a meta-information task file, such that it can be downloaded and performed by other volunteers. Peers find each other using Distributed Hash Tables, download existing results, and compute missing ones. Unlike existing distributed computing schemes relying on centralized coordination point(s), our scheme is totally distributed, therefore, highly robust. We evaluate the performance of BitWorker using mathematical models and real tests, showing processing and robustness gains. BitWorker is available for download and use by the community.

A robotic system to train activities of daily living in a virtual environment

In the past decade, several arm rehabilitation robots have been developed to assist neurological patients during therapy. Early devices were limited in their number of degrees of freedom and range of motion, whereas newer robots such as the ARMin robot can support the entire arm. Often, these devices are combined with virtual environments to integrate motivating game-like scenarios. Several studies have shown a positive effect of game-playing on therapy outcome by increasing motivation. In addition, we assume that practicing highly functional movements can further enhance therapy outcome by facilitating the transfer of motor abilities acquired in therapy to daily life. Therefore, we present a rehabilitation system that enables the training of activities of daily living (ADL) with the support of an assistive robot. Important ADL tasks have been identified and implemented in a virtual environment. A patient-cooperative control strategy with adaptable freedom in timing and space was developed to assist the patient during the task. The technical feasibility and usability of the system was evaluated with seven healthy subjects and three chronic stroke patients.

Central venous pulse pressure analysis using an R-synchronized pressure measurement system

Objective. The information derived from central venous catheters is underused. We developed an EKG-R synchronization and averaging system to obtained distinct CVP waveforms and analyzed components of these. Methods. Twenty-five paralyzed surgical patients undergoing CVP monitoring under mechanical ventilation were studied. CVP and EKG signals were analyzed employing our system, the mean CVP and CVP at end-diastole during expiration were compared, and CVP waveform components were measured using this system. Results. CVP waveforms were clearly visualized in all patients. They showed the a peak to be 1.8+/- 0.7 mmHg, which was the highest of three peaks, and the x trough to be lower than the y trough (-1.6+/- 0.7mmHgand-0.9+/- 0.5mmHg, respectively), withameanpulsepressureof3.4mmHg.ThedifferencebetweenthemeanCVPandCVPatend-diastoleduringexpirationwas0.58+/- 0.81 mmHg. Conclusions. The mean CVP can be used as an index of right ventricular preload in patients under mechanical ventilation with regular sinus rhythm. Our newly developed system is useful for clinical monitoring and for education in circulatory physiology.

AccessMod 3.0: computing geographic coverage and accessibility to health care services using anisotropic movement of patients

Background Access to health care can be described along four dimensions: geographic accessibility, availability, financial accessibility and acceptability. Geographic accessibility measures how physically accessible resources are for the population, while availability reflects what resources are available and in what amount. Combining these two types of measure into a single index provides a measure of geographic (or spatial) coverage, which is an important measure for assessing the degree of accessibility of a health care network. Results This paper describes the latest version of AccessMod, an extension to the Geographical Information System ArcView 3.×, and provides an example of application of this tool. AccessMod 3 allows one to compute geographic coverage to health care using terrain information and population distribution. Four major types of analysis are available in AccessMod: (1) modeling the coverage of catchment areas linked to an existing health facility network based on travel time, to provide a measure of physical accessibility to health care; (2) modeling geographic coverage according to the availability of services; (3) projecting the coverage of a scaling-up of an existing network; (4) providing information for cost effectiveness analysis when little information about the existing network is available. In addition to integrating travelling time, population distribution and the population coverage capacity specific to each health facility in the network, AccessMod can incorporate the influence of landscape components (e.g. topography, river and road networks, vegetation) that impact travelling time to and from facilities. Topographical constraints can be taken into account through an anisotropic analysis that considers the direction of movement. We provide an example of the application of AccessMod in the southern part of Malawi that shows the influences of the landscape constraints and of the modes of transportation on geographic coverage. Conclusion By incorporating the demand (population) and the supply (capacities of heath care centers), AccessMod provides a unifying tool to efficiently assess the geographic coverage of a network of health care facilities. This tool should be of particular interest to developing countries that have a relatively good geographic information on population distribution, terrain, and health facility locations.

Improving Management of Distributed Services Using Correlations and Predictions in SLA-Driven Cloud Computing Systems

Recent advancements in cloud computing have enabled the proliferation of distributed applications, which require management and control of multiple services. However, without an efficient mechanism for scaling services in response to changing environmental conditions and number of users, application performance might suffer, leading to Service Level Agreement (SLA) violations and inefficient use of hardware resources. We introduce a system for controlling the complexity of scaling applications composed of multiple services using mechanisms based on fulfillment of SLAs. We present how service monitoring information can be used in conjunction with service level objectives, predictions, and correlations between performance indicators for optimizing the allocation of services belonging to distributed applications. We validate our models using experiments and simulations involving a distributed enterprise information system. We show how discovering correlations between application performance indicators can be used as a basis for creating refined service level objectives, which can then be used for scaling the application and improving the overall application's performance under similar conditions.

Service Level Agreements-Driven Management of Distributed Applications in Cloud Computing Environments

Cloud Computing enables provisioning and distribution of highly scalable services in a reliable, on-demand and sustainable manner. However, objectives of managing enterprise distributed applications in cloud environments under Service Level Agreement (SLA) constraints lead to challenges for maintaining optimal resource control. Furthermore, conflicting objectives in management of cloud infrastructure and distributed applications might lead to violations of SLAs and inefficient use of hardware and software resources. This dissertation focusses on how SLAs can be used as an input to the cloud management system, increasing the efficiency of allocating resources, as well as that of infrastructure scaling. First, we present an extended SLA semantic model for modelling complex service-dependencies in distributed applications, and for enabling automated cloud infrastructure management operations. Second, we describe a multi-objective VM allocation algorithm for optimised resource allocation in infrastructure clouds. Third, we describe a method of discovering relations between the performance indicators of services belonging to distributed applications and then using these relations for building scaling rules that a CMS can use for automated management of VMs. Fourth, we introduce two novel VM-scaling algorithms, which optimally scale systems composed of VMs, based on given SLA performance constraints. All presented research works were implemented and tested using enterprise distributed applications.

Service level agreements-driven management of distributed applications in cloud computing environments

Advancements in cloud computing have enabled the proliferation of distributed applications, which require management and control of multiple services. However, without an efficient mechanism for scaling services in response to changing workload conditions, such as number of connected users, application performance might suffer, leading to violations of Service Level Agreements (SLA) and possible inefficient use of hardware resources. Combining dynamic application requirements with the increased use of virtualised computing resources creates a challenging resource Management context for application and cloud-infrastructure owners. In such complex environments, business entities use SLAs as a means for specifying quantitative and qualitative requirements of services. There are several challenges in running distributed enterprise applications in cloud environments, ranging from the instantiation of service VMs in the correct order using an adequate quantity of computing resources, to adapting the number of running services in response to varying external loads, such as number of users. The application owner is interested in finding the optimum amount of computing and network resources to use for ensuring that the performance requirements of all her/his applications are met. She/he is also interested in appropriately scaling the distributed services so that application performance guarantees are maintained even under dynamic workload conditions. Similarly, the infrastructure Providers are interested in optimally provisioning the virtual resources onto the available physical infrastructure so that her/his operational costs are minimized, while maximizing the performance of tenants’ applications. Motivated by the complexities associated with the management and scaling of distributed applications, while satisfying multiple objectives (related to both consumers and providers of cloud resources), this thesis proposes a cloud resource management platform able to dynamically provision and coordinate the various lifecycle actions on both virtual and physical cloud resources using semantically enriched SLAs. The system focuses on dynamic sizing (scaling) of virtual infrastructures composed of virtual machines (VM) bounded application services. We describe several algorithms for adapting the number of VMs allocated to the distributed application in response to changing workload conditions, based on SLA-defined performance guarantees. We also present a framework for dynamic composition of scaling rules for distributed service, which used benchmark-generated application Monitoring traces. We show how these scaling rules can be combined and included into semantic SLAs for controlling allocation of services. We also provide a detailed description of the multi-objective infrastructure resource allocation problem and various approaches to satisfying this problem. We present a resource management system based on a genetic algorithm, which performs allocation of virtual resources, while considering the optimization of multiple criteria. We prove that our approach significantly outperforms reactive VM-scaling algorithms as well as heuristic-based VM-allocation approaches.

Theoretical models of planetary system formation II. Post-formation evolution

Aims. We extend the results of planetary formation synthesis by computing the long-term evolution of synthetic systems from the clearing of the gas disk into the dynamical evolution phase. Methods. We use the symplectic integrator SyMBA to numerically integrate the orbits of planets for 100 Myr, using populations from previous studies as initial conditions. Results. We show that within the populations studied, mass and semimajor axis distributions experience only minor changes from post-formation evolution. We also show that, depending upon their initial distribution, planetary eccentricities can statistically increase or decrease as a result of gravitational interactions. We find that planetary masses and orbital spacings provided by planet formation models do not result in eccentricity distributions comparable to observed exoplanet eccentricities, requiring other phenomena, such as stellar fly-bys, to account for observed eccentricities.