Let S : [0, 1] -> [0, 1] be a nonsingular mapping and P : L-1 (0, 1) -> L-1 (0, 1) be the corresponding Frobenius-Perron operator. In this paper, we present the parallel Monte Carlo schemes for the L-1-error ana...
详细信息
ISBN:
(纸本)1932415610
Let S : [0, 1] -> [0, 1] be a nonsingular mapping and P : L-1 (0, 1) -> L-1 (0, 1) be the corresponding Frobenius-Perron operator. In this paper, we present the parallel Monte Carlo schemes for the L-1-error analysis that is used for the computation of a fixed density of P. Efficiency analysis and numerical results for the different parallel schemes are also included.
As the increased deployment of wireless LAN's (WLAN) in many popular locations with multiple access points (AP), there is the need to develop distributed radio channel allocation (RCA) schemes to improve channel u...
详细信息
ISBN:
(纸本)1932415610
As the increased deployment of wireless LAN's (WLAN) in many popular locations with multiple access points (AP), there is the need to develop distributed radio channel allocation (RCA) schemes to improve channel utilization. The existing static RCA schemes could optimally allocate channels in the initial planning of APs. but cannot adapt to dynamic network environment and traffic conditions afterwards. In this paper, we propose a new distributed and dynamic RCA scheme that is aimed at not only improving the channel utilization of general ad hoc WLANs, but also meeting the traffic denmand for each AP. Simulation results have demonstrated the effectiveness of proposed new RCA scheme.
Launching an attack is easy, but detection and response is a painfully slow and often a manual process. A good network address resource database which provides location information of hosts can improve the response ca...
详细信息
ISBN:
(纸本)1932415610
Launching an attack is easy, but detection and response is a painfully slow and often a manual process. A good network address resource database which provides location information of hosts can improve the response capability, of security department. This paper discusses the limitation of public resource platforms and introduces a framework for supporting Internet emergency services effectively. In our distributed architecture, some techniques of IP data management including collection, reformation and collaboration of IP data, are employed to solve the problem such as stale information, bad data organization and Bad query service, which exist in public network resources platforms now. The effects of these techniques are exhibited in this paper.
As requirements for technical computing applications become more complex, engineers and scientists must solve problems of increasing computational intensity that frequently outstrip the capability of their own compute...
详细信息
ISBN:
(纸本)1424407281
As requirements for technical computing applications become more complex, engineers and scientists must solve problems of increasing computational intensity that frequently outstrip the capability of their own computers. Some are distributedapplications (also called coarse-grained or embarrassingly parallelapplications), where the same algorithm is independently executed over and over on different input parameters. Others consist of parallel (or fine-grained) applications, which contain interdependent tasks that exchange data during the execution of the application. This article introduces the distributed and parallel computing capabilities in The MathWorks distributed computing tools and provides examples of how these capabilities are applied to signal processingapplications.
The MPEG-4 coding algorithm based on the frame is very similar to the present moving image coding algorithm but is very difficult to obtain an enough coding performance using a processor due to the high complexity of ...
详细信息
ISBN:
(纸本)1892512416
The MPEG-4 coding algorithm based on the frame is very similar to the present moving image coding algorithm but is very difficult to obtain an enough coding performance using a processor due to the high complexity of algorithm. In this paper a parallelprocessing method simultaneous using multiprocessors were used for increasing the coding speed, and an algorithm that the processing speed can be linearly increased by the increasing of the number of processors in parallelprocessing without depending a particular hardware platform was implemented.
The image processing architecture reported in [13][14] has been significantly restructured and enhanced for better parallel performance and scalability since previously presented. The topology of the distributed archi...
详细信息
ISBN:
(纸本)1892512459
The image processing architecture reported in [13][14] has been significantly restructured and enhanced for better parallel performance and scalability since previously presented. The topology of the distributed architecture has been extensively modified, and the underlying CPU-intensive image correlation process has been re-organized for improved parallel efficiency and scalability performance. This revision of the subject code now successfully implements a novel and highly sophisticated hybrid-serial-parallel-pipeline, threaded, client-server, distributed-memory architecture for processing images in a continuous stream on a Beowulf PC Cluster computer without encountering either computation or communication bottlenecks. Performance is limited only by: a) the overall image size;b) the number of parallel nodes performing the computations;c) the speed of the individual processors in the PC Cluster computer;and, d) the bandwidth of the interconnecting communication network. In a recent test, 300-by-220 pixel sized images were being processed through the code at a steady rate exceeding 2 images/per second, with computation rates exceeding 600 million floating operations per second (600 MFLOPS).
Multi-authority attribute-based encryption (ABE) is regarded as one of the most promising techniques to handle the problem of the access control of shared data because it provides fine-grained access control of encryp...
详细信息
ISBN:
(纸本)9781538637906
Multi-authority attribute-based encryption (ABE) is regarded as one of the most promising techniques to handle the problem of the access control of shared data because it provides fine-grained access control of encrypted data in cloud storge. However, most existing multi-authority ABE schemes suffer from expensive computational cost on the user side, which increases with the complexity of access structures. In this paper, we present a novel large universe decentralized ABE scheme with outsourced encryption and decryption based on the multi-authority system for mobile cloud computing. A majority of complex and expensive computation operations are migrated to the encryption and decryption proxy server respectively, so we can minimize the computation overhead for the data users simultaneously. The theoretical analysis indicates that our scheme is correct with static security in the random oracle model. Furthermore, the analytical comparison and extensive experimental results demonstrate that our scheme is efficient.
Today's middleware applications tend to be complicated, and consist of tiers that form a nested chain of objects or processes. Fora real-time nested application, predictability is crucial, even when faults and res...
详细信息
ISBN:
(纸本)1892512459
Today's middleware applications tend to be complicated, and consist of tiers that form a nested chain of objects or processes. Fora real-time nested application, predictability is crucial, even when faults and restarts occur Nested applications make it challenging to predict the processing time when faults occurs. The fault-defection and recovery times are influenced by the number of tiers, the tier in which the fault occurs, the state of the end-to-end processing when the fault occurs, and the processing time of each tier We investigate the behavior of nested CORBA applications when faults occur in different tiers, and at different stages of the nested processing. We present a model for predicting the worst-case fault-detection and fail-over times for such nested applications.
This paper describes the performance improvements achieved by a data-intensive application by controlling the storage policies and algorithms of a distributed storage system. The Network Storage Manager (NSM) is a mas...
详细信息
ISBN:
(纸本)1932415262
This paper describes the performance improvements achieved by a data-intensive application by controlling the storage policies and algorithms of a distributed storage system. The Network Storage Manager (NSM) is a mass distributed storage framework with a unique architecture that provides applications with the high-performance features they need It also provides, the standard most commonly used implementation for storage policies. distributed Terrain Viewer (DTViewer) is an application that utilizes NSM architecture and for efficient and reliable data delivery. Moreover, it exploits NSM controllable architecture by plugging-in its application-specific optimized implementations. DTViewer overrides the default NSM policies that do not understand its sophisticated access patterns, partitioning, and storage layout requirements. Experimental results have show significant improvement achieved when the application-tailored implementation are used. Such speedups are not achievable on storage systems with no application control such as the parallel Virtual File System PVFS.
Large scale parallel machines are subject to system-wide power budgets (or caps). As these machines grow in capacity, they can concurrently execute dependent applications that were previously processed serially. Such ...
详细信息
ISBN:
(纸本)9781450365109
Large scale parallel machines are subject to system-wide power budgets (or caps). As these machines grow in capacity, they can concurrently execute dependent applications that were previously processed serially. Such application coupling saves JO and time as the applications now communicate at runtime instead of through disk. Such coupled applications are predicted to be a major workload for future exascale supercomputers;e.g., scientific simulations will execute concurrently with in situ analysis. While support for system-wide power caps has been widely studied, prior work does not consider the impact on coupled applications. We study techniques for maximizing coupled application performance under a system-wide power cap and implement them on a 26-node cluster. We compare to SLURM, a state-of-the-art job scheduler that considers power, but not coupling. The proposed techniques increase mean performance over SLURM by 7-14%. Un-like existing approaches, the proposed techniques also recognize when it is not possible to increase performance and, instead, reduce energy, achieving 18% energy reduction for a 5% performance loss. Finally, the dynamic techniques are resilient to tail behavior and system noise, improving performance in noisy environments by 30-36%.
暂无评论