the proceedings contain 26 papers. the topics discussed include: an evolution of general purpose processing: reconfigurable logic computing;the next generation of compilers;communication-sensitive static dataflow for ...
ISBN:
(纸本)9780769535760
the proceedings contain 26 papers. the topics discussed include: an evolution of general purpose processing: reconfigurable logic computing;the next generation of compilers;communication-sensitive static dataflow for parallel message passing applications;reducing memory ordering overheads in software transactional memory;detecting and eliminating potential violations of sequential consistency for concurrent C/C++ programs;ESoftCheck: removal of non-vital checks for fault tolerance;alchemist: a transparent dependence distance profiling infrastructure;workload reduction for multi-input feedback-directed optimization;profiling k-iteration paths: a generalization of the Ball-Larus profiling algorithm;automatic feature generation for machine learning based optimizing compilation;revisiting out-of-SSA translation for correctness, code quality and efficiency;wave propagation and deep propagation for pointer analysis;and a fast and precise static loop analysis based on abstract interpretation, program slicing and polytope models.
As the number of services and the size of data involved in workflows increases, centralised orchestration techniques are reaching the limits of scalability. In the classic orchestration model, all data pass through a ...
详细信息
ISBN:
(纸本)9781605585888
As the number of services and the size of data involved in workflows increases, centralised orchestration techniques are reaching the limits of scalability. In the classic orchestration model, all data pass through a centralised engine, which results in unnecessary data transfer, wasted bandwidth and the engine to become a bottleneck to the execution of a workflow. Choreography techniques, although more complex to model offer a decentralised alternative and are the optimal architecture for data-centric workflows;data are passed directly to where they are required, at the next service in the workflow. While orchestration is the dominant architectural approach, there are relatively few choreography languages and even fewer concrete implementations. this papers contributions are twofold. Firstly we argue the case for choreography in data-intensive computing, and demonstrate through workflow patterns the advantages in terms of scalability when a choreography architecture is adopted. Secondly we introduce the Light Weight Coordination Calculus (LCC), a type of process calculus used to formally define choreographies, and the OpenKnowledge framework, a choreography-based architecture, providing the functionality for peers to coordinate in an open peer-to-peer system. through LCC and the OpenKnowledge framework we practically demonstrate how choreography can be achieved in a lightweight manner with a comparatively simple process language. Copyright 2009 ACM.
the proceedings contain 10 papers. the topics discussed include: analyzing orchestration of BPEL specified services with model checking;cross-organizational service security - solutions for attack modeling and defense...
the proceedings contain 10 papers. the topics discussed include: analyzing orchestration of BPEL specified services with model checking;cross-organizational service security - solutions for attack modeling and defense;knowledge-driven SOA migration;application of data mining to performance management of distributed enterprise systems;maintenance of customized processes;towards an abstraction layer for scientific services;online testing of service-oriented architectures to detect state-based faults;ensuring cost-optimal SLA conformance for composite service providers;remote sensing service chain self-evolution method;and remotely sensed image processing service automatic composition.
Moving objects databases (MODs) have been proposed for managing trajectory data, an important kind of information for pervasive applications. To save storage capacity, a MOD generally stores simplified trajectories on...
详细信息
ISBN:
(纸本)9781424433032
Moving objects databases (MODs) have been proposed for managing trajectory data, an important kind of information for pervasive applications. To save storage capacity, a MOD generally stores simplified trajectories only. A simplified trajectory approximates the actual trajectory of the mobile object according to a certain accuracy bound. In order to minimize the costs of communicating position information between mobile object and MOD, the trajectory simplification should be performed by the mobile object. To assure that the MOD always has a valid simplified trajectory of the remote object, we propose the generic remote trajectory simplification protocol (GRTS) allowing for computing and managing a simplified trajectory in such a system in real-time. We show how to combine GRTS with existing line simplification algorithms for computingthe simplified trajectory and analyze trade-offs between the different algorithms. Our evaluations show that GRTS outperforms the two existing approaches by a factor of two and more in terms of reduction efficiency. Moreover, on average, the reduction efficiency of GRTS is only 12% worse compared to optimal offline simplification.
As computers become pervasive and data size increases dramatically, data management systems' security, scalability and availability features turn into major design issues, especially in distributedcomputing envir...
详细信息
Overlay networks as the communication medium in parallel and distributed applications have gained prominence, especially in Grid environments. However, providing boththroughput performance and reliable communication ...
详细信息
ISBN:
(纸本)9781605585871
Overlay networks as the communication medium in parallel and distributed applications have gained prominence, especially in Grid environments. However, providing boththroughput performance and reliable communication on overlays have been given little attention. the core of this problem is that intermediate nodes have limited buffer memory, while the forwarding throughput;must yield Gbps. Yet, implementing a naive flow control can deadlock tire overlay. thus, high performance flow control on overlays is a critical concern in heterogeneous wide-area networks, where input/output link throughput can vary significantly. We propose an overlay scheme that couples TCP connections and fixed intermediate buffer memory while adapting deadlock-free routing for our overlay routing in heterogeneous wide-area networks. Our scheme eliminates memory overflows at forwarding nodes by fixed buffer memory and deadlocks via a deadlock-free routing algorithm that resolves adaptation challenges for heterogeneous wide-area networks. Our overlay construction and routing optimizations account for underlying network latency and bandwidth information. Simulation on 13 Clusters (515 nodes) and evaluation on 7 clusters (170 nodes) show that our deadlock-free routing poses negligible overhead in comparison to deadlock-unaware routing, and comparably with direct communication. We further demonstrate that for certain collective communications, our overlay even out-performs direct communication by mitigating or completely avoiding network contention. We show this on systems ranging from a single-switch cluster with 36 nodes to a Grid environment with 4 clusters and 291 nodes.
distributed real-time automotive embedded systems have to be highly dependable as well as cost-efficient due to the large number of manufactured units. To close the gap between raising complexity and cutting costs, up...
详细信息
ISBN:
(纸本)9780769535739
distributed real-time automotive embedded systems have to be highly dependable as well as cost-efficient due to the large number of manufactured units. To close the gap between raising complexity and cutting costs, upcoming software standards like AUTOSAR introduce a clear separation of concerns into their system architecture. An AUTOSAR application is built from components that deal with business logic only whereas infrastructural services are provided by standardized middleware. Unfortunately, this middleware tends to be heavy-weight due to its coarse-grained layered design. By applying a component based design to AUTOSAR's middleware, a custom-tailored version for each specific application and system node can be built to overcome this problem. this paper demonstrates how to automatically synthesize component based middleware via the Connector Transformation: Component connectors in platform independent application models are utilized to automatically assemble platform- and application specific middleware. As a result, AUTOSAR middleware becomes custom-tailored and hence light-weight and flexible. In addition, the described synthesis algorithm is capable of incorporating timing annotations via interface contracts at model level, and thus reflects upcoming ambitions to cover real-time constraints at middleware level within AUTOSAR. To prove our approach we successfully synthesized middleware for a demonstrator application and compared it to its conventional counterpart.
the proceedings contain 14 papers. the topics discussed include: reusable architectural decision model for model and metadata repositories;formal behavioral modeling and compliance analysis for service-oriented system...
ISBN:
(纸本)3642041663
the proceedings contain 14 papers. the topics discussed include: reusable architectural decision model for model and metadata repositories;formal behavioral modeling and compliance analysis for service-oriented systems;a real-time extension of creol for modelling biomedical sensors;conformance testing of distributed concurrent systems with executable designs;formal verification for components and connectors;formal modular modelling of context-awareness;towards demonstrably correct compilation of java byte code;incremental system modelling in event-b;an asynchronous distributed component model and its semantics;specification and verification for grid component-based applications: from models to tools;semi-formal models to support program development: autonomic management within component based parallel and distributed programming;session-based compilation framework for multicore programming;and abstract interpretation of symbolic execution with explicit state updates.
We introduce a low-level performance modelling formalism, Shared Transaction Markov Chains (STMCs), specifically designed for the capture and analysis of massively parallel stochastic systems through fluid techniques....
详细信息
ISBN:
(纸本)9781424449262
We introduce a low-level performance modelling formalism, Shared Transaction Markov Chains (STMCs), specifically designed for the capture and analysis of massively parallel stochastic systems through fluid techniques. We introduce the notion of a shared transaction between concurrently running Markov chains which allows a multi-phase synchronisation to accurately represent complex cooperation between modelling components in a compositional manner. We demonstrate the new modelling formalism on four distinct models and show how fluid analysis may be performed, with results, where appropriate. Our contribution is that this is the first such system tailored to the fluid performance analysis of transaction-based systems as found in computing applications such as peer-to-peer networks, web architectures and Publish-Subscribe networks. the second contribution is that STMCs permit composed phase-type distributed synchronisation which is more useful from a transaction modelling perspective.
暂无评论