检索结果-内蒙古大学图书馆

A Novel Scheduling Framework for multi-programming Quantum Computing in Cloud Environment

Computers, Materials & Continua 2024年第5期79卷 1957-1974页

作者： Danyang Zheng Jinchen Xv Feng Yue Qiming Du ZhihengWang Zheng Shan Information Engineering University Zhengzhou450001China

As cloud quantum computing gains broader acceptance,a growing quantity of researchers are directing their focus towards this ***,the rapid surge in demand for cloud-based quantum computing resources has led to a scarcity,which in turn hampers users from achieving optimal ***,cloud quantum computing service providers require a unified analysis and scheduling framework for their quantumresources and user jobs to meet the ever-growing usage *** paper introduces a new multi-programming scheduling framework for quantum computing in a cloud *** framework addresses the issue of limited quantum computing resources in cloud environments and ensures a satisfactory user *** introduces three innovative designs:1)Our framework automatically allocates tasks to different quantum backends while ensuring fairness among users by considering both the cloud-based quantum resources and the user-submitted tasks.2)multi-programming mechanism is employed across different quantum backends to enhance the overall throughput of the quantum *** comparison to conventional task schedulers,our proposed framework achieves a throughput improvement of more than two-fold in the quantum cloud.3)The framework can balance fidelity and user waiting time by adaptively adjusting scheduling parameters.

关键词： Quantum computing scheduling multi-programming qubit mapping

来源：评论

学校读者我要写书评

暂无评论

Quantum multi-programming for Grover's search

引用

QUANTUM INFORMATION PROCESSING 2023年第1期22卷 1-23页

作者： Park, Gilchan Zhang, Kun Yu, Kwangmin Korepin, Vladimir Brookhaven Natl Lab Computat Sci Initiat Upton NY 11973 USA SUNY Stony Brook Dept Chem Stony Brook NY 11794 USA SUNY Stony Brook CN Yang Inst Theoret Phys Stony Brook NY 11794 USA

Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP) algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We proved that this new algorithm increases the rotation angle of the Grover operator which, as a result, increases the success probability. The new algorithm is implemented on IBM quantum computers and compared with the canonical Grover's algorithm and other variations of Grover's algorithms. The empirical tests validate that our new algorithm outperforms other variations of Grover's algorithms as well as the canonical Grover's algorithm.

关键词： Quantum computing NISQ algorithm multi-programming Grover's search

来源：评论

学校读者我要写书评

暂无评论

QuCloud+: A Holistic Qubit Mapping Scheme for Single/multi-programming on 2D/3D NISQ Quantum Computers

引用

ACM Transactions on Architecture and Code Optimization 2024年第1期21卷 1-27页

作者： Lei Liu Xinglei Dou Beihang University China

Qubit mapping for NISQ superconducting quantum computers is essential to fidelity and resource utilization. The existing qubit mapping schemes meet challenges, e.g., crosstalk, SWAP overheads, diverse device topologies, etc., leading to qubit resource underutilization and low fidelity in computing results. This article introduces QuCloud+, a new qubit mapping scheme that tackles these challenges. QuCloud+ has several new designs. (1) QuCloud+ supports single/multi-programming quantum computing on quantum chips with 2D/3D topology. (2) QuCloud+ partitions physical qubits for concurrent quantum programs with the crosstalk-aware community detection technique and further allocates qubits according to qubit degree, improving fidelity, and resource utilization. (3) QuCloud+ includes an X-SWAP mechanism that avoids SWAPs with high crosstalk errors and enables inter-program SWAPs to reduce the SWAP overheads. (4) QuCloud+ schedules concurrent quantum programs to be mapped and executed based on estimated fidelity for the best practice. Experimental results show that, compared with the existing typical multi-programming study [12], QuCloud+ achieves up to 9.03% higher fidelity and saves on the required SWAPs during mapping, reducing the number of CNOT gates inserted by 40.92%. Compared with a recent study [30] that enables post-mapping gate optimizations to further reduce gates, QuCloud+ reduces the post-mapping circuit depth by 21.91% while using a similar number of gates.

