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

A partitioned on-chip virtual cache for fast processors

JOURNAL OF SYSTEMS ARCHITECTURE 1997年第8期43卷 519-531页

作者： Kim, D Lee, J Park, S AJOU UNIV DIV INFORMAT & COMP ENGNKWONSUN GUSUWON 441749KYUNGGI DOSOUTH KOREA

In this paper, we propose a new virtual cache architecture that reduces memory latency by encompassing the merits of both direct-mapped cache and set-associative cache, The entire cache memory is divided into n banks, and the operating system assigns one of the banks to a process when it is created. Then, each process runs on the assigned bank, and the bank behaves like in a direct-mapped cache. If a cache miss occurs in the active home bank, then the data will be fetched either from other banks or from the main memory like a set-associative cache. A victim for cache replacement is selected from those that belong to a process which is most remote from being scheduled. Trace-driven simulations confirm that the new scheme removes almost as many conflict misses as does the set-associative cache, while cache access time is similar to a direct-mapped cache.

关键词： virtual cache conflict miss multiprogramming context switch process cache partitioning replacement algorithms

来源：评论

学校读者我要写书评

暂无评论

WORKING-SETS PAST AND PRESENT

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1980年第1期6卷 64-84页

作者： DENNING, PJ Department of Computer Science Purdue University

A program's working set is the collection of segments recently referenced. This concept has led to efficient methods for measuring a program's intrinsic memory demand. It has assisted in understanding and modeling program behavior, and it has been used as the basis of optimal multiprogrammed memory management. The total cost of a working set dispatcher is no larger than the total cost of other common dispatchers. It is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better *** with real programs revealed that the working set policy is the most likely to generate minimum space-time for any given program, and that one properly chosen control parameter value is normally sufficient to cause any program's working-set space-time to be within 10% of the minimum possible for that program. Working set dispatchers automatically control the level of multiprogramming while maintaining near-minimum space-time for each program.

关键词： Working Sets Dispatchers Lifetime Curves Memory Management Memory Space Time Product Multiprogrammed Load Controllers multiprogramming Optimal multiprogramming Phase Transition Behavior Program Behavior Program Locality Program Measurement Stochastic Program Models Virtual Memory Working Set Dispatchers

来源：评论

学校读者我要写书评

暂无评论

Peterson's mutual exclusion algorithm revisited

引用

SCIENCE OF COMPUTER PROGRAMMING 1997年第3期29卷 327-334页

作者： vanderSommen, FW Feijen, WHJ vanGasteren, AJM EINDHOVEN UNIV TECHNOL DEPT MATH & COMP SCINL-5600 MB EINDHOVENNETHERLANDS

a new derivation of Peterson's well-known mutual exclusion algorithm is presented. The derivation is driven by the formally stated requirements of Individual Progress, as opposed to the more traditional approach which starts from the requirement of Mutual Exclusion. The only formalisms used in the derivation are the predicate calculus and the theory of Owicki and Gries. No use is made of temporal logic. In particular, the so complicating oscillating behaviour of an await-condition is fully absorbed by the use of a variant function. (C) 1997 Elsevier Science B.V.

关键词： multiprogramming progress variant function program development simplicity Mutual Exclusion

来源：评论

学校读者我要写书评

暂无评论

Permeability prediction from well logs using an improved windowing technique

引用

JOURNAL OF PETROLEUM GEOLOGY 1999年第2期22卷 215-226页

作者： Wong, PM Univ New S Wales Sch Petr Engn Sydney NSW 2052 Australia

Permeability prediction from well logs is of great importance in reservoir characterization and engineering. In this paper, a new method is proposed to correlate conventional well logs and core permeability data. It uses an improved "windowing" technique to incorporate adjacent core data to the permeability predictor in such a way that the scales of the well log and core measurements are matched It also has the capability to evaluate the reliability of each and every prediction. The method is implemented by the use of a neural network and is demonstrated by means of a case study. The study uses a set of well logs and limited core permeability data to produce continuous permeability profiles. The results show that the permeability profiles are consistent with the core permeability and the geological sequence of the reservoir The reliability indicator is particularly useful for examining reservoir heterogeneity and sampling.

关键词： Permeability BOREHOLE FLOW PROFILING core Well Logs multiprogramming Reservoir description

来源：评论

学校读者我要写书评

暂无评论

Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1998年第1期51卷 1-26页

作者： Michael, MM Scott, ML Univ Rochester Dept Comp Sci Rochester NY 14627 USA

Most multiprocessors are multiprogrammed to achieve acceptable response time and to increase their utilization. Unfortunately, inopportune preemption may significantly degrade the performance of synchronized parallel applications. To address this problem, researchers have developed two principal strategies for a concurrent, atomic update of shared data structures: (1) preemption-safe locking and (2) nonblocking (lock-free) algorithms. Preemption-safe locking requires kernel support. Nonblocking algorithms generally require a universal atomic primitive such as compare-and-swap or load-linked/store- conditional and are widely regarded as inefficient. We evaluate the performance of preemption-safe lock-based and nonblocking implementations of important data structures-queues, stacks, heaps, and counters-including nonblocking and lock-based queue algorithms of our own. in microbenchmarks and real applications on a 12-processor SGI Challenge multiprocessor. Our results indicate that our nonblocking queue consistently outperforms the best known alternatives and that data-structure-specific nonblocking algorithms, which exist for queues, stacks, and counters, can work extremely well. Not only do they outperform preemption-safe lock-based algorithms on multiprogrammed machines, they also outperform ordinary locks on dedicated machines. At the same time, since general-purpose nonblocking techniques do not yet appear to be practical, preemption-safe locks remain the preferred alternative for complex data structures: they outperform conventional locks by significant margins on multiprogrammed systems. (C) 1998 Academic Press.

