Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,237,304 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Bus (computing)
Central processing unit
Computation
Computer multitasking
Expand
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
Thorsten Papenbrock
,
Sebastian Kruse
,
Jorge-Arnulfo Quiané-Ruiz
,
Felix Naumann
Proceedings of the VLDB Endowment
2015
Corpus ID: 9907536
The discovery of all inclusion dependencies (INDs) in a dataset is an important part of any data profiling effort. Apart from the…
Expand
Highly Cited
2013
Highly Cited
2013
Performance Evaluation of Container-Based Virtualization for High Performance Computing Environments
Miguel G. Xavier
,
M. V. Neves
,
F. Rossi
,
T. Ferreto
,
T. Lange
,
C. Rose
21st Euromicro International Conference on…
2013
Corpus ID: 15562514
The use of virtualization technologies in high performance computing (HPC) environments has traditionally been avoided due to…
Expand
Highly Cited
2011
Highly Cited
2011
Performance prediction for concurrent database workloads
Jennie Duggan
,
U. Çetintemel
,
Olga Papaemmanouil
,
E. Upfal
ACM SIGMOD Conference
2011
Corpus ID: 15677153
Current trends in data management systems, such as cloud and multi-tenant databases, are leading to data processing environments…
Expand
2010
2010
Multiple-Job Optimization in MapReduce for Heterogeneous Workloads
Weisong Hu
,
Chao Tian
,
+5 authors
Jie Zhang
Sixth International Conference on Semantics…
2010
Corpus ID: 30050703
Map Reduce cluster is emerging as a solution of data-intensive scalable computing system. The open source implementation Hadoop…
Expand
Highly Cited
2007
Highly Cited
2007
Exploiting Platform Heterogeneity for Power Efficient Data Centers
Ripal Nathuji
,
C. Isci
,
E. Gorbatov
International Conference on Automation and…
2007
Corpus ID: 14935228
It has recently become clear that power management is of critical importance in modern enterprise computing environments. The…
Expand
Highly Cited
2005
Highly Cited
2005
Sparse Matrix-Vector multiplication on FPGAs
Ling Zhuo
,
V. Prasanna
Symposium on Field Programmable Gate Arrays
2005
Corpus ID: 266258
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering…
Expand
2003
2003
Exploiting functional decomposition for efficient parallel processing of multiple data analysis queries
H. Andrade
,
T. Kurç
,
A. Sussman
,
J. Saltz
Proceedings International Parallel and…
2003
Corpus ID: 5992657
Reuse is a powerful method for increasing system performance. In this paper, we examine functional decomposition for improving…
Expand
Highly Cited
2002
Highly Cited
2002
An Empirical Study of Hyper-Threading in High-Performance Computing Clusters
T. Leng
,
R. Ali
,
J. Hsieh
,
V. Mashayekhi
,
R. Rooholamini
2002
Corpus ID: 7808949
The effects of Intel Hyper-Threading technology on a system performance vary according to the type of applications the system is…
Expand
Review
1999
Review
1999
High-end workstation compute farms using windows NT
S. Nimmagadda
,
Joshua LeVasseur
,
Rumi Zahir
1999
Corpus ID: 10831131
This paper describes our experiences in building and deploying Windows NT* based high-end workstation compute farms within the…
Expand
Highly Cited
1993
Highly Cited
1993
The Performance of Parity Placements in Disk Arrays
Edward K. F. Lee
,
R. Katz
IEEE Trans. Computers
1993
Corpus ID: 933781
Due to recent advances in central processing unit (CPU) and memory system performance, input/output (I/O) systems are…
Expand
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)
ACCEPT & CONTINUE
or Only Accept Required