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

Multiprogrammed non-blocking checkpoints in support of optimistic simulation on myrinet clusters

JOURNAL OF SYSTEMS ARCHITECTURE 2007年第9期53卷 659-676页

作者： Santoro, Andrea Quaglia, Francesco Univ Roma La Sapienza Dipartimento Informat & Sistemist Sch Engn I-00198 Rome Italy

CCL (checkpointing and communication library) is a software layer in support of optimistic parallel discrete event simulation (PDES) on myrinet-based COTS clusters. Beyond classical low latency message delivery functionalities, this library implements CPU offloaded, non-blocking (asynchronous) checkpointing functionalities based on data transfer capabilities provided by a programmable DMA engine on board of myrinet network cards. These functionalities are unique since optimistic simulation systems conventionally rely on checkpointing implemented as a synchronous, CPU-based data copy. Releases of CCL up to v2.4 only support monoprogrammed non-blocking checkpoints. This forces re-synchronization between CPU and DMA activities, which is a potential source of overhead, each time a new checkpoint request must be issued at the simulation application level while the last issued one is still being carried out by the DMA engine. In this paper we present a redesigned release of CCL (v3.0) that, exploiting hardware capabilities of more advanced myrinet clusters, supports multiprogrammed non-blocking checkpoints. The multiprogrammed approach allows higher degree of con-currency between checkpointing and other simulation specific operations carried out by the CPU, with benefits on performance. We also report the results of the experimental evaluation of those benefits for the case of a Personal Communication System (PCS) simulation application, selected as a real world test-bed. (c) 2007 Elsevier B.V. All rights reserved.

关键词： optimistic simulation rollback-based synchronization checkpointing DMA myrinet performance optimization multiprogramming

来源：评论

学校读者我要写书评

暂无评论

On the alignment problem

引用

Parallel processing letters 1994年第3期4卷 259-270页

作者： Darte, Alain Robert, Yves Ecole Normale Superieure de Lyon LYON France

This paper deals with the problem of aligning data and computations when mapping uniform or affine loop nests onto SPMD distributed memory parallel computers. For affine loop nests we formulate the problem by introducing the communication graph, which can be viewed as the counterpart for the mapping problem of the dependence graph for scheduling. We illustrate the approach with several examples to show the difficulty of the problem. In the simplest case, that of perfect loop nests with uniform dependences, we show that minimizing the number of commmunications is NP-complete, although we are able to derive a good alignment heuristic in most practical cases.

关键词： multiprogramming

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL SCHEDULING OF HOMOGENEOUS JOB SYSTEMS

引用

INFORMATION SCIENCES 1975年第4期9卷 323-358页

作者： ELLIS, CA MIT PROJECT MACCAMBRIDGEMA 02139 MIT DEPT ELECT ENGN & COMP SCICAMBRIDGEMA 02139

Homogeneous job systems are systems in which all of a finite set of jobs to be processed by the system have exactly the same processing requirements. This paper assumes that each job first executes an input task requiring an input unit (channel or controller) for some amount of time Tc along with a memory unit. Then it executes a computational task requiring a processing unit and the memory for some amount of time Tp. Under these assumptions, it is possible to derive some inequalities concerning the relative number of memory, input, and processor units which can be efficiently used by the system as a function of Tc and Tp. The scheduling problem is to order tasks and assign resources to them in such a way as to minimize some cost function. The cost functions considered in this paper are job set finishing time and dwell time. Some theorems are stated and proved which yield closed form expressions for the minimum finishing time in batch and in time-shared systems as a function of the number of jobs, memories, processors, input units, and Tc and Tp. The purpose of this study is to derive some general results which aid in the efficient utilization of multiprocessor computer systems. Although this study is directed toward a specific type of homogeneous system, it is shown that the results are applicable to other systems (e.g., systems with output).

关键词： Multiprocessors scheduling batch processing timesharing multiprogramming I/O bound systems compute bound systems job shop problem flow shop problem

来源：评论

学校读者我要写书评

暂无评论

Enabling Efficient Real-Time Calibration on Cloud Quantum Machines

IEEE TRANSACTIONS ON QUANTUM ENGINEERING

