Skip to search formSkip to main contentSkip to account menu

I/O bound

Known as: I/O-bound, IO bound 
In computer science, I/O bound refers to a condition in which the time it takes to complete a computation is determined principally by the period… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Bus (computing)Central processing unitComputationComputer multitasking

Broader (1)

Computer performance

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Divide & Conquer-based Inclusion Dependency Discovery
The discovery of all inclusion dependencies (INDs) in a dataset is an important part of any data profiling effort. Apart from the… 
Highly Cited
2013
Highly Cited
2013
Performance Evaluation of Container-Based Virtualization for High Performance Computing Environments
The use of virtualization technologies in high performance computing (HPC) environments has traditionally been avoided due to… 
Highly Cited
2011
Highly Cited
2011
Performance prediction for concurrent database workloads
Current trends in data management systems, such as cloud and multi-tenant databases, are leading to data processing environments… 
Highly Cited
2007
Highly Cited
2007
Exploiting Platform Heterogeneity for Power Efficient Data Centers
It has recently become clear that power management is of critical importance in modern enterprise computing environments. The… 
Highly Cited
2005
Highly Cited
2005
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering… 
2003
2003
Exploiting functional decomposition for efficient parallel processing of multiple data analysis queries
Reuse is a powerful method for increasing system performance. In this paper, we examine functional decomposition for improving… 
Highly Cited
2002
Highly Cited
2002
An Empirical Study of Hyper-Threading in High-Performance Computing Clusters
The effects of Intel Hyper-Threading technology on a system performance vary according to the type of applications the system is… 
Review
1999
Review
1999
High-end workstation compute farms using windows NT
This paper describes our experiences in building and deploying Windows NT* based high-end workstation compute farms within the… 
Highly Cited
1991
Highly Cited
1991
On using priority inheritance in real-time databases
The authors investigate solutions to the priority inversion problem in a real-time database where two-phase locking is employed… 
Highly Cited
1990
Highly Cited
1990
Optimal disk I/O with parallel block transfer
1 I n t r o d u c t i o n Sorting is the canonical information-processing application. It accounts for roughly 20-25 percent of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)