关键词： Quantum computing multi-programming qubit mapping fidelity Quantum OS

来源：评论

学校读者我要写书评

暂无评论

A New Qubits Mapping Mechanism for multi-programming Quantum Computing 20

A New Qubits Mapping Mechanism for Multi-programming Quantum...

引用

ACM International Conference on Parallel Architectures and Compilation Techniques (PACT)

作者： Dou, Xinglei Liu, Lei Chinese Acad Sci Sys Inventor Lab ICT SKLCA Beijing Peoples R China

ISBN: (纸本)9781450380751

For a specific quantum chip, multi-programming helps to improve the overall throughput and resource utilization. However, previous solutions for mapping multiple programs often lead to resource under-utilization, high error rate, and low fidelity. In this paper, we propose a new approach to map concurrent quantum programs. Our approach has three critical components. The first one is the Community Detection Assisted Partition (CDAP) algorithm, which partitions physical qubits for concurrent quantum programs by considering physical typology and the error rate, avoiding the waste of robust resources. The second one is the X-SWAP scheme that enables inter-program SWAPs and prioritizes SWAPs associated with critical gates to reduce the SWAP overheads. Finally, we propose a compilation task scheduler, which dynamically selects concurrent quantum programs to be compiled and executed together based on estimated fidelity for the best practice. We evaluate our work on publicly available quantum computer IBMQ16 and a simulated quantum chip IBMQ50. Our work outperforms the state-of-the-art work for multi-programming on fidelity and compilation overheads by 12.0% and 11.6%, respectively.

关键词： multi-programming scheduling quantum computing

来源：评论

学校读者我要写书评

暂无评论

A Case for multi-programming Quantum Computers 52

A Case for Multi-Programming Quantum Computers

引用

52nd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Das, Poulami Tannu, Swamit S. Nair, Prashant J. Qureshi, Moinuddin Georgia Tech Atlanta GA 30332 USA Univ British Columbia Vancouver BC Canada

ISBN: (纸本)9781450369381

Existing and near-term quantum computers face significant reliability challenges because of high error rates caused by noise. Such machines are operated in the Noisy Intermediate Scale Quantum (NISQ) model of computing. As NISQ machines exhibit high error-rates, only programs that require a few qubits can be executed reliably. Therefore, NISQ machines tend to underutilize its resources. In this paper, we propose to improve the throughput and utilization of NISQ machines by using multi-programming and enabling the NISQ machine to concurrently execute multiple workloads. multi-programming a NISQ machine is non-trivial. This is because, a multi-programmed NISQ machine can have an adverse impact on the reliability of the individual workloads. To enable multi-programming in a robust manner, we propose three solutions. First, we develop methods to partition the qubits into multiple reliable regions using error information from machine calibration so that each program can have a fair allocation of reliable qubits. Second, we observe that when two programs are of unequal lengths, measurement operations can impact the reliability of the co-running program. To reduce this interference, we propose a Delayed Instruction Scheduling (DIS) policy that delays the start of the shorter program so that all the measurement operations can be performed at the end. Third, we develop an Adaptive multi-programming (AMP) design that monitors the reliability at runtime and reverts to single program mode if the reliability impact of multi-programming is greater than a predefined threshold. Our evaluations with IBM-Q16 show that our proposals can improve resource utilization and throughput by up to 2x, while limiting the impact on reliability.

关键词： Quantum Computer multi-programming Reliability NISQ

来源：评论

学校读者我要写书评

暂无评论

Turning Pololu 3Pi into a multi-programming platform 15

Turning Pololu 3Pi into a multi-programming platform

引用

15th Latin American Robotic Symposium (LARS) / 6th Brazilian Symposium on Robotics (SBR) / 9th Workshop on Robotics in Education (WRE)

