A number of techniques to improve the parsing performance of XML have been developed. Generally, however these techniques have limited impact on the construction of a DOM tree, which can be a significant bottleneck. M...
详细信息
ISBN:
(纸本)9780769528335
A number of techniques to improve the parsing performance of XML have been developed. Generally, however these techniques have limited impact on the construction of a DOM tree, which can be a significant bottleneck. Meanwhile, the trend in hardware technology is toward an increasing number of cores per CPU. As we have shown in previous work, these cores can be used to parse XML in parallel, resulting in significant speedups. In this paper we introduce a new static partitioning and load-balancing mechanism. By using a static, global approach, we reduce synchronization and load-balancing overhead, thus improving performance over dynamic schemes for a large class of XML documents. Our approach leverages libxml2 without modification, which reduces development effort and shows that our approach is applicable to real-world, production parsers. Our scheme works well with Sun's Niagara class of CMT architectures, and shows that multiple hardware threads can be effectively used for XML parsing.
Augmented marked graphs possess a special structure for modelling common resources as well as some desirable properties pertaining to liveness, boundedness, reversibility and conservativeness. this paper investigates ...
详细信息
ISBN:
(纸本)9783540768364
Augmented marked graphs possess a special structure for modelling common resources as well as some desirable properties pertaining to liveness, boundedness, reversibility and conservativeness. this paper investigates the property-preserving composition of augmented marked graphs for the synthesis of distributed systems. It is proposed that distributed system components are specified as augmented marked graphs. An integrated system is then obtained by composing these augmented marked graphs via their common resource places. Based on the preservation of properties, the liveness, boundedness, reversibility and conservativeness of the integrated system can be readily derived. this effectively solves the difficult problem of ensuring design correctness in the composition of distributed system components.
the increasing capabilities and spreading of mobile technology raise the opportunity to integrate potentially unstable mobile devices as resources into grids. In this work, we contribute by proposing and evaluating a ...
详细信息
ISBN:
(纸本)9780769528335
the increasing capabilities and spreading of mobile technology raise the opportunity to integrate potentially unstable mobile devices as resources into grids. In this work, we contribute by proposing and evaluating a robust decentralized job scheduling approach for mobile peers forming an ad-hoc grid. the scheduling approach is based on a first come first serve strategy executed locally by each peer. Additionally, the peer performs matchmaking between a job's requirements and the device's capabilities autonomously. Coordination between mobile peers is based on job queues shared within a distributed virtual shared memory (VSM). By applying proactive and reactive fault tolerance mechanisms we were able to increase the robustness of the scheduler. A prototypical implementation using the VSM CORSO, Java, and Condor ClassAds demonstrates the feasibility of our approach. the conducted experiments show that the job loss ratio and the average job response time can be decreased by adding fault tolerance mechanisms.
in the past years, hype over web services and their uses in emerging software applications has prompted the creation of many standards and proto-standards. the OGF has seen a number of standards making their way throu...
详细信息
ISBN:
(纸本)9780769528335
in the past years, hype over web services and their uses in emerging software applications has prompted the creation of many standards and proto-standards. the OGF has seen a number of standards making their way through design and edit pipelines. While this standards process progresses, it is important that implementations of these standards develop in parallel in order to validate the efforts of the standards authors while also providing feedback for further specification refinement. No specification exists in isolation but rather composes with others to form higher order products. these specifications will form the grid infrastructure of the future and an evaluation of this emerging work becomes increasingly relevant. Genesis H is a grid system implemented using these standards that serves both to provide the feedback described above as well as to function as a production level grid system for research at the University of Virginia.
this paper presents a novel programming model for explicitly separating parallelization and middleware-specific concerns in Bag-of-Tasks (BoT) grid applications. the model uses Java threads for application decompositi...
详细信息
ISBN:
(纸本)9780769528335
this paper presents a novel programming model for explicitly separating parallelization and middleware-specific concerns in Bag-of-Tasks (BoT) grid applications. the model uses Java threads for application decomposition, and aspect-oriented programming to dynamically (and transparently) convert the application's thread objects into independent grid tasks, using the services of a specific grid middleware API. this paper also describes early experimental results showing the model's modularity gains and performance overhead, when applied to implement BoT grid applications using OurGrid.
High performance computing is currently not affordable for those users that cannot rely on having a highly qualified computing support team. To cater for these users' needs we have proposed, implemented and deploy...
详细信息
ISBN:
(纸本)9780769528335
High performance computing is currently not affordable for those users that cannot rely on having a highly qualified computing support team. To cater for these users' needs we have proposed, implemented and deployed OurGrid. OurGrid is a peer-to-peer grid middleware that supports the automatic creation of large computational grids for the execution of embarrassingly parallel applications. It has been used to support the OurGrid Community - a public free-to-join grid that is in production since December 2004. In this paper we show how the OurGrid Community has been used to support the execution of a number of applications. Further we discuss the main benefits brought up by the system and the difficulties that have been faced by the system developers and the users and managers of the OurGrid Community.
Effective scheduling is critical for the performance of an application launched onto the Grid environment. Finding effective scheduling algorithms for this problem is a challenging research area. Many scheduling algor...
详细信息
ISBN:
(纸本)9780769528335
Effective scheduling is critical for the performance of an application launched onto the Grid environment. Finding effective scheduling algorithms for this problem is a challenging research area. Many scheduling algorithms have been proposed, studied and compared on heterogeneous parallel computers but there are few studies comparing the performance of scheduling algorithms in Grid environments. the Grid is unique because of the drastic cost differences between inter-cluster and the intra-cluster data transfers. In this paper, we compare several scheduling algorithms that represent two classes of schedulers used for Grid computing. We analyze the results to explain how different resource environments and workflow application structures affect the performance of these algorithms. Based on our experiments, we introduce a new measurement called effective aggregated computing power (EACP) that could drastically improve the performance of some schedulers.
Scalability and routing efficiency are two crucial aspects of resource discovery in grid environments. SDRD, a novel approach to resource discovery in grid environments, is proposed in this paper. Basic model of resou...
详细信息
ISBN:
(纸本)9783540768364
Scalability and routing efficiency are two crucial aspects of resource discovery in grid environments. SDRD, a novel approach to resource discovery in grid environments, is proposed in this paper. Basic model of resource discovery is proposed. Based on the basic model, formal description of SDRD is given. Sophisticated routing strategies are implemented in SDRD to improve the scalabilities and routing efficiencies of existing peer-to-peer based discovery approaches to grid resource. Improved distributed Hash Tables (DHTs) are adopted within virtual organizations (VOs) to achieve better local routing efficiency. SuperNodes are only in charge of forwarding requests to other SuperNodes in different VOs when the desired resources are not present in local VO, which enhances the scalability due to the lower load on SuperNodes. SDRD could be applied to other resource management models to offer excellent scalability and high routing efficiency. Results of analysis and simulations show that SDRD scales well and could offer an efficient decentralized discovery service in grid.
It is well known that the Lanczos process suffers from loss of orthogonality in the case of finite-precision arithmetic. Several approaches have been proposed in order to address this issue, thus enabling the successf...
详细信息
ISBN:
(纸本)9783540713500
It is well known that the Lanczos process suffers from loss of orthogonality in the case of finite-precision arithmetic. Several approaches have been proposed in order to address this issue, thus enabling the successful computation of approximate eigensolutions. However, these techniques have been studied mainly in the context of long Lanczos runs, but not for restarted Lanczos eigensolvers. Several variants of the explicitly restarted Lanczos algorithm employing different reorthogonalization strategies have been implemented in SLEPc, the Scalable Library for Eigenvalue Computations. the aim of this work is to assess the numerical robustness of the proposed implementations as well as to study the impact of reorthogonalization in parallel efficiency.
Mobile networking, mobile systems and applications and ubiquitous computing infrastructures are of strongly growing importance in the IT sector in general, and for the parallel and distributedcomputing community. Par...
详细信息
ISBN:
(纸本)9783540747666
Mobile networking, mobile systems and applications and ubiquitous computing infrastructures are of strongly growing importance in the IT sector in general, and for the parallel and distributedcomputing community. Particularly, when an signed (authenticated), information of multi-node is aggregated in ubiquitous sensor networks, the number of the signing information is very small. thus, signature scheme which signs information has strong unforgeability. In 2005 Yu and Chen proposed threshold signature scheme [12]. their scheme has a high efficiency. But, their scheme is not suitable for ubiquitous sensor networks because their scheme has no strong unforgeability. In this paper, we modify their scheme so that modified scheme is suitable for ubiquitous sensor networks. Also, our scheme has a good efficiency, and a smaller secret key than other cryptosystems with a similar security level.
暂无评论