引用

IEEE TRANSACTIONS ON QUANTUM ENGINEERING 2023年第1期4卷 1页

作者： Liu, Yiding Li, Zedong Robertson, Alan Fu, Xin Song, Shuaiwen Leon Univ Houston Dept Elect & Comp Engn Houston TX 77204 USA Yangtze Delta Ind Innovat Ctr Quantum Sci & Techn Suzhou 215100 Peoples R China Univ Sydney Sch Comp Sci Camperdown NSW 2006 Australia

Noisy intermediate-scale quantum computers are widely used for quantum computing (QC) from quantum cloud providers. Among them, superconducting quantum computers, with their high scalability and mature processing technology based on traditional silicon-based chips, have become the preferred solution for most commercial companies and research institutions to develop QC. However, superconducting quantum computers suffer from fluctuation due to noisy environments. To maintain reliability for every execution, calibration of the quantum processor is significantly important. During the long procedure to calibrate physical quantum bits (qubits), quantum processors must be turned into offline mode. In this work, we propose a real-time calibration framework (RCF) to execute quantum program tasks and calibrate in-demand qubits simultaneously, without interrupting quantum processors. Across a widely used noisy intermediate-scale quantum (NISQ) evaluation benchmark suite such as QASMBench, RCF achieves up to 18% reliability improvement for applications. For reliability on different physical qubits, RCF achieves an average gain of 15.7% (up to 36.7%). For cloud quantum machines, the throughput can be improved up to 9.5 throughput per minute (6.5 on average) based on baseline calibration time. In conclusion, RCF offers a reliable solution for large-scale, long-serving quantum machines.

关键词： Compiler multiprogramming noisy intermediate-scale quantum (NISQ) quantum computing (QC) Compiler multiprogramming noisy intermediate-scale quantum (NISQ) quantum computing (QC)

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTATION OF A COMPUTER JOB SCHEDULING ALGORITHM - CASE HISTORY

引用

SOFTWARE-PRACTICE & EXPERIENCE 1978年第5期8卷 529-542页

作者： GUJAR, UG FELLOWS, DM Computing Centre and School of Computer Science University of New Brunswick P.O. Box 4400 Fredericton N.B. E3B 5A3 Canada

multiprogramming systems require that a fair, equitable algorithm be used for the scheduling of jobs. This paper discusses some of the problems associated with this and proposes an automatic job scheduling algorithm. The major parts of the algorithm have been implemented and have been in use for over one year. The user interface is simplified and the operational complexities are minimized. The parameters used for the algorithm are the estimates of the central processor time and the memory required by the job. All types of jobs including those requiring operator attention during execution are covered under the scheme. Operational data and the reactions from the users indicate that the results have been as expected.

关键词： Automatic job scheduling multiprogramming HASP VS2 Resource management Execution delays

来源：评论

学校读者我要写书评

暂无评论

Efficient Exact Response Time Analysis for Fixed Priority Scheduling in Lowest Priority First-Based Feasibility Tests

引用

IEEE EMBEDDED SYSTEMS LETTERS 2021年第3期13卷 69-72页

作者： Kim, Saehwa Hankuk Univ Foreign Studies Dept Informat & Commun Engn Yongin 17035 South Korea

The exact response time analysis for fixed priority scheduling (FPS) in the lowest priority first-based feasibility tests is commonly required as a part of system design tools. This letter proposes an efficient method for this, which we named incremental lower bound (ILB) calculation method. Compared to the best algorithm that has been known so far, which is the incremental calculation method, ILB reduces the feasibility test iterations/run times by more than 38% and 20% regardless of varying utilization and the number of tasks in task sets.

关键词： Task analysis Time factors Job shop scheduling Standards Dynamic scheduling Mathematical model Multiprocessing multiprogramming multitasking real-time and embedded systems scheduling worst-case response time (WCRT) analysis

来源：评论

学校读者我要写书评

暂无评论

DISTRIBUTED HIERARCHICAL CONTROL FOR PARALLEL PROCESSING

引用

COMPUTER 1990年第5期23卷 65-77页

