Compiler compatible 5.66 Mb/mm2 8T 1R1W register file in 14 nm FinFET technology

1-read/1-write (1R1W) register file (RF) is a popular memory configuration in modern feature rich SoCs requiring significant amount of embedded memory. A memory compiler is constructed using the 8T RF bitcell spanning a range of instances from 32 b to 72 Kb. An 8T low-leakage bitcell of 0.106 μm² is used in a 14 nm FinFET technology with a 70 nm contacted gate pitch for high-density (HD) two-port (TP) RF memory compiler which achieves 5.66 Mb/mm² array density for a 72 Kb array which is the highest reported density in 14 nm FinFET technology. The density improvement is achieved by using techniques such as leaf-cell optimization (eliminating transistors), better architectural planning, top level connectivity through leaf-cell abutment and minimizing the number of unique leaf-cells. These techniques are fully compatible with memory compiler usage over the required span. Leakage power is minimized by using power-switches without degrading the density mentioned above. Self-induced supply voltage collapse technique is applied for write and a four stack static keeper is used for read Vmin improvement. Fabricated test chips using 14 nm process have demonstrated 2.33 GHz performance at 1.1 V/25 °C operation. Overall V_min of 550 mV is achieved with this design at 25 °C. The inbuilt power-switch improves leakage power by 12x in simulation. Approximately 8% die area of a leading 14 nm SoC in commercialization is occupied by these compiled RF instances.     

Solaris2.X操作系统上NFS的环境配置

本文描述了Ｓｏｌａｒｉｓ２．Ｘ操作系统上网络文件系统ＮＦＳ的特性及其环境配置，介绍了如何建立了ＮＦＳ服务器和ＮＦＳ客户机，从而实现了远程文件系统资源共享。     

32位实时操作系统FCCRTOS的设计与实现

介绍了自行设计的，不依赖其他软件支持而存在，可直接运行在Ｉｎｔｅｌ８０３７６、８０３８６、８０４８６和８０５８６处理器的计算机上，便于移植的一个完全独立的实时操作系统—ＦＣＣＲＴＯＳ。其特点为：３２位寻址、内存保护模式的段式管理、多任务并发处理、实时事件线程管理、支持多总线通信协议、模块化设计及目标程序完全ＲＯＭ化等。     

基于AutoCAD的电气符号图像控制菜单的开发

以电气符号为例，介绍了AutoCAD平台下图像控制菜单的开发过程以及幻灯片、幻灯片库的创建方法。     

Linux系统下的ELF文件分析

随着linux系统的发展，elf了十分重要的可执行文件格式。本文介绍了elf文件的格式，并在此基础上分析出elf文件的特性。     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

化学计算与图形处理软件设计

近年来 ,化学计算与图形处理越来越受到重视 ,许多用于微机计算的精确公式也相继发表 .介绍了酸碱滴定曲线通用计算公式、络合滴定通用计算公式、氧化还原滴定通用计算公式、混合体系缓冲容量的通用算法以及这些公式在图形处理中的应用 .简要介绍了笔者以Delphi5.0为平台处理图形时的流程及思路 .     

频率/待测量变换的GAL、ERROM设计方法

本文提出了以通用阵列逻辑器件 GAL 和只读存贮器 EPROM 为核心器件的频率/待测量变换的设计方法。配以数字式传感器及用最小二乘法编制的曲线自动分段拟合程序生成的 EPROM 中的数据,可用于力、温度、光强等非电量的测量显示和控制。这种装置与采用微处理器的电路相比,有相同的测量精度,电路简单,而且保密性好.     

Stochastic analysis of file-swarming systems

File swarming (or file sharing) is one of the most important applications in P2P networks. In this paper, we propose a stochastic framework to analyze a file-swarming system under realistic setting: constraints in upload/download capacity, collaboration among peers and incentive for chunk exchange. We first extend the results in the coupon system [L. Massoulie, M. Vojnovic, Coupon replication systems, in: Proc. ACM SIGMETRICS, Banff, Alberta, Canada, 2005] by providing a tighter performance bound. Then we generalize the coupon system by considering peers with limited upload and download capacity. We illustrate the last-piece problem and show the effectiveness of using forward error-correction (FEC) code and/or multiple requests to improve the performance. Lastly, we propose a framework to analyze an incentive-based file-swarming system. The stochastic framework we propose can serve as a basis for other researchers to analyze and design more advanced features of file-swarming systems.