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

IEEE SOFTWARE 2018年第6期35卷 68-71页

作者： Parnas, David Lorge McMaster Univ Hamilton ON Canada Univ Limerick Limerick Ireland Middle Rd Software Ottawa ON Canada

In the half century since Edsger Dijkstra published “The Structure of the ‘THE’-multiprogramming System,” it has become clear that the ability to design a software system’s structure is at least as important as the ability to design efficient algorithms or write code in a particular programming language. Although the word “structure” appeared in the paper’s title and was used seven more times, Dijkstra never defined the term. Closer examination revealed that he was discussing at least three distinct structures. His failure to define “structure,” or to clearly distinguish the structures that were important in his software, has led many to confuse those structures. This article aims to clarify what those structures are, their differences, and each one’s importance.

关键词： multiprogramming Programming Languages Software Structures Edsger Dijkstra THE multiprogramming System Software System Particular Programming Language Word Structure Closer Examination Distinct Structures Software Engineering Operating Systems Software Development Codes Module Program Component Process Software Structures Uses Part Of Gives Work To Edsger Dijkstra THE Operating System Software Engineering Software Development Reliable Code

来源：评论

学校读者我要写书评

暂无评论

The architecture of virtual machines

引用

COMPUTER 2005年第5期38卷 32-+页

作者： Smith, JE Nair, R Univ Wisconsin Dept Elect & Comp Engn Madison WI 53706 USA IBM Corp TJ Watson Res Ctr Armonk NY 10504 USA

A virtual machine can support individual processes or a complete system depending on the abstraction level where virtualization occurs. Some VMs support flexible hardware usage and software isolation, while others tra... 详细信息

关键词： HW/SW interface VM taxonomy abstraction level application binary interface application program interfaces application programming interface computer architecture computer architectures disk storage formal specification hardware resources hardware-software codesign instruction set architecture multiprocessing systems multiprogramming real system software systems virtual machine architecture virtual machines virtual machines virtualization technology

来源：评论

学校读者我要写书评

暂无评论

ENHANCING PERFORMANCE IN A PARALLEL FILE SYSTEM

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROPROGRAMMING 1994年第4期40卷 261-274页

作者： MILLER, LL INGLETT, SR IOWA STATE UNIV SCI & TECHNOL DEPT COMP SCIAMESIA 50011

As computer applications have become more sophisticated, they have become rather data intensive. Such applications suffer from inadequate use of parallelism for processing data stored on secondary storage devices. Devices such as database machines are useful in some applications, but many applications are too small or specialized to make use of database machine technology. To bridge this gap, we have introduced a parallel file system. The parallel file system is capable of acting as either an SIMD machine or an MIMD machine depending on the file type. In the present work, we describe two approaches to enhance performance in the parallel file system. First, we examine a strategy of initiating partial searches when full searches for concurrent file usage are not possible. As a second level, a relocation algorithm has been designed to move selected portions of files (subfiles) to improve the degree of parallelism in the multiprogramming environment. The relocation algorithm makes use of a cost function based on the level of sharing between files to determine the best place to relocate the subfiles.

关键词： PARALLEL FILES multiprogramming SEARCHING

来源：评论

学校读者我要写书评

暂无评论

WHEN CLIENT-SERVER ISNT ENOUGH - COORDINATING MULTIPLE DISTRIBUTED TASKS

引用

COMPUTER 1994年第5期27卷 73-79页

作者： LIANG, TP LAI, HC CHEN, NS WEI, HS CHEN, MC BILLION ELECT CO TAIPEI TAIWAN NATL SUN YAT SEN UNIV CTR COMP DIV COMP NETWORK KAOHSIUNG TAIWAN ACAD SINICA INST INFORMAT MANAGEMENT TAIPEI 115 TAIWAN

