A fault-tolerant conference key distribution scheme based on mechanism of identity-based cryptography and (t,n) threshold secret sharing is proposed in this paper. this scheme is much different to traditional ones, it...
详细信息
ISBN:
(纸本)9780769527369
A fault-tolerant conference key distribution scheme based on mechanism of identity-based cryptography and (t,n) threshold secret sharing is proposed in this paper. this scheme is much different to traditional ones, its secret shadows are not brought from the sponsor of conference, but from each server's private key signature. By getting together these n secret shadows, the sponsor can construct polynomial. Any of conferees invited by the sponsor can request these secret shadows from t of these n servers, and then restitute conference key by them. In all courses of conference key distribution and reconstruction, every member's identity can be easily validated, so it can be prevented from all kinds of cheat.
Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmabil...
详细信息
ISBN:
(纸本)0818678135
Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmability of such systems, by providing globally accessible 'object' abstractions, Researchers have developed consistency protocols for replicated 'memory' objects. these protocols are well suited to scientific applications but less suited to multimedia or groupware applications. this paper addresses the state sharing needs of complex distributedapplications with (1) high-frequency symmetric accesses to shared objects, (2) unpredictable and limited locality of accesses, (3) dynamically changing sharing behavior, and (4) potential data races. We show that a DSO system exploiting application-level temporal and spatial constraints an shared objects can outperform shared object protocols which do not exploit application-level constraints. We compare our S(emantic) DSO against entry consistency using a sample application having the four properties mentioned above.
the emergence of Big Data applications provides new challenges in data management such as processing and movement of masses of data. Volunteer computing has proven itself as a distributed paradigm that can fully suppo...
详细信息
ISBN:
(纸本)9781479983346
the emergence of Big Data applications provides new challenges in data management such as processing and movement of masses of data. Volunteer computing has proven itself as a distributed paradigm that can fully support Big Data generation. this paradigm uses a large number of heterogeneous and unreliable Internet-connected hosts to provide Peta-scale computing power for scientific projects. Withthe increase in data size and number of devices that can potentially join a volunteer computing project, the host bandwidth can become a main hindrance to the analysis of the data generated by these projects, especially if the analysis is a concurrent approach based on either in-situ or in-transit processing. In this paper, we propose a bandwidth model for volunteer computing projects based on the real trace data taken from the Docking@Home project with more than 280,000 hosts over a 5-year period. We validate the proposed statistical model using model-based and simulation-based techniques. Our modeling provides us with valuable insights on the concurrent integration of data generation with in-situ and in-transit analysis in the volunteer computing paradigm.
In this paper, we present an approach to perform statistical model-checking over stochastic distributed programs using the SimGrid framework. the distributed programs are modeled using SimGrid, a fast and lightweight ...
详细信息
ISBN:
(纸本)9789897584442
In this paper, we present an approach to perform statistical model-checking over stochastic distributed programs using the SimGrid framework. the distributed programs are modeled using SimGrid, a fast and lightweight framework for the simulation of distributed programs, which we have enhanced in three ways: a cleaner description of the probabilistic evolution of the capacities of resources, a centralized random number generator, and a protocol for the observation of the simulations. We also propose a toolset for the statistical model-checking of those simulated distributed programs, and in particular a prototype tool SimGridStatMC. the toolset is illustrated to evaluate various properties of an implementation of the peer to peer BitTorrent protocol.
parallel pattern libraries (e.g., Intel TBB) are popular and useful tools for developing applications in SMP environments at a higher level of abstraction. Such libraries execute user-provided code efficiently on shar...
详细信息
ISBN:
(纸本)9781479983346
parallel pattern libraries (e.g., Intel TBB) are popular and useful tools for developing applications in SMP environments at a higher level of abstraction. Such libraries execute user-provided code efficiently on shared memory parallel architectures in accordance with well-defined execution patterns like parallel for-loops or pipelines. For heterogeneous architectures comprised of CPUs and accelerators, OpenCL has gained a lot of momentum. Since accelerated architectures do not provide a shared memory, it is not possible to directly use the approach taken in pattern libraries for SMP systems for OpenCL as well. In this paper, we are exploring issues and opportunities encountered by attempts to provide such patterns in the context of OpenCL. Based on a set of experiments with a scientific application on diverse OpenCL devices, we point out major pitfalls and insights, and outline directions for further efforts in developing pattern libraries for OpenCL.
Using effective scheduling strategies to improve turnaround time, slowdown, and utilization is an important consideration in large supercomputing environments. Since such machines have traditionally used non-preemptio...
详细信息
Advancement in parallel computers technology has greatly influenced the numerical methods used for solving partial differential equations (pdes). A lot of attention has been devoted to the development of numerical sch...
详细信息
ISBN:
(纸本)9780769534435
Advancement in parallel computers technology has greatly influenced the numerical methods used for solving partial differential equations (pdes). A lot of attention has been devoted to the development of numerical schemes which are suitable for the parallel environment. In this work, we investigate the parallel implementation of the four-point Modified Explicit Decoupled Group (MEDG) method which was introduced by Ali and Ng (2007) as a fast solver for the two dimensional Poisson pde. the method was shown to be more superior than all the methods belonging to the four-points explicit group family namely the Explicit Group (EG) [8], Explicit Decoupled Group (EDG) [1] and Modified Explicit Group (MEG) [7]. this paper presents the preliminary results of the parallel algorithms implemented on a distributed memory PC cluster. Two parallelizing strategies comprising of the two-color zebra and the four-color chessboard orderings in solving a two dimensional Poisson model problem will be discussed.
Sensor networks have become ubiquitous - being present from personal smartphones to smart cities deployments - and are producing large volumes of data at increasing rates. distributed event stream processing systems, ...
详细信息
ISBN:
(纸本)9781450351959
Sensor networks have become ubiquitous - being present from personal smartphones to smart cities deployments - and are producing large volumes of data at increasing rates. distributed event stream processing systems, in its turn, are a specific kind of systems that help us to parallelize event processing. therefore, they provide us capabilities to produce quick insights and decisions, in near real-time, on top of multiple data streams. However, current systems for large scale processing do not focus on Internet of things and Sensor Network workloads, which makes the performance decrease quickly as the workload size increases. In order to process large scale events with acceptable latency percentiles and high throughput, special systems are needed, such as distributed event stream processing systems. In this work, we propose an architecture for Internet of things data workloads, in a combination of sensor networks data sources and distributed event stream processing systems, focused on smart grid data profiles. In our evaluations, the system was able to process up to 45K messages per second using 8 processing nodes, while providing stable latencies for micro-batches above 30 seconds.
During the last twenty years the lattice Boltzmann method (LBM) has been developed as an alternative approach for modeling of fluid dynamics. A parallel implementation of the LBM for 3D fluid dynamics simulations usin...
详细信息
ISBN:
(纸本)9783642032745
During the last twenty years the lattice Boltzmann method (LBM) has been developed as an alternative approach for modeling of fluid dynamics. A parallel implementation of the LBM for 3D fluid dynamics simulations using the Fortran-DVM language is presented. the LBM is parallelized by using spatial decomposition and implemented on a distributed memory cluster MVS-100K. the test problem has been solved for different number of processors (from 1 to 1024). Pictures of flows are compared visually withthe similar pictures published in the literature.
Pattern recognition applications such as natural phenomena detection and structural health monitoring have been widely applied using wireless sensor networks. these applications involve large amount of data to be anal...
详细信息
ISBN:
(纸本)9780769534435
Pattern recognition applications such as natural phenomena detection and structural health monitoring have been widely applied using wireless sensor networks. these applications involve large amount of data to be analysed, and thus incur high computational time and complexity In this paper we present a parallel associative memory-based pattern recognition algorithm known as distributed Hierarchical Graph Neuron (DHGN). It is a single-cycle learning algorithm with in-network processing capability;able to reduce computational loads by efficiently disseminates recognition processes throughout the network. Hence, suitable to be deployed in wireless sensor networks. the results of the accuracy and scalability tests show that our system performs with high accuracy and remains scalable for increases in pattern size and the number of stored patterns. the response time for pattern recognition remains within milliseconds irrespective of the size of the network.
暂无评论