An efficient implementation of SELF, a dynamically-typed object-oriented language based on prototypes

We have developed and implemented techniques that double the performance of dynamically-typed object-oriented languages. Our SELF implementation runs twice as fast as the fastest Smalltalk implementation, despite SELF's lack of classes and explicit variables.To compensate for the absence of classes, our system uses implementation-levelmaps to transparently group objects cloned from the same prototype, providing data type information and eliminating the apparent space overhead for prototype-based systems. To compensate for dynamic typing, user-defined control structures, and the lack of explicit variables, our system dynamically compilesmultiple versions of a source method, eachcustomized according to its receiver's map. Within each version the type of the receiver is fixed, and thus the compiler can statically bind andinline all messages sent toself.Message splitting andtype prediction extract and preserve even more static type information, allowing the compiler to inline many other messages. Inlining dramatically improves performance and eliminates the need to hard-wire low-level methods such as+, ==, andifTrue:.Despite inlining and other optimizations, our system still supports interactive programming environments. The system traverses internal dependency lists to invalidate all compiled methods affected by a programming change. The debugger reconstructs inlined stack frames from compiler-generated debugging information, making inlining invisible to the SELF programmer.This work has been generously supported by National Science Foundation Presidential Young Investigator Grant #CCR-8657631, and by IBM, Texas Instruments, NCR, Tandem Computers, Apple Computer, and Sun Microsystems.This paper was originally published inOOPSLA '89 Conference Proceedings (SIGPLAN Notices, 25, 10 (1989) 49–70).     

Bandwidth and region division for broadband multi-cell networks

A cell planning technique termed BRD (bandwidth and region division) is presented for overcoming interference, maintaining QoS (quality of service) and improving channel capacity over OFDM (orthogonal frequency division multiplexing)-based broadband cellular networks. Through an optimal combination of sectorization and zero padding, bandwidth and region division is achieved that minimizes the outage probability for forward-link cell planning. In order to verify the effectiveness of the proposed algorithm, a Monte Carlo simulation is performed over multi-cell environments.     

A practical approach for statistical matching of output queueing

We study a practical approach to match the performance of an output-queued switch statistically. For this purpose, we propose a novel switching architecture called a multiple input/output-queued (MIOQ) switch that requires no speedup for providing sufficient switching bandwidth. To operate an MIOQ switch in a practical manner, we also propose a multitoken-based arbiter which schedules the switch at a high operation rate and a virtual first-in first-out queueing scheme which guarantees the departure order of cells belonging to the same traffic flow at output. Additionally, we show that the proposed switch can naturally provide asymmetric bandwidth for inputs and outputs, which may be important in dealing with the links with different bandwidth demands. Finally, we compare the performance of an MIOQ switch with that of an output-queued switch and discuss the design criteria to match the performance of an output-queued switch.     

Data retention characteristics of sub-100 nm NAND flash memory cells

In contrast to the conventional theories, we have revealed that the most distinguished mechanism in the data retention phenomenon after Fowler-Nordheim (FN) stress in sub-100 nm NAND Flash memory cells is the annihilation of interface states. Interface state generation rate increases rapidly as the channel width of NAND flash cell decreases. Comparison of interface states and stress-induced leakage current (SILC) component during retention mode shows that the annihilation of interface states strongly affects data retention characteristics of the programmed cells.     

89-GHz fT room-temperature silicon MOSFETs

The authors report the implementation of deep-submicrometer Si MOSFETs that at room temperature have a unity-current-gain cutoff frequency (f_T) of 89 GHz, for a drain-to-source bias of 1.5 V, a gate-to-source bias of 1 V, a gate oxide thickness of 40 Å, and a channel length of 0.15 μm. The fabrication procedure is mostly conventional, except for the e-beam defined gates. The speed performance is achieved through an intrinsic transit time of only 1.8 ps across the active device region     

The material properties of sulphonated phenolic resin reinforced cement mortars

The material properties of new sulphonated phenolic resin (SP) reinforced cement mortars have been investigated. SP was found to promote the dispersion of cement particles and to interact with Ca(OH)₂. As a result, the resulting mortars exhibit better workability, more compact structure and higher compressive strength than plain mortars. The mortar with 1 wt% SP present after 28 days curing exhibits a compressive strength of 66MPa, which is about 18% higher than that of plain mortar.     

Queueing analyses of traffic access control strategies withpreemptive and nonpreemptive disciplines in wideband integrated networks

A multiserver queueing model of access control strategies for a wideband integrated services digital network (ISDN) is considered. There are two types of service requests (SRs): Type 1 SR requires b servers (basic bandwidth units, BBUs) of the c available servers, while Type 2 SR requires a single server. Both types of SRs are queuable in two separate infinite-size buffers. A Type 1 SR is allowed to seize d(⩽b) servers at first and then acquire additional servers as they become available to meet the original requirement of b servers. The arrival processes of both types of SRs are Poisson and the service times are exponentially distributed with mean b/dμ₁ and 1/μ₂ for Type 1 SR and Type 2 SR, respectively. Preemptive and nonpreemptive priority disciplines with movable boundary are analyzed using the Neuts' matrix-analytic approach. Numerical examples of the queue length distribution and the mean waiting time of the SRs are presented