Data Distribution Management (DDM) is one of the six services provided by HLA/RTI as complementarities of Declaration/Interests Management to provide a flexible and extensive mechanism for further throttling the data ...
详细信息
ISBN:
(纸本)0769523129
Data Distribution Management (DDM) is one of the six services provided by HLA/RTI as complementarities of Declaration/Interests Management to provide a flexible and extensive mechanism for further throttling the data placed on the network and delivered to federates based on simulated entities' interests of data. DDM is of essential importance especially for large scale distributed simulations. In the past a few years, two main types of DDM protocols have been developed, named region-based methods and grid-based methods. However, all of these techniques have their obvious drawbacks, which affect their deployment in most applicationsthat require high performance and low overhead. In our previous work, we have proposed a dynamic grid-based DDM scheme that shows a great potential when compared to both region-based and grid-based approaches. In this paper, we wish to improve our previous scheme, which we refer to as optimized dynamic grid-based DDM, to further reduce irrelevant data that might be received by simulated entites.
the parallel multiple front method is used in mechanical engineering to solve large sparse linear systems issued from finite element modeling. It is a parallel direct method based on a nonoverlapping domain decomposit...
详细信息
ISBN:
(纸本)0769523129
the parallel multiple front method is used in mechanical engineering to solve large sparse linear systems issued from finite element modeling. It is a parallel direct method based on a nonoverlapping domain decomposition method. the decomposition is usually built with a graph partitioning approach. However this approach is not well suited to all parallelapplications. It provides computing times over the subdomains which can vary from simple to double for our parallel multiple method. We show that its computing time can be decreased by load balancing the computational volume over the subdomains. We present in this communication a sequential and a parallel version of our load balancing method which corrects in computational volume an initial decomposition issued from graph partitioning tools.
When designing a SoC, matching the required performance both in terms of processing power and power consumption tends to become more and more challenging. Moreover, since the range of targeted applications for every s...
详细信息
ISBN:
(纸本)0769523129
When designing a SoC, matching the required performance both in terms of processing power and power consumption tends to become more and more challenging. Moreover, since the range of targeted applications for every single product is growing rapidly, employing reconfigurable accelerators makes more and more sense to this purpose. Coarse grain reconfigurable architectures bring an alternative providing interesting performance /flexibility trade-offs over traditional approaches. this paper presents an original method allowing to efficiently exploit dynamical parallelism at both loop-level and task-level, which remains rarely used. this method called DHM (Dynamic Hardware Multiplexing) is based upon the use of a hardwired controller dedicated to run-time task scheduling and automatic loop unrolling. this paper shows that significant performance improvements can be achieved through combining both intra and inter-task parallelism. Principles and validations are exposed through a case study on a coarse grain reconfigurable architecture.
Today's collaborative applications over the web span domains as diverse as enterprise e-commerce applications and biomedical applications. We have previously developed and formally investigated "Web Coordinat...
详细信息
ISBN:
(纸本)0769523129
Today's collaborative applications over the web span domains as diverse as enterprise e-commerce applications and biomedical applications. We have previously developed and formally investigated "Web Coordination Bonds," a theoretically powerful artifact for interconnecting autonomous web objects for control and data flows, and for enforcing dependencies. Here, we describe BondFlow, a system that enables the configuration and execution of workflows using web bonds over heterogeneous web objects. the system automatically generates lightweight proxy wrapper objects to enable encapsulated web services to be interconnected through web bonds. the small footprint wrappers (less than 10 KB) can reside on Java-enabled handheld devices. We describe the design, architecture and performance of the Bond-Flow system. Our initial performance results indicate that both wrapper creation time and web bond related execution time are small. In contrast to our BondFlow system, existing systems need expert programming to create workflows, do not easily allow distributed coordination of workflows, and usually do not support heterogeneity of device, data and network. the system is preliminary, and further research is ongoing to extend its configuration and execution platforms.
Domain-specific heterogeneous reconfigurable arrays are for one particular domain of applications, which provide high performance over generic Field Programmable Gate Arrays (FPGAs). this paper introduces an embedded ...
详细信息
ISBN:
(纸本)0769523129
Domain-specific heterogeneous reconfigurable arrays are for one particular domain of applications, which provide high performance over generic Field Programmable Gate Arrays (FPGAs). this paper introduces an embedded reconfigurable array that targets discrete wavelet transform (DWT). Reconfigurable architectures are highly suitable for complex algorithms which are part of changing standards like JPEG2000 etc. the proposed reconfigurable array is flexible to implement lifting and integer based different DWT algorithms. Two benchmark DWT algorithms are implemented on three different platforms (on proposed array, on conventional FPGAs and on hardwired cores) for performance evaluation. the performance based on power consumption, timing and area, shows considerable improvement of presented arrays over FPGAs.
We propose a cluster-based web server where a few computing nodes are separately reserved for high-performance computing applications, such as multimedia, SSL, and CGI. As an example application, we consider a multime...
详细信息
ISBN:
(纸本)0769523129
We propose a cluster-based web server where a few computing nodes are separately reserved for high-performance computing applications, such as multimedia, SSL, and CGI. As an example application, we consider a multimedia server that dynamically generates video units to satisfy the bit rate and bandwidth requirements of a variety of clients. To perform QoS aware scheduling of multiple multimedia jobs on the computing servers, a two-step algorithm is proposed. the first step is to fairly schedule multimedia streams to satisfy each stream's QoS requirement;and the second step is to balance the workload among heterogeneous computing nodes in the cluster. We propose a new Quota-based Adaptive CoScheduling (QACS) algorithm that greatly reduces delay jitter by eliminating the out-of-order departure for outgoing streams, as well as achieves high throughput in a heterogeneous cluster. Experimental results show that the proposed scheduling technique gives adequate QoS guarantees to multiple streams.
the proceedings contain 36 papers. the topics discussed include: distributed simulation of vehicular networks;consistency overhead using HLA for collaborative work;concurrency control frameworks for interactive sharin...
详细信息
the proceedings contain 36 papers. the topics discussed include: distributed simulation of vehicular networks;consistency overhead using HLA for collaborative work;concurrency control frameworks for interactive sharing of data spaces;using web services and data mediation/storage services to enable command and control to simulation interoperability;a version of MASM potable across different UNIX systems and different hardware architectures;using consistent global checkpoints to synchronize processes in distributed simulation;dealing with global guards in a distributed simulation of colored Petri Nets;and 3D mesh compression using an efficient neighborhood-based segmentation.
the aim of this article is to show, how a multitasking application running under real-time operating system compliant with OSEK/VDX standard can be modeled by timed automata. the application under consideration consis...
详细信息
ISBN:
(纸本)0769523129
the aim of this article is to show, how a multitasking application running under real-time operating system compliant with OSEK/VDX standard can be modeled by timed automata. the application under consideration consists of several tasks, it includes resource sharing and synchronization by events. For such system, we use model checking theory based on timed automata and we verify time and logical properties of proposed model by existing model checking tools. Since a complexity of the model-checking verification exponentially grows withthe number of clocks used in a model, the proposed model uses only one clock for measuring execution time of all modeled tasks.
Divisible load applications consist of an amount of data and associated computation that can be divided arbitrarily into any number of independent pieces. this model is a good approximation of many real-world scientif...
详细信息
ISBN:
(纸本)0769523129
Divisible load applications consist of an amount of data and associated computation that can be divided arbitrarily into any number of independent pieces. this model is a good approximation of many real-world scientific applications, lends itself to a natural master-worker implementation, and has thus received a lot of attention. the issue of divisible load scheduling has been studied extensively. However, only a few authors have explored the simultaneous scheduling of multiple such applications on a distributed computing platform. We focus on this increasingly relevant scenario and make the following contributions. We use a novel and more realistic platform model that captures some of the fundamental network properties of grid platforms. We formulate the steady-state multi-application scheduling problem as a linear program that expresses a notion of fairness between applications. this scheduling problem is NP-complete and we propose several heuristics that we evaluate and compare via extensive simulation experiments. Our main finding is that some of our heuristics can achieve performance close to optimal and we quantify the trade-offs between achieved performance and heuristic complexity.
Content-based publish/subscribe offers a convenient abstraction for the information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent applicat...
详细信息
ISBN:
(纸本)0769524346
Content-based publish/subscribe offers a convenient abstraction for the information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Unlike it? the traditional address-based unicast or multicast, its core problem is how to matching events 1) v predicates on the content of events. In existing matching approaches, matching predicates are composed by the conjunction and disjunction of non-semantic constraints. But, in context of enterprise application integration, although they con match events by their contents, this traditional matching predicates at,(, not enough expressive in manipulating the complex event matching, such as the "one-to-many" and "many-to-one" matching. therefore, traditional matching approaches should be extended to solve the complex matching problems. After analyzing information matching patterns in enterprise application integration, we propose three matching models, extend the simple matching to the multi-semantic matching and introduce the temporal constraint variable. the multi-semantic matching allows using different operations in accordance with different semantics;the temporal constraint variable supports processingthe discrete events in the temporal sequence. then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. Based on the extended OBDD graphs. the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient.
暂无评论