关键词： nonblocking lock-free mutual exclusion locks multiprogramming concurrent queues concurrent stacks concurrent heaps concurrent counters concurrent date structures compare-and-swap load-linked store-conditional

来源：评论

学校读者我要写书评

暂无评论

THE WINDOW TERMINAL

引用

COMPUTER JOURNAL 1987年第6期30卷 558-564页

作者： PARKER, J KENNARD, A KING, D Centre for Computing and Computer Science The University of Birmingham Edgbaston Birmingham B15 2TT

A program ROM has been developed for the BBC microcomputer, which makes it function as a powerful window management terminal, with a high resolution display, mouse and programmable keyboard. The BBC Window terminal ROM provides a cheap alternative to the more expensive windowing workstations that provide the same resolution and facilities. It also enables windowing interfaces to be attached to existing computer hardware without having to port the software to the new workstation environment – a fast and cheap method for improved man–machine interface. All window management operations are handled locally, with control information being passed between the terminal and the host computer via an RS232 interface line.

关键词： high resolution displays ROM1 gene Pseudomonas syringae pv. garcae on line data service windows window BALANCED BIOLOGICAL COMMUNITIES Information control Workstations windows Computer hardware Read Only Memory Device Component multiprogramming Device Terminal BBC

来源：评论

学校读者我要写书评

暂无评论

FAULT-DETECTION AND IDENTIFICATION FOR RELIABLE LARGE-SCALE COMPUTING

引用

ELECTRONICS LETTERS 1985年第2期21卷 50-52页

作者： LOMBARDI, F Department of Electrical & Computer Engineering University of Colorado Boulder USA

In the letter, the analysis of a new technique for fault-tolerant computing is presented. This technique is applicable to systems with a large number of modules which require the simultaneous and reliable execution of... 详细信息

关键词： fault-tolerant computing Other aspects of analogue and digital computers multiple jobs modular redundancy multiprogramming modules redundancy reliable large-scale computing fault detection fault tolerant computing identification

来源：评论

学校读者我要写书评

暂无评论

Multitasking on the cheap

引用

DR DOBBS JOURNAL 2004年第2期29卷 76-+页

作者： Porter, A

System designs that do not require a significant investment in training are important. A toolbox of simple utilities provides a way to create multiple execution threads in a single program, and does this with a minimal learning curve. This solution is quick to implement, requires no special training in the theory of operation, and avoids some common problems found in more advanced systems.

关键词： multiprogramming

来源：评论

学校读者我要写书评

暂无评论

HIERARCHICAL MULTILEVEL COMPUTER NETWORK FOR LABORATORY AUTOMATION

引用

SOFTWARE-PRACTICE & EXPERIENCE 1983年第3期13卷 227-240页

作者： LINDGARD, A OXENBOLL, J SORENSEN, E H. C. Ørsted Institutet Københavns Universitet Universitetsparken 5 DK-2100 København Ø Denmark

The design and implementation of a microcomputer network to support laboratory automation is described and discussed. It is a multi-level hierarchical star network connected to a multiprogrammed computer on which all program development is done. The system is capable of supporting a large number of experimental setups. The microcomputers are either used as (1) local microcomputers for experiment control, (2) multiplexers for other microcomputers or (3) controllers for peripherals known in the multiprogrammed computer. The system combines the advantages of a large multiprogrammed computer with those of a small cheap dedicated computer close to the experiment. Character-oriented peripherals are connected to the multiprogrammed computer only. This reduces the amount of system software to be written for the network by an order of magnitude and eliminates the need for interfacing to existing small computer software. The system software consist of three small programs (monitors) providing a process concept and multibuffering of data in the involved computers. The monitor establishes a hierarchy of control and they eliminate the need for any local load device for the microcomputers as their monitors are in a read-only store. The system developed is designed for control of experiments in an environment where the experiments and the control strategies change with time and where the data refinement required is beyond what can be done on the present generation of microcomputers.

关键词： Computer network Laboratory automation Monitor Operating system Microcomputers multiprogramming

来源：评论

学校读者我要写书评

暂无评论

Comparing processor allocation strategies in multiprogrammed shared-memory multiprocessors

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1998年第2期49卷 245-258页

作者： Yue, KK Lilja, DJ Sun Microsyst Inc Palo Alto CA 94303 USA Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA

Small-scale shared-memory multiprocessors are commonly used in a workgroup environment where multiple applications, both parallel and sequential, are executed concurrently while sharing the processors and other system resources. To utilize the processors efficiently, an effective allocation strategy is required. In this paper, we use performance data obtained from an SGI multiprocessor to evaluate several processor allocation strategies when running two parallel programs simultaneously. We examine gang scheduling (coscheduling), static space-sharing (space partitioning), and a dynamic allocation scheme called lop-level process control (LLPC) with three different dynamic allocation heuristics. We use regression analysis to quantify the measured data and thereby explore the relationship between the degree of parallelism of the application, specific system parameters (such as the size of the system), the processor allocation strategy, and the resulting performance. This study shows that dynamically partitioning the system using LLPC or similar heuristics provides better performance for applications with a high degree of parallelism than either gang scheduling or static space-sharing. (C) 1998 Academic Press.

关键词： processor allocation multiprogramming shared-memory multiprocessors performance measurement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：