Wireless Sensor Networks (WSNs) are unique embedded computer systems for distributed sensing of a dispersed phenomenon. As WSNs are deployed in remote locations for longterm unattended operation, assurance of correct ...
详细信息
distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network construction and maintenance with name-driven routing. there exist very few DHT approaches that consider heterogeneity of nodes inside the c...
详细信息
DGIP (distributed Geographic Information Processing) has become a new tendency of GIS (Geographic Information System) recently. DGIP focuses on how to organize and process a series of geographic resources in distribut...
详细信息
ISBN:
(纸本)9781424473014
DGIP (distributed Geographic Information Processing) has become a new tendency of GIS (Geographic Information System) recently. DGIP focuses on how to organize and process a series of geographic resources in distributedcomputing environment and now existing research is mainly carried out from a global point of view. But it is noticeable that each computing node in distributedcomputing environment will carry a heavy load with growth of data quantity. So this paper concentrates on how to make each computing node fulfill the subtask more quickly to achieve efficient local acceleration. the paper designs a prototype for distributed remote sensing image processing and achieves local acceleration in each computing node with CUDA (Compute Unified Device Architecture). Firstly, the paper introduces the distributed procedure of the prototype and overviews the architecture and programming model of CUDA. then the paper takes Mean Filter as an example to design and implement the parallel program with CUDA to accelerate the procedure of remote sensing image processing in each node. To evaluate the performance of the local acceleration, the paper carries out a group of comparative tests between the parallel implementation with CUDA and the conventional implementation. the results demonstrate that the local acceleration with CUDA runs more than 20 times faster than conventional process.
A very ambitious objective in the field of policy-based systems is the provision of an intuitive and transparent way for policy specification, refinement and enforcement. this is one of the key enabling technologies f...
详细信息
A very ambitious objective in the field of policy-based systems is the provision of an intuitive and transparent way for policy specification, refinement and enforcement. this is one of the key enabling technologies for a simplified security management of complex networked environments. Currently, security policies are enforced by configuring the end devices by means of low-level device-specific parameters manually derived from high level specifications. this process, defined as policy translation, is still performed without a holistic view of the overall security requirements. this paper presents the Network Contextualization Tool (NCTool), a software supporting administrators in performing network dependent activities when configuring security enabled devices. the tool provides a great advantage in the management of complex networks. In fact, it simplifies the network administration tasks and reduces effort and responsibilities for the administrators, thus decreasing the risk of mistaken configurations.
the proceedings contain 57 papers. the topics discussed include: logical topology design with traffic grooming for scheduled demands;the impact of multi-core architectures on task retrieval policies for volunteer comp...
ISBN:
(纸本)9780889867741
the proceedings contain 57 papers. the topics discussed include: logical topology design with traffic grooming for scheduled demands;the impact of multi-core architectures on task retrieval policies for volunteer computing;evaluation of CPU power control and scheduling technique on parallelcomputing environment;clustered assignment of CCQS in information monitoring system supporting conjunctive queries;dense skip graphs as an overlay for P2P networks;multi-connection and multi-core aware all-gather on infiniband clusters;an improved prioritization method for task scheduling in heterogeneous computingsystems;thread pipelining with clustered data communication on commodity CMPS;a distributed algorithm for disjoint paths in star networks;parallel algorithms for a visual text mining platform;and a cache miss analysis for multithreaded architectures.
As the computing ability of high performance computers are improved by increasing the number of computing elements, how to utilize the available computing resources becomes an important issue. Different strategies to ...
详细信息
ISBN:
(纸本)9781605585871
As the computing ability of high performance computers are improved by increasing the number of computing elements, how to utilize the available computing resources becomes an important issue. Different strategies to solve an problem based on a multi-processing system can bring about distinct performance. In this paper, we propose a method to predict the performance of parallel applications. the method describes the parallel features of the multi-processing systems in a hierarchy way, and evaluates solutions based on the description. In this way, programmers can find the better solution of an application before real programming.
this paper presents the concept of pluggable parallelisation that allows scientists to develop "sequential like" codes that can take advantage of multi-core, cluster and grid systems. In this approach parall...
详细信息
ISBN:
(纸本)9781605585871
this paper presents the concept of pluggable parallelisation that allows scientists to develop "sequential like" codes that can take advantage of multi-core, cluster and grid systems. In this approach parallel applications are developed by plugging parallelisation patterns/idioms into scientific codes (e.g., "sequential like" codes), softening the move from sequential to parallel programming and promoting the separation between domain specific code and parallelisation issues. Pluggable parallelisation combines three characteristics: 1) parallelisation is performed from "outside to inside", localising parallelisation concerns into well defined modules, reducing changes required to the domain specific code and avoiding invasive parallelisation of base code;2) control view is separated from data view promoting a stronger separation of concerns which improves reuse of parallelisation concerns across platforms and enables fine-grained refinements;and 3) abstractions can be composed, supporting the development of more complex patterns based on fine-grained features. this paper presents the concept of pluggable parallelisation and shows how some well-known parallelisation strategies can be implemented in this approach. Results show that this is a feasible approach and performance is competitive with traditional parallel programming. Copyright 2009 ACM.
the proceedings contain 26 papers. the topics discussed include: harnessing parallelism in multicore clusters withthe all-pairs and wavefront abstractions;pluggable parallelisation;DataStager: scalable data staging s...
ISBN:
(纸本)9781605585871
the proceedings contain 26 papers. the topics discussed include: harnessing parallelism in multicore clusters withthe all-pairs and wavefront abstractions;pluggable parallelisation;DataStager: scalable data staging services for petascale applications;interconnect agnostic checkpoint/restart in Open MPI;maintaining reference graphs of globally accessible objects in fully decentralized distributedsystems;adaptive run-time prediction in heterogeneous environments;performance prediction based on hierarchy parallel features captured in multi-processing;CLOUDLET: towards MapReduce implementation on virtual machines;investigating transactional memory performance on ccNUMA machines;an adaptive online system for efficient processing of hierarchical data;high performance wide-area overlay using deadlock-free routing;TakTuk, adaptive deployment of remote executions;live migration of virtual machine based on full system trace and replay;and trace-based evaluation of job runtime and queue wait time predictions in grids.
the proceedings contain 26 papers. the topics discussed include: the modeling of the electron movements inside the atom on the base of the non-quantum physics;applications of one approach to identification of continuo...
ISBN:
(纸本)9780889868083
the proceedings contain 26 papers. the topics discussed include: the modeling of the electron movements inside the atom on the base of the non-quantum physics;applications of one approach to identification of continuous-time systems in self-tuning control;2D analysis of parallel conductors with polygon shape using special boundary segment functions;building a modular multi-sensor simulation framework using cots software and HLA;the automatic attaching function of the cellular data system;an integrated approach for on-line fault detection to hydraulic driven systems;using fatigue analyses from FEA to study the biomechanics of restored teeth with intraradicular posts;evaluation of radar task scheduling algorithms based on simulation methodology;estimation of drag coefficient from free flight data of an artillery rocket using neural networks;modeling and simulation of data center Ethernet;and development of a genetic algorithm for the optimization of hexapod robot parameters.
the proceedings contain 18 papers. the topics discussed include: challenges in code optimization of parallel programs;extensible proof-producing compilation;From Specification to optimization: an architecture for opti...
ISBN:
(纸本)364200721X
the proceedings contain 18 papers. the topics discussed include: challenges in code optimization of parallel programs;extensible proof-producing compilation;From Specification to optimization: an architecture for optimization of Java bytecode;a framework for exploring optimization properties;compile-time analysis and specialization of clocks in concurrent programs;implementation and use of transactional memory with dynamic separation;exploiting speculative TLP in recursive programs by dynamic thread prediction;live debugging of distributedsystems;decorated attribute grammars: attribute evaluation meets strategic programming;SSA elimination after register allocation;register spilling and live-range splitting for SSA-form programs;and loop-aware instruction scheduling with dynamic contention tracking for tiled dataflow architectures.
暂无评论