the proceedings contain 8 papers. the topics discussed include: a performance study of big spatial data systems;using datacube technology for in-situ-enhanced precision farming;data structures for parallel spatial alg...
ISBN:
(纸本)9781450360418
the proceedings contain 8 papers. the topics discussed include: a performance study of big spatial data systems;using datacube technology for in-situ-enhanced precision farming;data structures for parallel spatial algorithms on large datasets;an uncertainty aware method for geographic data conation;HiAccess: high-resolution accessibility analysis with high-performance geographic information system;traffic speed prediction with convolutional neural network adapted for non-linear spatio-temporal dynamics;spatial data locality in scalable and fault-tolerant distributed spatial computing systems;and deformable part models for complex object detection in remote sensing imagery: state of the art.
this paper describes how the VHDL hardware description language can be used to aid the analysis, design and implementation of adaptive array beamformers for use in teleconferencing environments using parallel architec...
详细信息
ISBN:
(纸本)0769500595
this paper describes how the VHDL hardware description language can be used to aid the analysis, design and implementation of adaptive array beamformers for use in teleconferencing environments using parallel architectures. Beamformer models are often implemented in traditional programming languages such as C, Pascal and FORTRAN. this paper argues that VHDL provides a number of benefits to designers of such systems including improved vision of algorithm architecture, a faster design cycle and a more parallel and implementation-orientated design. the level of abstraction that VHDL gives is an important aid to overcoming the implementation problems associated with designing microphone array beamformers. the traditional view of VHDL as a tool for making implementations in silicon can thus be extended to view VHDL as a tool for thinking with, in some circumstances better than with conventional algorithmic computer languages.
Branch and Bound is a standard method for searching an optimal solution in the scope of continuous and discrete Global Optimization. It iteratively creates a search tree where each node represents a problem which is d...
详细信息
ISBN:
(纸本)0769500595
Branch and Bound is a standard method for searching an optimal solution in the scope of continuous and discrete Global Optimization. It iteratively creates a search tree where each node represents a problem which is decomposed in several subproblems provided that a feasible solution can be found by solving this set of subproblems. the computational power needed to solved most of the Branch and Bound Global Optimization problems and their high degree of potential parallelism make them suitable candidates to be solved in a multiprocessing environment. With palallel processing in mind Branch and Bound techniques can be considered as irregular and dynamic problems. So, their parallel implementations are not straightforward and require the use of dynamic load balance methods where the workload of a subproblem is a crucial parameter. In this pn per. an efficient parallel approach to the Branch and Bound continuous Global Optimization problem is described. It is based on a centralized asynchronous parallel model and on the prediction of the work load of the set of subproblems containing a feasible solution. the proposed dynamic load balancing model obtains ar? almost perfect work load balance with lon communication overhead.
A common paradigm for distributed computing is the producer-consumer model. One set of processes produce objects (data, resources, or tasks) that are consumed by another set of processes. We present a simple algorithm...
详细信息
A common paradigm for distributed computing is the producer-consumer model. One set of processes produce objects (data, resources, or tasks) that are consumed by another set of processes. We present a simple algorithm for implementing a distributed queue. this algorithm has several parameters that need to be tuned, such as the number of probes to find an object, the amount of buffering, and the connectivity between the producers and the consumers. We provide an analytical model that predicts performance, and based on the analytical model we provide recommendations for setting the parameters. Our analytical model is validated by a comparison to simulation results.
Many-to-many multicast transmission is an essential network capability for scalable distributedsimulation. the many open issues that make network-layer multicast impractical over the Internet today are likely to cont...
详细信息
ISBN:
(纸本)0769520367
Many-to-many multicast transmission is an essential network capability for scalable distributedsimulation. the many open issues that make network-layer multicast impractical over the Internet today are likely to continue to be insurmountable and to prevent deployment in a manner that will meet the Quality of Service (QoS) and many-to-many multicast needs of real-time distributed virtual simulation (RT-DVS). We propose an alternative approach, whereby the IP multicast function is relocated to the simulation host computer and also used to provide for QoS enabled services on a priority basis. this paper explores the concept of such a host-based multicast system with QoS and its suitability for RT-DVS. the paper defines the basic requirements of a host-based multicast protocol to support RT-DVS and proposes a quantitative model for evaluation of system alternatives.
the proceedings contain 36 papers. the topics discussed include: feature interactions of livelock type in IN: a detailed example;detecting feature interactions at specification stage;implementing an in service 'a ...
ISBN:
(纸本)0780349059
the proceedings contain 36 papers. the topics discussed include: feature interactions of livelock type in IN: a detailed example;detecting feature interactions at specification stage;implementing an in service 'a la TINA';secure codless terminal mobility - a challenge for manufacturers and providers;architectural impact of new services in a mobile network;database usage in telecommunications through CORBA;service animation - integrating call processing and management scripts;IN controls for broadband networks;open intelligent network service management point;TINA based service control in an intelligent broadband network;distributed network information systems for intelligent B-ISDN infrastructure;thin clients and distributed servers for service management;another dimension of flow control for the intelligent node;simulation of load limitation and interface performance in an IN configuration;intelligent networks as a solution for internet related telephone network congestion;don't underestimate the use of formal methods - how to make more out of your existing IN;call party handling aspects evolution from IN CS-2 to IN CS-3;and the evolution of IN service logic.
the proceedings contain 5 papers. the topics discussed include: collecting signatures to model latency tolerance in high-level simulations of microthreaded core;SESAM/Par4All: a tool for joint exploration of MPSoC arc...
ISBN:
(纸本)9781450311144
the proceedings contain 5 papers. the topics discussed include: collecting signatures to model latency tolerance in high-level simulations of microthreaded core;SESAM/Par4All: a tool for joint exploration of MPSoC architectures and dynamic dataflow code generation;heterogeneous integration to simplify many-core architecture simulations;a universal parallel front end for execution driven microarchitecture simulation;and break down GPU execution time with an analytical method.
Skyline queries have played an increasingly important role in many applications such as web mining, multi-preference analysis and decision making. Most existing studies mainly focus on centralized systems, and skyline...
详细信息
ISBN:
(纸本)9781467302395
Skyline queries have played an increasingly important role in many applications such as web mining, multi-preference analysis and decision making. Most existing studies mainly focus on centralized systems, and skyline query processing in distributed environments is still an emerging and challenging topic. In this paper we propose SkyStorm, a delay-bounded skyline computing approach by exploiting the topology property of distributed hash tables (DHT). the effectiveness of our proposals is demonstrated through analysis and simulations.
We present a novel sensing paradigm of measuring human gait. the goal of the research is to achieve low-cost gait biometrics systems with minimum data throughput for various sensing modalities. the binary measurements...
详细信息
ISBN:
(纸本)9781467310710
We present a novel sensing paradigm of measuring human gait. the goal of the research is to achieve low-cost gait biometrics systems with minimum data throughput for various sensing modalities. the binary measurements of the system are achieved by using both (1) periodic and (2) pseudo-random sampling structures. As a result, either static or dynamic gait features can be estimated from a one-bit data stream. the simulation results demonstrate the gait information acquisition capability of the proposed binary sensing technology.
this work presents results from an experimental evaluation of the space-time tradeoffs in Time Warp augmented withthe cancelback protocol for memory management. An implementation of the cancelback protocol on Time Wa...
详细信息
ISBN:
(纸本)1565550552
this work presents results from an experimental evaluation of the space-time tradeoffs in Time Warp augmented withthe cancelback protocol for memory management. An implementation of the cancelback protocol on Time Warp is described that executes on a shared memory multiprocessor, a 32 processor Kendall Square Research Machine (KSR1). the implementation supports canceling back more than one object when memory has been exhausted. the limited memory performance of the system is evaluated for three different workloads with varying degrees of symmetry. these workloads provide interesting stress cases for evaluating limited memory behavior. We, however, make certain simplifying assumptions (e.g, uniform memory requirement by all the events in the system) to keep the experiments tractable. the experiments are extensively monitored to determine the extent to which various overheads affect performance. It is observed that (i) depending on the available memory and asymmetry in the workload, canceling back several (called the salvage parameter) events at one time may improve performance significantly, by reducing certain overheads, (ii) a performance nearly equivalent to that with unlimited memory can be achieved with only a modest amount of memory depending on the degree of asymmetry in the workload.
暂无评论