作者： FEITELSON, DG RUDOLPH, L Hebrew Univ. of Jerusalem

A description is given of a novel design, using a hierarchy of controllers, that effectively controls a multiuser, multiprogrammed parallel system. Such a structure allows dynamic repartitioning according to changing job requirements. The design goals are examined, and the principles of distributed hierarchical control are presented. Control over processors is discussed. Mapping and load balancing with distributed hierarchical control are considered. Support for gang scheduling as well as availability and fault tolerance is addressed. The use of distributed hierarchical control in memory management and I/O is discussed

关键词： I/O availability changing job requirements distributed hierarchical control dynamic repartitioning fault tolerance gang scheduling load balancing mapping memory management multiprogrammed parallel system multiprogramming multiuser parallel system parallel processing processor control

来源：评论

学校读者我要写书评

暂无评论

Using asymmetric single-ISA CMPs to save energy on operating systems

引用

IEEE MICRO 2008年第3期28卷 26-41页

作者： Mogul, Jeffrey C. Mudigonda, Jayararn Binkert, Nathan Ranganathan, Parthasarathy Talwar, Vanish 1501 Page Mill Rd MS 1177 Palo Alto CA 94304 USA

CPUs consume too much power. modern complex cores sometimes waste power on functions that are not useful for the code they run. In particular, operating system kernels do not benefit from many power-consuming features intended to improve application performance. We advocate asymmetric single-ISA multicore systems, in which some cores are optimized to run os code at greatly improved energy efficiency.

关键词： multiprocessing multiprogramming operating systems power management simulation of multiple-processor systems software engineering Software engineering Multiprocessing systems energy saving Operating systems multiprogramming PARALLEL PROCESSING (COMPUTERS) central processing units Energy sources

来源：评论

学校读者我要写书评

暂无评论

DROL - A DISTRIBUTED AND REAL-TIME OBJECT-ORIENTED LOGIC ENVIRONMENT

引用

COMPUTER JOURNAL 1994年第5期37卷 407-421页

作者： DIAZ, M PIMENTEL, E TROYA, JM Dpto de Lenguajes y Ciencias de la Computacion Universidad de Malaga Pza El Ejido s/n 29013 Malaga Spain

The high complexity of distributed computer systems requires new methodologies and languages especially designed for the characteristics of these systems. Declarative languages have been proposed as a promising alternative because they provide a way of leaving aside system details. However, the behaviour of reactive systems cannot be described in pure relational or functional terms. We propose a declarative environment for distributed programming based on the concurrent logic language Parlog, which has the capability of expressing concurrence, communication and non-determinism in a very natural way. That is, the intrinsic parallel semantics of the concurrent logic languages make them appropriate for distributed programming. The proposed environment is particularly suitable for loosely coupled systems and it contains mechanisms for distributed process control, and both real-time and object-oriented design. Each of these characteristics is achieved by the integration, in the framework of the underlying concurrent logic language, of realtime and distributed processing control primitives and object-oriented constructions. From this viewpoint, an operational semantics is defined and some implementation issues are discussed.

关键词： multiprogramming

来源：评论

学校读者我要写书评

暂无评论

ANALYTIC QUEUING MODELS FOR PROGRAMS WITH INTERNAL CONCURRENCY

引用

IEEE TRANSACTIONS ON COMPUTERS 1983年第1期32卷 73-82页

作者： HEIDELBERGER, P TRIVEDI, KS DUKE UNIV DEPT COMP SCI DURHAM NC 27706 USA

Analytic queueing models of programs with internal concurrency are considered. The program behavior model allows a process to spawn two or more concurrent tasks at some point during its execution. Except for queueing effects, the tasks execute independently of one another, and at the end of their execution, either wait for all of their siblings to finish execution or merge with the parent if all have finished execution. Two approximate solution methods for the performance prediction of such systems are developed, and results of the approximations are compared to those of simulations. The approximations are both computationally efficient and highly accurate. The gain in performance due to multitasking and multiprocessing is studied with a series of examples.

关键词： Approximate solution Markov chain computer systems modeling multiprocessing multiprogramming multitasking parallel processing performance evaluation queueing network models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：