Existing Grid monitoring approaches do not combine three desirable features: on-line access to monitoring data, advanced query capabilities and data reduction. We present a solution for on-line monitoring of large-sca...
详细信息
ISBN:
(纸本)9783642314995;9783642315008
Existing Grid monitoring approaches do not combine three desirable features: on-line access to monitoring data, advanced query capabilities and data reduction. We present a solution for on-line monitoring of large-scale computing infrastructures based on Complex Event Processing principles and technologies. We focus on leveraging CEP for distributed processing of client queries and monitoring data streams. this results in significant reduction of network traffic due to on-line monitoring. We discuss benefits of CEP-based approach to monitoring and describe details of processing queries in a distributed way. A case study monitoring of load caused by jobs in a Grid infrastructure is presented. Performance evaluation to investigate monitoring overhead in terms of CPU, memory and network traffic is also provided.
the proceedings contain 66 papers. the topics discussed include: design and implementation of service composition protocol based on DSR;Hamiltonian cycle embedding in hierarchical crossed cubes;systematic development ...
ISBN:
(纸本)9780769542874
the proceedings contain 66 papers. the topics discussed include: design and implementation of service composition protocol based on DSR;Hamiltonian cycle embedding in hierarchical crossed cubes;systematic development of correct bulk synchronous parallel programs;multiple search centers based fast motion estimation algorithm for H.264/AVC;transient congestion avoidance in software distributed shared memory systems;experiences with hierarchical storage management support in blue whale file system;commit protocols for a distributed transactional memory;a feature-based replica consistency strategy for spatial data in distributed GIS;integrating DBMSs as a read-only execution layer into hadoop;multi-aggregate-query scheduling over data streams;and Rawls scheduler: load considered proportional share scheduling for high performance multimedia systems.
D-ReServE increases reliability of SOA-based systems in case of failure occurrence. the fault-tolerant information in D-ReServE is stored in the Stable Storage, which available space depletes with time. thus, in this ...
详细信息
ISBN:
(纸本)9781467357043
D-ReServE increases reliability of SOA-based systems in case of failure occurrence. the fault-tolerant information in D-ReServE is stored in the Stable Storage, which available space depletes with time. thus, in this paper we propose a garbage collection protocol for D-ReServE that allows the periodic purging of the Stable Storage, and discuss the challenges of garbage collection due to the nature of SOA systems.
parallel And distributed Simulations (PADS) become more and more spread since scientists always want more accurate results in the shortest time. PADS are often sensitive to several parameters, and when they own a stoc...
详细信息
Our parallel FEM package NuscaS allows us to solve adaptive FEM problems with 3D unstructured meshes on distributed-memory parallel computers such as PC-clusters. For solving sparse systems of equations, NuscaS uses t...
详细信息
E-Learning aims at providing an alternative to classroom learning where learners learn through internet or CD/DVD without physical presence in the classrooms. In this paper, the state-of-theart e-Learning tools have b...
详细信息
ISBN:
(纸本)9781467313261
E-Learning aims at providing an alternative to classroom learning where learners learn through internet or CD/DVD without physical presence in the classrooms. In this paper, the state-of-theart e-Learning tools have been reviewed. It has been observed that the contemporary tools can be seen as course management system rather an alternative to classroom learning. When learners need further clarifications on the topic, learners need to visit external sources such as Search Engines, Citation Indexes, and Digital Libraries etc. However, withthe advent of Web 2.0, the social community is engaged to share large number of important and recent resources withthe scientific community. One of such system is known as: CiteULike which has more than 6 millions research resources and thousands of resources are shared on daily basis. Users of CiteULike annotate resources with useful keywords termed as Tags to give a structure to these resources. this paper further provides a framework for discovering most relevant resources from CiteULike for learners. the keywords of learning resource are matched with tags of CiteULike using Direct Match, Partial Match, and Synonym Match. the resources are further ranked based on number of weights. the ranked list of resources are made available in the local context of the learners in the eLearning system. the proposed framework has been demonstrated withthe example of a case study. It has been found that the ranked list of resources are very important for learners. the learners not only get a ranked list of relevant resources, instead the learners discover evolving concepts and resources related to the topic of study. the reoccurs give breadth and depth knowledge to learners for further explorations.
Explicit model-checking (MC) is a classical solution to find flaws in a security protocol. But it is well-known that for non trivial protocols, MC may enumerate state-spaces of astronomical sizes - the famous state-sp...
详细信息
ISBN:
(纸本)9781467357043
Explicit model-checking (MC) is a classical solution to find flaws in a security protocol. But it is well-known that for non trivial protocols, MC may enumerate state-spaces of astronomical sizes - the famous state-space explosion problem. distributed model checking is a solution but complex and subject to bugs: a MC can validate a model but miss an invalid state. In this paper, we focus on using a verification condition generator that takes annotated distributed algorithms and ensures their termination and correctness. We study five algorithms (one sequential and four distributed where three of them are dedicated and optimised for security protocol) of state-space construction as a first step towards mechanised verification of distributed model-checkers.
In this paper, we study the dependency between MapReduce configuration parameters and network load of fixed-size MapReduce jobs during the shuffle phase, then we propose an analytical method to model this dependency. ...
详细信息
ISBN:
(纸本)9781467357043
In this paper, we study the dependency between MapReduce configuration parameters and network load of fixed-size MapReduce jobs during the shuffle phase, then we propose an analytical method to model this dependency. Our approach consists of three key phases: profiling, modeling, and prediction. In the first stage, an application is run several times with different sets of MapReduce configuration parameters (here number of map tasks and number of reduce tasks) to profile the network load of an application in the shuffle phase on a given cluster. then, the relation between these parameters and the network load is modeled by multivariate linear regression. For evaluation, three applications (Word Count, Exim Main log parsing, and TeraSort) are utilized to evaluate our technique on a 5-node MapReduce private cluster.
Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many prob...
详细信息
ISBN:
(纸本)9781467357043
Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Bernstein-Vazirani problem more efficiently by a method with higher observation probability.
the snapshot problem addresses a collection of important algorithmic issues related to the distributed computations, which are used for debugging or recovering the distributed programs. Among the existing solutions, C...
详细信息
ISBN:
(纸本)9781467357043
the snapshot problem addresses a collection of important algorithmic issues related to the distributed computations, which are used for debugging or recovering the distributed programs. Among the existing solutions, Chandy and Lamport propose a simple distributed algorithm. In this paper, we explore the correct-by-construction process to formalize the snapshot algorithms in distributed system. the formalization process is based on a modeling language Event B, which supports a refinement-based incremental development using RODIN platform. these refinement-based techniques help to derive a correct distributed algorithm. Moreover, we demonstrate how this class of other distributed algorithms can be revisited. A consequence is to provide a fully mechanized proof of the distributed algorithms.
暂无评论