The rapid growth of computer networks and client/server computing has focused much attention on the development of groupware - computer software that supports cooperative work. Groupware is different from traditional software in that it allows a group of people to work together electronically. requires a distributed hardware environment (networked personal computers or workstations), and utilizes client/server computing to facilitate information sharing, dissemination, routing, and user interaction. Unfortunately, the traditional client/server architecture is inadequate for a distributed multitasking group environment because coordination involves interactions both within and across multiple applications. The authors have developed a prototype distributed multitasking environment, DEEDS (Distributed Environment for Electronic Decision Support), that differentiates between coordination functions specific to a particular application and those shared by all applications. DEEDS extends the client/server architecture to three levels: a groupware server, application servers, and application clients. The prototype features implementations of Talk for communication, Group Paint for collaborative design, and Electronic Meeting for group decision making. Because of its object-oriented groupware kernel, the architecture can be further refined to provide more applications. Future research will study additional applications to determine their idiosyncratic coordination needs and to elaborate the division of labor among different servers and clients.

关键词： application servers client-server sytems clients coordination issues group calendaring groupware groupware server multiple distributed tasks multiprogramming multitasked cooperative work network operating systems participative design three-layer architecture

来源：评论

学校读者我要写书评

暂无评论

Finite state machine-based DRAM power management with early resynchronisation

引用

IET COMPUTERS AND DIGITAL TECHNIQUES 2007年第4期1卷 434-442页

作者： Park, J. H. Chu, Y. SUNY Albany Dept Comp Sci New Paltz NY 12561 USA Mississippi State Univ Dept Elect & Comp Engn Mississippi State MS 39762 USA

An efficient operating system-based power management scheme for DRAM in the multiprogramming/time-sharing environment is presented. Formulas for evaluating the condition of positive energy gain are developed and a finite state machine (FSM) for selecting the best power mode for a given idle time is designed. In the proposed scheme, the scheduler selectively assigns the most efficient power mode to each idle memory bank at context switching time based on the FSM. For computing the idle time, two efficient and practical prediction methods are developed and tested for performance. The proposed scheme achieves further energy saving by starting the resynchronisation of idle memory banks as early as possible. In the aspects of the prediction method and the early resynchronisation method, multiple versions of the proposed scheme are developed and tested for performance. The proposed scheme utilises events occurring at context switching time in the multiprogramming/time-sharing environment and the scheduling ensures the maximum energy gain without significantly degrading the performance. The proposed scheme is tested with a simulated system, and the experimental results demonstrate the efficiency of the scheme. In the experiment, the energy gain by using the proposed scheme ranges from 17.84% to 52.21% depending on the time quantum sizes tested.

关键词： scheduling DRAM chips multiprogramming/time-sharing environment resynchronisation multiprogramming finite state machine finite state machines idle memory bank DRAM power management power supplies to apparatus

来源：评论

学校读者我要写书评

暂无评论

RESPONSE-TIME DISTRIBUTION IN A MULTIPROGRAMMED COMPUTER WITH TERMINAL TRAFFIC

引用

PERFORMANCE EVALUATION 1988年第1期8卷 41-50页

作者： REGE, KM SENGUPTA, B AT&T BELL LABS DEPT PERFORMANCE ANALHOLMDELNJ 07733

The central server model has been used to study a computer with a CPU and disks and operating with a fixed limit on the level of multiprogramming. An approximation of this model is to treat the CPU and disk subsystem as a single state-dependent server. Under some assumptions, such an approximation is known to give good results for the mean response time. This paper is concerned with two issues about this approximation. First, we obtain a complete characterization of the response time distribution. Second, based on this characterization, a numerically feasible method is developed for computing the response time distribution. When applied to several examples involving a CPU and several disks, this method yielded results which compared well with those obtained by a simulation of the central server model.

关键词： Reponse Time multiprogramming Central Server Closed Queueing Model

来源：评论

学校读者我要写书评

暂无评论

Simultaneous multithreading: A platform for next-generation processors

引用

IEEE MICRO 1997年第5期17卷 12-19页

作者： Eggers, SJ Emer, JS Levy, HM Lo, JL Stamm, RL Tullsen, DM DIGITAL EQUIPMENT CORP DIGITAL SEMICONDADV DEV GRPMAYNARDMA 01754 UNIV CALIF SAN DIEGO LA JOLLACA 92093

Simultaneous multithreading exploits both instruction-level and thread-level parallelism by issuing instructions from different threads in the same cycle.

