With the rapid development of Internet technology, online applications have become an indispensable part of government, enterprise and engineering fields. Most enterprises have utilized the advantages of cloud computi...
详细信息
ISBN:
(纸本)9781538637906
With the rapid development of Internet technology, online applications have become an indispensable part of government, enterprise and engineering fields. Most enterprises have utilized the advantages of cloud computing and refactored the applications with the service-oriented architecture (SOA) in order to solve the huge number of online users, soaring data and fluctuant load. According to the cloud services quality which evaluated in different cloud computing resources, developer choose the suitable size of the service cluster to meet the needs of enterprise services in the distributed service cluster. It can not only ensure the stable operation of online applications, but also maximize the reduction of basic costs. Therefore, it is important to evaluate the quality of cloud services accurately. This paper proposes an evaluation method of cloud service quality based on queuing model. The M/M/1 and M/M/s queuing models are used to analyze and evaluate the quality of single node service and cluster service respectively. By the method proposed in this paper can not only choose the suitable size of the service cluster for online applications, but also perform dynamic scheduling of cloud resources. Finally, the feasibility and practicability of this method is verified by experiments.
In JointCloud, when multiple entities conduct data collaboration, role-based access control (RBAC) can offer flexible and secure access control policies to ensure security, privacy of data, which is widely utilized in...
详细信息
ISBN:
(纸本)9781665435741
In JointCloud, when multiple entities conduct data collaboration, role-based access control (RBAC) can offer flexible and secure access control policies to ensure security, privacy of data, which is widely utilized in data access of organizations. However, existing RBAC is confronted with problems such as lacking in dynamic role assignment, explosion of role number and uncertainty and unreliability of users' identities, which affect the performance of access control. In this paper, we propose a model to formulate fine-grained access control policy for data and implement dynamic and automatic assignment of roles in hierarchical tree structure based on multi-dimensional attributes. This model adopts decentralized identifier and verifiable credential to describe entities' identity, and leverages blockchain and smart contract to conduct access control policies. This model makes up for the deficiencies of existing RBAC and strengthens the dynamicity of access control policies. Experimental results shows that the model can assign roles to users in a dynamic and automatic way, which verifies the feasibility of the model.
Faced with slowing performance and energy benefits of technology scaling, VLSI/Computer architectures have turned from parallel to massively parallel machines for personal and embedded applications in the form of mult...
详细信息
ISBN:
(纸本)9780769546766
Faced with slowing performance and energy benefits of technology scaling, VLSI/Computer architectures have turned from parallel to massively parallel machines for personal and embedded applications in the form of multi and many core architectures. Additionally, in the pursuit of finding the sweet spot between engineering and computational efficiency, massively parallel Coarse Grain Reconfigurable Architectures(CRGAs) have been researched. While these articles have been surveyed, they have not been rigorously classified to enable objective differentiation and comparison for performance, area and flexibility. In this paper, we extend the well known Skillicorn taxonomy to create new classes, present a scoring system to rate these classes on flexibility, and present equations for early estimation of area and configuration overheads. Furthermore, we use this extended classification scheme to classify and compare 25 different massively parallel architectures that covers most of the reported CGRAs and other well known multi and many core architectures.
On-demand hardware resources provisioning is an efficient way to save energy in traditional data centers. However, when workloads burst and exceed the capacity of provided resources, the capacity will temporary defici...
详细信息
ISBN:
(纸本)9781538637906
On-demand hardware resources provisioning is an efficient way to save energy in traditional data centers. However, when workloads burst and exceed the capacity of provided resources, the capacity will temporary deficit. That's because a specific time is needed to increase the quantity of resources. Thus, performance degradation is incurred. To alleviate this problem, this paper proposes a peak load regulation method to promote the QoS of workloads for traditional energy-efficient DCs. In this method, overloaded workloads (peak loads) are regulated to improve the response time of critical requests and increase the number of QoS-guaranteed requests. Experimental results show that, with this method the energy consumption of the data center can be reduced by about 25% compared with the baseline. What's more, this method can significantly promote the QoS of workloads.
This paper outlines a scalable architecture that supports datacenter-wide resource management for elastic Internet applications in a mega data center. Our architecture includes a scalable load-balancing fabric and pro...
详细信息
ISBN:
(纸本)9781479941162
This paper outlines a scalable architecture that supports datacenter-wide resource management for elastic Internet applications in a mega data center. Our architecture includes a scalable load-balancing fabric and provides effective knobs to balance load among the applications, servers, access links, as well as the load-balancing components themselves - the low-level resource managers and switches in the load-balancing fabric.
The subgraph enumeration problem asks us to find all subgraphs of a target graph that are isomorphic to a given pattern graph. Determining whether even one such isomorphic subgraph exists is NP-complete-and therefore ...
详细信息
ISBN:
(纸本)9780769561493
The subgraph enumeration problem asks us to find all subgraphs of a target graph that are isomorphic to a given pattern graph. Determining whether even one such isomorphic subgraph exists is NP-complete-and therefore finding all such subgraphs (if they exist) is a time-consuming task. Subgraph enumeration has applications in many fields, including biochemistry and social networks, and interestingly the fastest algorithms for solving the problem for biochemical inputs are sequential. Since they depend on depth-first tree traversal, an efficient parallelization is far from trivial. Nevertheless, since important applications produce data sets with increasing difficulty, parallelism seems beneficial. We thus present here a shared-memory parallelization of the state-of-the-art subgraph enumeration algorithms RI and RIDS (a variant of RI for dense graphs) by Bonnici et al. [BMC Bioinformatics, 2013]. Our strategy uses work stealing and our implementation demonstrates a significant speedup on real-world biochemical data-despite a highly irregular data access pattern. We also improve RI-DS by pruning the search space better;this further improves the empirical running times compared to the already highly tuned RI-DS.
Graph partitioning has been an important tool to partition the work among several processors to minimize the communication cost and balance the workload. While accelerator-based supercomputers are emerging to be the s...
详细信息
ISBN:
(纸本)9781728174457
Graph partitioning has been an important tool to partition the work among several processors to minimize the communication cost and balance the workload. While accelerator-based supercomputers are emerging to be the standard, the use of graph partitioning becomes even more important as applications are rapidly moving to these architectures. However, there is no scalable, distributed-memory, multi-GPU graph partitioner available for applications. We developed a spectral graph partitioner, Sphynx, using the portable, accelerator-friendly stack of the Trilinos framework. We use Sphnyx to systematically evaluate the various algorithmic choices in spectral partitioning with a focus on GPU performance. We perform those evaluations on irregular graphs, because state-of-the-art partitioners have the most difficulty on them. We demonstrate that Sphynx is up to 17x faster on GPUs compared to the case on CPUs, and up to 580x faster compared to a state-of-the-art multilevel partitioner. Sphynx provides a robust alternative for applications looking for a GPU-based partitioner.
Many parallel scientific applications spend a significant amount of time reading and writing data files. Collective I/O operations allow to optimize the file access of a process group by redistributing data across pro...
详细信息
ISBN:
(纸本)9781728174457
Many parallel scientific applications spend a significant amount of time reading and writing data files. Collective I/O operations allow to optimize the file access of a process group by redistributing data across processes to match the data layout on the file system. In most parallel I/O libraries, the implementation of collective I/O operations is based on the two-phase I/O algorithm, which consists of a communication phase and a file access phase. This papers evaluates various design options for overlapping two internal cycles of the two-phase I/O algorithm, and explores using different data transfer primitives for the shuffle phase, including non-blocking two-sided communication and multiple versions of one-sided communication. The results indicate that overlap algorithms incorporating asynchronous I/O outperform overlapping approaches that only rely on non-blocking communication. However, in the vast majority of the testcases one-sided communication did not lead to performance improvements over two-sided communication.
We discuss early results with Toucan, a sourceto- source translator that automatically restructures C/C++ MPI applications to overlap communication with computation. We co-designed the translator and runtime system to...
详细信息
ISBN:
(纸本)9781538639146
We discuss early results with Toucan, a sourceto- source translator that automatically restructures C/C++ MPI applications to overlap communication with computation. We co-designed the translator and runtime system to enable dynamic, dependence-driven execution of MPI applications, and require only a modest amount of programmer annotation. Co-design was essential to realizing overlap through dynamic code block reordering and avoiding the limitations of static code relocation and inlining. We demonstrate that Toucan hides significant communication in four representative applications running on up to 24K cores of NERSC's Edison platform. Using Toucan, we have hidden from 33% to 85% of the communication overhead, with performance meeting or exceeding that of painstakingly hand-written overlap variants.
This paper presents a new scheduling and resource management allocation system based on an economic model related to different classes for SLAs (Service Level Agreements). The goal is to address the problems of compan...
详细信息
ISBN:
(纸本)9781538637906
This paper presents a new scheduling and resource management allocation system based on an economic model related to different classes for SLAs (Service Level Agreements). The goal is to address the problems of companies that manage a private infrastructure of machines, and would like to optimize the scheduling of several requests submitted online by users. Each request is an application which is executed using a set of computing resources. Our economic model has two SLAs classes (a qualitative one and a quantitative one). The qualitative class represents the satisfaction time criteria, i.e. the user waiting time before the execution of its requests. Moreover, the quantitative class represents the number of resources that must be allocated to execute the user request. As a first contribution, our system allocates dynamically, for each selected request, a set of computing cores according to the quantitative SLA class and the load of the parallel machines across the infrastructure. To choose the machine that will execute a selected request, we propose to use a Bin Packing heuristic to minimize the number of used machines and reduce the cost of the infrastructure. As a second contribution, simulations of our system are conducted on Prezi and Google Cloud Data traces and they demonstrate the potential of our approach under different scenario.
暂无评论