The main goal of oil reservoir management is to provide more efficient, price-effective and environmentally more secure oil production. Oil production management includes an accurate characterization ...of the reservoir and strategies that involve interactions between reservoir data and human assessment. Hence, it is important to graphically visualize and handle massive data sets of oil and gas pressure / saturation levels to help decision makers in statistical analysis, history matching and recovery of hydrocarbons of the reservoir. In this article, we experimentally study the parallelization of intensive computation for a 3-D (three dimensional) oil reservoir data visualization tool. For this tool, we develop and implement a transformation and lighting model to visualize and react with the grid. Herein, we propose a hybrid (shared memory and distributed memory) parallelization technique to adapt with the data processing scalability. We tested these implementations on OpenStack Cloud Virtual Cluster. Our results indicate that although the virtual platform adds overhead for running parallel implementations, utilizing knowledge of the VM location on the compute host and network traffic among VMs to deploy the virtual environment can achieve significant performance enhancements. Hybrid parallel implementation using large data size can achieve <inline-formula> <tex-math notation="LaTeX">70\times </tex-math></inline-formula> speedup over serial execution without owning a costly HPC infrastructure as the conventional parallel processing deployment model.
th The purpose of the 11 Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2010) held on June 9 - 11, 2010 in London, United Kingdom ...was to bring together researchers and scientists, businessmen and entrepreneurs, teachers and students to discuss the numerous fields of computer science, and to share ideas and information in a meaningful way. Our conference officers selected the best 15 papers from those papers accepted for presentation at the conference in order to publish them in this volume. The papers were chosen based on review scores submitted by members of the program committee, and underwent further rounds of rigorous review. In Chapter 1, Cai Luyuan et al. Present a new method of shape decomposition based on a refined morphological shape decomposition process. In Chapter 2, Kazunori Iwata et al. propose a method for reducing the margin of error in effort and error prediction models for embedded software development projects using artificial neural networks (ANNs). In Chapter 3, Viliam Simko et al. describe a model-driven tool that allows system code to be generated from use-cases in plain English. In Chapter 4, Abir Smiti and Zied Elouedi propose a Case Base Maintenance (CBM) method that uses machine learning techniques to preserve the maximum competence of a system. In Chapter 5, Shagufta Henna and Thomas Erlebach provide a simulation based analysis of some widely used broadcasting schemes within mobile ad hoc networks (MANETs) and propose adaptive extensions to an existing broadcasting algorithm.
Network and Parallel Computing Park, James J; Zomaya, Albert Y; Yeo, Sang-Soo ...
2012, 2015-03-18, Letnik:
7513
eBook, Conference Proceeding, Book
Recenzirano
This book constitutes the refereed post-proceedings of the 9th IFIP International Conference on Network and Parallel Computing, NPC 2012, held in Gwangju, Korea, in September 2012. The 38 papers ...presented were carefully reviewed and selected from 136 submissions. The papers are organized in the following topical sections: algorithms, scheduling, analysis, and data mining; network architecture and protocol design; network security; paralel, distributed, and virtualization techniques; performance modeling, prediction, and tuning; resource management; ubiquitous communications and networks; and web, communication, and cloud computing. In addition, a total of 37 papers selected from five satellite workshops (ATIMCN, ATSME, Cloud&Grid, DATICS, and UMAS 2012) are included.
In this paper, we investigate how to efficiently implement TDMA (Time Division Multiple Access) on a wormhole switched network using a pure software solution in the end nodes. Transmission is ...conflict free on the time-slot level and hence deadlock free. On the sub- slot level, however, conflicts are possible when using early sending, a method we propose in order to reduce latency while still not hazarding the TDMA schedule. We propose a complete system to offer services for dynamic establishment of guaranteed periodic real-time virtual channels. Two different clock synchronization approaches for integration into the TDMA system are discussed. Implementation and experimental studies have been done on a cluster of PCs connected by a Myrinet network. Also, a case study with a radar signal processing application is presented to show the usability. A best-case reduction of the latency of up to 37 percent for 640 Byte messages by using early sending in Myrinet is shown in the case study. Source routed wormhole switching networks are assumed in the work but the results are applicable on some other categories of switched networks too.
Ghulam Chaudhry; Edwin Sha
In this paper, we investigate how to efficiently implement TDMA (Time Division Multiple Access) on a wormhole switched network using a pure software solution in the end nodes. Transmission is conflict free on the time-slot level and hence deadlock free. On the sub- slot level, however, conflicts are possible when using early sending, a method we propose in order to reduce latency while still not hazarding the TDMA schedule. We propose a complete system to offer services for dynamic establishment of guaranteed periodic real-time virtual channels. Two different clock synchronization approaches for integration into the TDMA system are discussed. Implementation and experimental studies have been done on a cluster of PCs connected by a Myrinet network. Also, a case study with a radar signal processing application is presented to show the usability. A best-case reduction of the latency of up to 37 percent for 640 Byte messages by using early sending in Myrinet is shown in the case study. Source routed wormhole switching networks are assumed in the work but the results are applicable on some other categories of switched networks too.
Ghulam Chaudhry; Edwin Sha
PDF