关键词： Synclitism PROCESSOR parallelism Multithreading Concurrency Surface mount technology instruction-level parallelism multiprogramming

来源：评论

学校读者我要写书评

暂无评论

Hazard pointers: Safe memory reclamation for lock-free objects

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2004年第6期15卷 491-504页

作者： Michael, MM IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA

Lock-free objects offer significant performance and reliability advantages over conventional lock-based objects. However, the lack of an efficient portable lock-free method for the reclamation of the memory occupied by dynamic nodes removed from such objects is a major obstacle to their wide use in practice. This paper presents hazard pointers, a memory management methodology that allows memory reclamation for arbitrary reuse. It is very efficient, as demonstrated by our experimental results. It is suitable for user-level applications-as well as system programs-without dependence on special kernel or scheduler support. It is wait-free. It requires only single-word reads and writes for memory access in its core operations. It allows reclaimed memory to be returned to the operating system. In addition, it offers a lock-free solution for the ABA problem using only practical single-word instructions. Our experimental results on a multiprocessor system show that the new methodology offers equal and, more often, significantly better performance than other memory management methods, in addition to its qualitative advantages regarding memory reclamation and independence of special hardware support. We also show that lock-free implementations of important object types, using hazard pointers, offer comparable performance to that of efficient lock-based implementations under no contention and no multiprogramming, and outperform them by significant margins under moderate multiprogramming and/or contention, in addition to guaranteeing continuous progress and availability, even in the presence of thread failures and arbitrary delays.

关键词： lock-free synchronization concurrent programming memory management multiprogramming dynamic data structures

来源：评论

学校读者我要写书评

暂无评论

Feedback process scheduling with simple discrete-time control structures

引用

IET CONTROL THEORY AND APPLICATIONS 2010年第11期4卷 2331-2342页

作者： Leva, A. Maggio, M. Politecn Milan Dipartimento Elettron & Informaz I-20133 Milan Italy

This manuscript addresses the problem of process scheduling in a multitasking computing environment. The mainstream feedback-based approach to that problem preserves the existing scheduler, and adapts some of its parameters by means of convenient loops. On the contrary, in this research, the scheduler is entirely replaced by suitable control structures, synthesised and analysed in the discrete-time domain. The proposed approach allows for a clear interpretability of the involved parameters, whereas the complexity of the obtained scheduling solutions is comparable to the existing ones. Simulation examples support the above claims. The focus is here restricted for convenience to the preemptive single-processor case, although several generalisations are possible.

关键词： feedback process scheduling discrete-time control processor scheduling Parallel programming and algorithm theory multitasking computing feedback interpretability discrete time systems Discrete control systems multiprogramming

来源：评论

学校读者我要写书评

暂无评论

JOB SCHEDULING IS MORE IMPORTANT THAN PROCESSOR ALLOCATION FOR HYPERCUBE COMPUTERS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1994年第5期5卷 488-497页

作者： KRUEGER, P LAI, TH DIXITRADIYA, VA Department of Computer and Information Science Ohio State Uinversity Columbus OH USA

Managing computing resources in a hypercube entails two steps. First, a job must be chosen to execute from among those waiting (job scheduling). Next a particular subcube within the hypercube must be allocated to that job (processor allocation). Whereas processor allocation has been well studied, job scheduling has been largely neglected. The goal of this paper is to compare the roles of processor allocation and job scheduling in achieving good performance on hypercube computers. We show that job scheduling has far more impact on performance than does processor allocation. We propose a new family of scheduling disciplines, called Scan, that have particular performance advantages. We show that performance problems that cannot be resolved through careful processor allocation can be solved by using Scan job-scheduling disciplines. Although the Scan disciplines carry far less overhead than is incurred by even the simplest processor allocation strategies, they are far more able to improve performance than even the most sophisticated strategies. Furthermore, when Scan disciplines are used, the abilities of sophisticated processor allocation strategies to further improve performance are limited to negligible levels. Consequently, a simple O(n) allocation strategy can be used in place of these complex strategies.

关键词： DYNAMIC JOB SCHEDULING HYPERCUBE multiprogramming PERFORMANCE PROCESSOR ALLOCATION SCAN SCHEDULING

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：