Synthetic aperture radar (SAR)-based platforms have to process increasingly large number of complex floating-point operations and have to meet hard real-time deadlines. However, real-time use of SAR is severely restri...
详细信息
ISBN:
(纸本)9789811024719;9789811024702
Synthetic aperture radar (SAR)-based platforms have to process increasingly large number of complex floating-point operations and have to meet hard real-time deadlines. However, real-time use of SAR is severely restricted by computation time taken for image formation. One of the classical methods of reducing this computation time to make it suitable for real-time application is multi-processing. A successful attempt has been made by the authors to develop and test a parallel algorithm for synthetic aperture radar image formation, and the results are presented in this paper.
Despite the continuous advances of the last years in grid computing, the grid computing programming paradigms are dominated by the message passing concept. There is little support for other paradigms such as shared da...
详细信息
ISBN:
(纸本)9783540695004
Despite the continuous advances of the last years in grid computing, the grid computing programming paradigms are dominated by the message passing concept. There is little support for other paradigms such as shared data or associative programming. In this paper we analyze some of the existing solutions for grid shared data programming and highlight some of their drawbacks. We propose a new architecture and its core features as well as new evaluation means of its behavior in various scenarios including the next generation grid systems. In addition to the simplicity of our solution, we believe that it would allow us to easily apply further extensions.
The Laplace transform in time has been shown to provide an excellent alternative to the finite difference method for the solution of parabolic problems associated with partial differential equations. An implementation...
详细信息
The Laplace transform in time has been shown to provide an excellent alternative to the finite difference method for the solution of parabolic problems associated with partial differential equations. An implementation of the Laplace transform method in a parallel environment can provide a concurrent solution process with no communication overhead. The Laplace transform in time, when applied to the diffusion problem, results in a modified Helmholtz equation in the transform space. The diffusion problem is solved in a parallel environment in which the elliptic problem in transform space is solved using finite differences, finite elements, boundary elements, the method of fundamental solutions and Kansa's multiquadric method.
M&S is a decision support technique that enables stakeholders to make better and more informed decisions;application of this to supply chains is referred to as supply chain simulation. The increasingly interconnec...
详细信息
ISBN:
(纸本)9781479974863
M&S is a decision support technique that enables stakeholders to make better and more informed decisions;application of this to supply chains is referred to as supply chain simulation. The increasingly interconnected enterprise of the digital age benefit from cooperative decision making through the utilization of existing technological foundations, standards and tools (e.g., computer networks, data sharing standards, tools for collaborative working). distributed Supply Chain Simulation (DSCS) facilitates such collective decision making by enabling simulation models of individual business processes/organizations to execute cooperatively over a computer network. The aim of this research is to identifying the advances in DSCS and its present state of play. Towards realization of this aim we present a methodological review of literature and complement this with our domain-specific knowledge in supply chains and parallel and distributed simulation.
Increase in intensive applications with different computational requirements, coupled with the unification of remote and diverse resources thanks to advances in the wide-area network technologies and the low cost of c...
详细信息
ISBN:
(纸本)9780769527840
Increase in intensive applications with different computational requirements, coupled with the unification of remote and diverse resources thanks to advances in the wide-area network technologies and the low cost of components, have-encouraged the development of grid computing. To exploit the promising potentials of geographically distributed resources, effective and efficient mapping algorithms are fundamental. Since the problem of optimally mapping is NP-complete, the development of evolutionary techniques to find near-optimal solutions is welcome. In this paper a distributed system based on Differential Evolution is designed and implemented to face the mapping problem in a gild environment aiming at reducing the degree of use of the grid resources. This system is tested on some different resource allocation scenarios.
Large clustered computers provide low-cost compute cycles, and therefore have promoted the development of sophisticated parallel-programming algorithms based on the Message Passing Interface. Storage platforms, howeve...
详细信息
ISBN:
(纸本)088986568X
Large clustered computers provide low-cost compute cycles, and therefore have promoted the development of sophisticated parallel-programming algorithms based on the Message Passing Interface. Storage platforms, however, fall to keep pace with similar advances. This paper compares standard 4X InfiniBand (IB) to 10-Gigabit Ethernet (GbE) for Use as a common storage infrastructure in addition to message passing. Considering IB's native ability to accelerate protocol processing in hardware, the Ethernet hardware in this study provided similar acceleration using TCP Offload Engines. We evaluated their I/O perfon-nance using the IOZONE benchmark on the iSCSI-based TerraGRID parallel filesystem. Our evaluations show that 10GbE, with or without protocol-offload, offered better throughput and latency than IB to socket-based applications. Although protocol-offload in both 10GbE and IB demonstrated significant improvement in I/O performance, large amount of CPU are still being consumed to handle the associated data-copies and interrupts. The emerging RDMA technologies hold promises to remove the remaining CPU overhead. We plan to continue our study to research the applications of RDMA in parallel I/O.
The proceedings contains 137 papers on High Performance computing on the Information Superhighway. Topics discussed include: stock processors;multithreaded parallel machines;Hamiltonian cycles;hypercube graphs;distrib...
详细信息
The proceedings contains 137 papers on High Performance computing on the Information Superhighway. Topics discussed include: stock processors;multithreaded parallel machines;Hamiltonian cycles;hypercube graphs;distributed shared memory;doubly chordal graphs;three dimensional virtual space;voronoi diagram;computed tomography;hierarchical bus based systems;homogenization method;task parallel language;single program multiple data;process communication graph;visual programming;tracing systems;workstation clustering;Crout factorization;hybrid full map directory schemes;geostationary satellites;and multistage interconnection networks.
The ubiquity of mobile devices coupled with the advances in Internet of Things (IoT) technologies has led to the development of large-scale applications that can collect information about people and their environments...
详细信息
ISBN:
(纸本)9780769557854
The ubiquity of mobile devices coupled with the advances in Internet of Things (IoT) technologies has led to the development of large-scale applications that can collect information about people and their environments in real-time. Such applications are referred to as Mobile Crowdsensing (MCS). In MCS, tasks are allocated to participants (mobile devices) by a remote server according to the application requirements. The key challenge is reducing the energy consumption of the participating mobile devices. One of the effective approaches to reduce energy consumption of MCS applications is to improve efficiency of task allocation. An efficient task allocation approach can optimize several aspects of MCS applications such as task coverage (minimum number of participants required for a MCS task), data quality, and sensing costs. In this paper, we propose a novel Context-Aware Task Allocation (CATA) approach that aims to allocate sensing tasks to the best participant set while improving energy efficiency in MCS applications. Another important feature of the proposed CATA approach is that it preserves the privacy of participants' by only disclosing the less sensitive data to the server. The proposed approach employs local and global task allocation methods to enable two levels of data sharing and privacy. We describe the series of experiments that were conducted to validate our proposed approach in terms of coverage and efficiency.
In a distributed-computing environment, it is important to ensure that the processor workloads are adequately balanced. Among numerous load-balancing algorithms, a unique approach due to Das and Prasad defines a symme...
详细信息
In a distributed-computing environment, it is important to ensure that the processor workloads are adequately balanced. Among numerous load-balancing algorithms, a unique approach due to Das and Prasad defines a symmetric broadcast network (SBN) that provides a robust communication pattern among the processors in a topology-independent manner. In this paper, we propose and analyze three SBN-based load-balancing algorithms, and implement them on an SP2. A thorough experimental study with Poisson-distributed synthetic loads demonstrates that these algorithms are very effective in balancing system load while minimizing processor idle time. They also compare favorably with several existing techniques.
A distributed processing System is a collection of heterogeneous processors which requires systematic assignment of a set of "m" tasks T = {t(1), t(2) ... t(m)} of a program to a set of "n" process...
详细信息
ISBN:
(数字)9788132204879
ISBN:
(纸本)9788132204862
A distributed processing System is a collection of heterogeneous processors which requires systematic assignment of a set of "m" tasks T = {t(1), t(2) ... t(m)} of a program to a set of "n" processors P = {p(1), p2 ... p(n)}, (where, m >> n) to achieve the efficient utilization of available processor's capacity. If this step is not performed properly, an increase in the number of processors may actually result in a decrease in the total system throughput. The Inter-Task Communication (ITC) time is always the most costly and the least reliable factor in distributed processing environment. This paper deals a heuristic task allocation model which performs the proper allocation of task to most suitable processor to get an optimal solution. A fuzzy membership functions is developed for making the clusters of tasks with the constraints to maximize the throughput and minimize the parallel execution time of the system.
暂无评论