Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wee Teck Ng

dblp:n/WeeTeckNg · DBLP profile ↗
← Back
9ranked-venue papers
6as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 3 first-authorSystems, architecture and hardware · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorComputer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
6 papers
Storage systems · 41% Memory systems · 33% Hardware reliability and fault tolerance · 9%
Databases, data mining, and information retrieval
2 papers
Indexing and storage engines · 54% Database system architecture and tuning · 46%
Software engineering, system software, and programming languages
2 papers
Operating systems · 100%

Topics — the 13 heaviest of 17, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › cache management › storage caching
file cache
0.022001
The Design and Verification of the Rio File Cache · IEEE Trans. Computers 2001
The Rio File Cache: Surviving Operating System Crashes · ASPLOS 1996
Storage systems
file systems
0.022001
The Design and Verification of the Rio File Cache · IEEE Trans. Computers 2001
The Rio File Cache: Surviving Operating System Crashes · ASPLOS 1996
Memory systems › memory architecture
reliable memory
0.022001
The Design and Verification of the Rio File Cache · IEEE Trans. Computers 2001
The Rio File Cache: Surviving Operating System Crashes · ASPLOS 1996
Operating systems › persistence
crash recovery
0.012001
The Design and Verification of the Rio File Cache · IEEE Trans. Computers 2001
Storage systems
storage reliability
0.021997
The Rio File Cache: Surviving Operating System Crashes · ASPLOS 1996
Integrating Reliable Memory in Databases · VLDB 1997
Indexing and storage engines › storage management
database storage
0.011998
Integrating Reliable Memory in Databases · VLDB J. 1998
Hardware reliability and fault tolerance
dependability analysis
0.011998
Dependability and Performance Measures for the Database Practitioner · IEEE Trans. Knowl. Data Eng. 1998
Performance modeling and evaluation
queueing models
0.011998
Dependability and Performance Measures for the Database Practitioner · IEEE Trans. Knowl. Data Eng. 1998
Cloud and datacenter computing › cloud storage
storage as a service
0.022002
Obtaining High Performance for Storage Outsourcing · FAST 2002
Storage Service Providers: a Solution for Storage Management? (Panel) · VLDB 2001
Storage systems
crash recovery
0.011996
The Rio File Cache: Surviving Operating System Crashes · ASPLOS 1996
Memory systems
main memory
0.022001
The Design and Verification of the Rio File Cache · IEEE Trans. Computers 2001
The Rio File Cache: Surviving Operating System Crashes · ASPLOS 1996
Distributed systems
fault tolerance
0.011998
Dependability and Performance Measures for the Database Practitioner · IEEE Trans. Knowl. Data Eng. 1998
Hardware reliability and fault tolerance › system reliability
repairable systems
0.011998
Dependability and Performance Measures for the Database Practitioner · IEEE Trans. Knowl. Data Eng. 1998

Methods — techniques the papers use, named apart from their topics

