Recently, most researches in the area of wireless sensor networks are limited to the ground environment, so the demand for underground wireless sensor networks is increasing. However the underground environment is dif...
详细信息
ISBN:
(纸本)9780769536422
Recently, most researches in the area of wireless sensor networks are limited to the ground environment, so the demand for underground wireless sensor networks is increasing. However the underground environment is different from the ground environment in that there are some critical problems in reliability due to the large path loss of the underground. therefore, in this paper we propose an opportunistic routing protocol for improving the reliability in the underground environment. through the test-bed experiments the proposed routing protocol is compared with other routing protocols.
It’s our pleasure to bring you this special issue of the international Journal of parallel Programming on the network and parallelcomputing. Prior to the publication to this special issue, all papers were presented ...
详细信息
It’s our pleasure to bring you this special issue of the international Journal of parallel Programming on the network and parallelcomputing. Prior to the publication to this special issue, all papers were presented in the 10th IFIP internationalconference on Network and parallelcomputing (NPC’13) held from September 19 to September 21 2013 in Guiyang, China. Since 2003, NPC has become a valuable venue for engineers and scientists to present their excellent ideas and experiences in system?fields of distributed and parallelcomputing. the NPC 2013 continues this tradition and in particular extends areas of interest to Big data computing and parallel and multicore issues and opportunities. Huazhong University of Science and Technology, China organized this year’s NPC conference.
In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementation strategies for HT-based dense polynomial multip...
详细信息
ISBN:
(纸本)9781424452910
In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementation strategies for HT-based dense polynomial multiplication targeting multi-cores. We show that balanced input data can maximize parallel speedup and minimize cache complexity for bivariate multiplication. However, unbalanced input data, which are common in symbolic computation, are challenging. We provide efficient techniques, what we call contraction and extension, to reduce multivariate (and univariate) multiplication to balanced bivariate multiplication. Our implementation in Cilk++ demonstrates good speedup on multi-cores.
Paper presents an advanced Iterative MapReduce MPI oil reservoir simulator. First we present an overview of working implementations that make use of the same technologies. then we define an academic example of numeric...
详细信息
ISBN:
(纸本)9789897581397
Paper presents an advanced Iterative MapReduce MPI oil reservoir simulator. First we present an overview of working implementations that make use of the same technologies. then we define an academic example of numeric problem with an emphasis on its computational features. We present a distributedparallel algorithm of hybrid solution of the problem using MapReduce Hadoop and MPI technologies and describe an improved variant of the algorithm using memory-mapped files.
the internationalparallel and distributed Processing Symposium (IPDPS) 2008 panel withthe title "How to avoid making the same Mistakes all over again: What the parallel-processing Community has (failed) to offe...
详细信息
the internationalparallel and distributed Processing Symposium (IPDPS) 2008 panel withthe title "How to avoid making the same Mistakes all over again: What the parallel-processing Community has (failed) to offer the multi/many-core Generation" sought to provoke discussion on current and recent computer science education in relation to the emergence of fundamentally parallel multi/many-core systems. Is today's/tomorrow's/yesterday's computer science graduate equipped to deal withthe challenges of parallel software development for such systems? Are mistakes from the past being unnecessarily repeated? What are the fundamental contributions of the parallel processing research community to the current state of affairs that are possibly being ignored? What are the new challenges that have not been addressed in past parallel processing research? How should computer-science education in parallel processing look like? Should it be taught at all? To the extent that there was consensus among the panelists, they agreed on the premise for the panel, namely that there is a mismatch in computer-science education concerning parallelism, and that there may be reasons to be concerned. they agreed on stressing the importance of (a) applications as a driving factor in research and education, (b) parallel algorithms, and of (c) focusing on the ease of parallel programming and not exclusively on parallel performance, and cited for instance heterogeneous parallelism and power awareness as new issues for the multi-core generation. the panelists were Hideharu Amano (Keio University), John Gustafson (Clearspeed technologies), Keshav Pingali (University of Austin, Texas), Vivek Sarkar (Rice University), Uzi Vishkin (University of Maryland), and Katherine Yelick (University of California at Berkeley). the panel was organized and moderated by the author. (c) 2009 Elsevier Inc. All rights reserved.
Finite difference time domain (FDTD) method is a robust and accurate algorithm which is widely used in computational electromagnetic field and the simulation of optical phenomenon. In this paper, parallel FDTD based o...
详细信息
ISBN:
(纸本)9780769548791
Finite difference time domain (FDTD) method is a robust and accurate algorithm which is widely used in computational electromagnetic field and the simulation of optical phenomenon. In this paper, parallel FDTD based on overlapped domain decomposition is used to simulate the band gap of photonic crystals and the quantum efficiency of thin-film solar cells. the light-trapping effect is also analyzed by parallel FDTD, it's very important to improve light absorption. Numerical result demonstrates that the accuracy and the speedup of parallel FDTD are very high for large scale problem.
Using parallel Geographic Image Processing System, the flooding disaster will be monitoring and evaluating in time. Using ParGIP to establish background database and process RS images, we can get the losses of the dis...
详细信息
ISBN:
(纸本)0780378407
Using parallel Geographic Image Processing System, the flooding disaster will be monitoring and evaluating in time. Using ParGIP to establish background database and process RS images, we can get the losses of the disaster by overlaying operation in 24 hours. According to the experiment in the Poyang Lake region, this method can promote the speed and the efficiency of the monitoring and evaluating of flooding disaster to several times.
A wide variety of grid technologies have already been researched and developed withthe main aim of implementing high-performance computing. Even the major vendors are actively researching and developing grid technolo...
详细信息
ISBN:
(纸本)9780889865877
A wide variety of grid technologies have already been researched and developed withthe main aim of implementing high-performance computing. Even the major vendors are actively researching and developing grid technology, and have brought out numerous systems and software products. the grid allows distributed environments to be constructed on a global scale through the use of large numbers of computers. In fact numerous grids have already been constructed on a global scale and are being used in practice as the infrastructure for distributed processing environments. Meanwhile, studies have also been conducted withthe aim of using the grid infrastructure as a ubiquitous distributed processing environment. However, grid middleware has chiefly been developed in order to implement high-performance computing, so in order to use it in a ubiquitous environment it would be necessary to investigate the functions that ubiquitous environments would need to have from the viewpoint of grid middleware. In this study we will outline the latest research trends where the grid is used as a ubiquitous environment, particularly with regard to the points of intersection between the grid and the ubiquitous environment, and we will investigate the functions needed when applying ubiquitous environments to grid middleware.
Withthe continuous development of GPUs, modern general-purpose computation on GPUs (GPGPUs) is providing growing parallelism to general programs besides graphics applications. However, for those programs that involve...
详细信息
ISBN:
(纸本)9780769548791
Withthe continuous development of GPUs, modern general-purpose computation on GPUs (GPGPUs) is providing growing parallelism to general programs besides graphics applications. However, for those programs that involve both CPU and GPU, the data transmission bandwidth between them may become bottleneck that prevents GPU from fully exploiting its parallelcomputing capacity. As to avoid the defect, we try to reduce the data transmission by keeping part of the computation tasks on the CPU side other than sending all the data over to the GPU and process there. In this way the computation is done on CPU and GPU in parallel, and therefore also reduces overall process time. In order to split the computation workload in a systematic approach, we try to divide the corresponding data into chunks of proper size. We experimented our data dividing and heterogeneous memory scheduling with 2 benchmarks. the matrix multiplication is more than 30% faster, and the k - means2D is nearly 10% faster, than running solely in GPU.
the main contribution of this paper is to present an efficient parallel sorting "psort" compatible withthe standard qsort. Our parallel sorting "psort" is implemented such that its interface is co...
详细信息
ISBN:
(纸本)9781424452910
the main contribution of this paper is to present an efficient parallel sorting "psort" compatible withthe standard qsort. Our parallel sorting "psort" is implemented such that its interface is compatible with "qsort" in C Standard Library. therefore, any application program that uses standard "qsort" can be accelerated by simply replacing "qsort" call by our "psort". Also, "psort" uses standard "qsort" as a "subroutine for local sequential sorting. So, if the performance of "qsort" is improved by anyone in the community, then that of our "psort" is also automatically improved. To evaluate the performance of our "psort", we have implemented our parallel sorting in a Linux server with two Intel quad-core processors (i.e. eight processor cores). the experimental results show that our "psort" is approximately 6 times faster than standard "qsort" using 8 processors. Since the speed up factor cannot be more than 8 if we use 8 cores, our algorithm is close to optimal. Also, as far as we know, no previously published parallel implementations achieve a speed up factor less than 4 using 8 cores.
暂无评论