作者： Jose Roberto Fonseca, S., Jr. de Lima, Pedro Vitor S. G. Bezerra, Maria Helena R. A. Teixeira, Joao Marcelo X. N. Cerquinho Cajueiro, Joao Paulo Univ Fed Pernambuco Maracatron Recife PE Brazil Univ Fed Pernambuco Dept Elect & Syst Recife PE Brazil

ISBN: (纸本)9781538677612

Line-following robots have the ability to recognize and follow a line drawn on a surface. It works based on a simple self-sustainable system composed with a set of sensors, motors and a controller. In order to get optimal performance in such robots, it's necessary to carry out several tests to evaluate the behavior in each trial. In the majority of cases, a new trial requires to upload a new program, thus slowing down the development of the line-following. This paper presents an approach to solve the inconvenience of having to upload a new program in each trial. It consists in merging multiple codes in to one to create a program that gives the user the ability to switch between them anytime inside Pololu's 3pi line follower platform.

关键词： multi-programming line-following robot autonomous robot

来源：评论

学校读者我要写书评

暂无评论

A Performance Evaluation of multi-programming Model on a multicore System with Virtual Machines 8

A Performance Evaluation of Multi-Programming Model on a Mul...

引用

8th IEEE International Symposium on Embedded multicore/Manycore Systems-on-Chip (MCSoC)

作者： Ueno, Hitoshi Cc Ures Off Atsugi Kanagawa Japan

ISBN: (纸本)9781479943050

For a lot of equipment like industrial equipment, automotive or consumer electrical appliances, embedded computers are widely used. Many computers are embedded in the equipment because it has excellent features and their controls are more complex. Recently, general purpose microcomputer has been made to have multicore CPUs to achieve high performance. multicore CPU is also expected to be used widely because of embedded computers, but it is not clear how to use the computer. Virtual machine technology is proposed and used as the solution to the problem, as it makes possible the integration of some control computers into a high-performance embedded computer. However, it is not simple for engineers to design the performance of the system because the characteristics of virtual machines are different compared with real machines. In this article, the performance characteristics of multicore embedded computers with virtual machines are analyzed, with an assumption that the control programs are developed by multi-programming model using process or thread of Linux OS. For the evaluations, a benchmark program is designed. The results show a performance difference of 5%-10% between process cases and thread cases, regardless whether real machine or virtual machine is used. In performance comparison of real machine and virtual machine, 13%-88% performance differences are realized, which depend on the number of CPU cores. Furthermore, some unprecedented phenomena in performance are found in cases where the number of CPU cores exceeds the number of parallel executions of process/thread. The measured results are useful and can serve as a guide in designing system performance for multicore embedded computers.

关键词： virtual machine multicore multi-programming process thread Linux performance evaluation supervisor mode

来源：评论

学校读者我要写书评

暂无评论

Improving GPU multi-tenancy with Page Walk Stealing 27

Improving GPU Multi-tenancy with Page Walk Stealing

引用

27th IEEE International Symposium on High-Performance Computer Architecture (HPCA)

作者： Pratheek, B. Jawalkar, Neha Basu, Arkaprava Indian Inst Sci Dept Comp Sci Automat Bengaluru Karnataka India

ISBN: (纸本)9781665422352

GPU (Graphics Processing Unit) architecture has evolved to accelerate parts of a single application at a time. Consequently, several aspects of its architecture, particularly the virtual memory, have embraced a shared-mostly design. This implicitly assumes that a single application and, thus, one address space is resident in the GPU at a time. However, recent trends, e.g., deployment of GPUs in the cloud, necessitate efficient multi-tenancy. multi-tenancy is needed for sharing the physical resources of a large server-class GPU across multiple concurrent tenants (applications) for resource consolidation while ensuring fairness among the tenants. We first quantify how different components of GPU's virtual memory can impede multi-tenancy. We show that shared page walkers are a key bottleneck under multi-tenancy. We, therefore, propose dynamic page walk stealing that enables soft partitioning of the shared pool of walkers - reducing destructive interference between the tenants while also aggregating resources where possible. Over today's design, we improve throughput by 37%, and weighted IPC by 15%, on average, over 45 workloads.