warm reboot · 0.0memory protection · 0.0queueing theory · 0.0non-volatile memory · 0.0markov modeling · 0.0
YearPublicationVenuePosition
2003 Application of angular diversity in OFDM systems
abstract
Orthogonal frequency division multiplexing (OFDM) can be successfully used in mitigating the effect of multipath in a wireless channel. However, its' performance degrade in the presence of Doppler spreading. In this paper, multiple beamforming using uniform linear arrays (ULA) is used for OFDM systems to reduce Doppler spread and exploit the advantage of diversity. Each of the beams receiver signal which equal Doppler spread, which are combined using equal gain combining (EGC). We also present a method of determining the frequency compensating parameters, for beams pointing in different directions. Finally, our simulation results show that angular diversity in OFDM systems can provide significant improvement as compared to using only single beamforming.
Wee Teck Ng, Vimal K. Dubey
ICC1
2002 Obtaining High Performance for Storage Outsourcing
Wee Teck Ng, Bruce Hillyer, Elizabeth A. M. Shriver, Eran Gabber, Banu Özden
FAST1
2001 Storage Service Providers: a Solution for Storage Management? (Panel)
Banu Özden, Eran Gabber, Bruce Hillyer, Wee Teck Ng, Elizabeth A. M. Shriver, David J. DeWitt, Bruce Gordon, Jim Gray 0001, John Wilkes
VLDB4
2001 The Design and Verification of the Rio File Cache
abstract
Today's file systems are limited in speed and reliability by memory's vulnerability to operating system crashes. Because memory is viewed as unsafe, systems periodically write modified file data back to disk. These extra disk writes lower system performance and the delay period before data is safe lowers reliability. The goal of the Rio (RAM I/O) file cache is to make ordinary main memory safe for persistent storage by enabling memory to survive operating system crashes. Reliable main memory enables the Rio file cache to be as reliable as a write-through file cache, where every write is safe instantly, and as fast as a pure write-back file cache, with no reliability-induced writes to disk. This paper describes the systematic, quantitative process we used to design and verify the Rio file cache on Intel PCs running FreeBSD and the reliability and performance of the resulting system.
Wee Teck Ng, Peter M. Chen
IEEE Trans. Computers1
1998 Dependability and Performance Measures for the Database Practitioner
abstract
We estimate the availability, reliability, and mean transaction time (response time) for repairable database configurations, centralized or distributed, in which each service component is continuously available for repair. Reliability, the probability that the entire transaction can execute properly without failure, is computed as a function of mean time to failure (MTTF) and mean time to repair (MTTR). Mean transaction time in the system is a function of the mean service delay time for the transaction over all components, plus restart delays due to component failures, plus queuing delays for contention. These estimates are potentially applicable to more generalized distributed systems.
Toby J. Teorey, Wee Teck Ng
IEEE Trans. Knowl. Data Eng.2
1998 Integrating Reliable Memory in Databases
Wee Teck Ng, Peter M. Chen
VLDB J.1
1997 Integrating Reliable Memory in Databases
Wee Teck Ng, Peter M. Chen
VLDB1
1996 The Rio File Cache: Surviving Operating System Crashes
abstract
One of the fundamental limits to high-performance, high-reliability file systems is memory's vulnerability to system crashes. Because memory is viewed as unsafe, systems periodically write data back to disk. The extra disk traffic lowers performance, and the delay period before data is safe lowers reliability. The goal of the Rio (RAM I/O) file cache is to make ordinary main memory safe for persistent storage by enabling memory to survive operating system crashes. Reliable memory enables a system to achieve the best of both worlds: reliability equivalent to a write-through file cache, where every write is instantly safe, and performance equivalent to a pure write-back cache, with no reliability-induced writes to disk. To achieve reliability, we protect memory during a crash and restore it during a reboot (a "warm" reboot). Extensive crash tests show that even without protection, warm reboot enables memory to achieve reliability close to that of a write-through file system. Adding protection makes memory even safer than a write-through file system while adding essentially no overhead. By eliminating reliability-induced disk writes, Rio performs 4-22 times as fast as a write-through file system, 2-14 times as fast as a standard Unix file system, and 1-3 times as fast as an optimized system that risks losing 30 seconds of data and metadata.
Peter M. Chen, Wee Teck Ng, Subhachandra Chandra, Christopher M. Aycock, Gurushankar Rajamani, David E. Lowell
ASPLOS2
1996 Comparing disk and memory's resistance to operating system crashes
abstract
Memory is commonly viewed as an unreliable place to store permanent data (files) because it is perceived to be vulnerable to system crashes. Yet despite all the negative implications of memory's unreliability, no data exists that quantifies how vulnerable memory actually is to system crashes. This paper quantitatively compares the vulnerability of disk and memory to operating system crashes. We use software fault injection to induce a wide variety of operating system crashes in DEC Alpha workstations running Digital Unix, ranging from bit errors in the kernel stack to deleting branch instructions to C-level allocation management errors. We find that files on disk are rarely corrupted (1.1% corruption rate), which agrees with our intuition. We also find that, surprisingly files in memory are nearly as safe as files on disk. Only 10 of the 650 crashes we observed (1.5%) corrupt any files in memory. Our data contradicts the common assumption that operating system crashes often corrupt files in memory and suggests that memory can be used to store permanent data rather than needing to write it back to disk.
Wee Teck Ng, Christopher M. Aycock, Gurushankar Rajamani, Peter M. Chen
ISSRE1