关键词： graphics processing units virtual memory address translation page table walkers multi-programming

来源：评论

学校读者我要写书评

暂无评论

Global Cost/Quality Management across multiple Applications 2020

Global Cost/Quality Management across Multiple Applications

引用

28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE)

作者： Liu, Liu Isaacman, Sibren Kremer, Ulrich Rutgers State Univ New Brunswick NJ 08903 USA Loyola Univ Maryland Baltimore MD USA

ISBN: (纸本)9781450370431

Approximation is a technique that optimizes the balance between application outcome quality and its resource usage. Trading quality for performance has been investigated for single application scenarios, but not for environments where multiple approximate applications may run concurrently on the same machine, interfering with each other by sharing machine resources. Applying existing, single application techniques to this multi-programming environment may lead to configuration space size explosion, or result in poor overall application quality outcomes. Our new RAPID-M system is the first cross-application configuration management framework. It reduces the problem size by clustering configurations of individual applications into local "similarity buckets". The global cross-applications configuration selection is based on these local bucket spaces. RAPID-M dynamically assigns buckets to applications such that overall quality is maximized while respecting individual application cost budgets. Once assigned a bucket, reconfigurations within buckets may be performed locally with minimal impact on global selections. Experimental results using six configurable applications show that even large configuration spaces of complex applications can be clustered into a small number of buckets, resulting in search space size reductions of up to 9 orders of magnitude for our six applications. RAPID-M constructs performance cost models with an average prediction error of <= 3%. For our application execution traces, RAPID-M dynamically selects configurations that lower the budget violation rate by 33.9% with an average budget exceeding rate of 6.6% as compared to other possible approaches. RAPID-M successfully finishes 22.75% more executions which translates to a 1.52x global output quality increase under high system loads. The overhead of RAPID-M is within <= 1% of application execution times.

关键词： Approximate Computing Global Configuration Management Performance Prediction multi-programming

来源：评论

学校读者我要写书评

暂无评论

Write Variation aware Cache Partitioning for improved lifetime in Non-Volatile Caches 32

Write Variation aware Cache Partitioning for improved lifeti...

引用

32nd International Conference on VLSI Design (VLSID) / 18th International Conference on Embedded Systems (ES)

作者： Nath, Arijit Kapoor, Hemangee K. IIT Guwahati Dept Comp Sci & Engn Gauhati 781039 Assam India

ISBN: (纸本)9781728104096

With the reduction in transistor size, the transistor density within chips has increased in a dramatic fashion. It results in the introduction of more and more number cores within a Chip multiprocessor allowing more than one applications to run concurrently. Therefore, applications put more pressure on the memory subsystem, particularly on the shared last level caches. Cache partitioning is a well-known technique to mitigate this issue where the shared last level cache is partitioned among the running processes based on their access demands. At the same time, people are trying to find new alternatives to traditional SRAM based cache memories because of their inherent limitations like low density and high leakage power. Non-volatile memories show great potential for being replacement choices for SRAM. However, NVMs have limitations like weak endurance, high write energy etc. Therefore, Cache partitioning in NVM based shared caches turns out to be more challenging. If not done judiciously, such partitioning may cause severe shortening of the lifetime of NVM caches. In this paper, we propose a hardware-based cache partitioning technique to intelligently partition the shared last level cache among concurrently running applications. In this technique, we do periodic re-partitioning of the shared cache by assigning heavily written cache ways to less written partitions so that writes are evenly distributed across the ways within the cache sets. Experimental evaluation shows a significant reduction in intraset write variation and improvement in lifetime.

关键词： Dynamic Cache Partitioning Non-Volatile Memories STT-RAM multi-core multi-programming Shared caches Last Level Cache (LLC)

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：