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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2017
05101519742017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Consolidation of multiple databases on the same server allows service providers to save significant resources because many… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
Incremental gradient descent is a general technique to solve a large class of convex optimization problems arising in many… (More)
  • table 1
  • table 2
Is this relevant?
2012
2012
"Big Data" computing increasingly utilizes the MapReduce programming model for scalable processing of large data collections… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
2011
2011
There is growing concern that I/O systems will be hard pressed to satisfy the requirements of future leadership-class machines… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2011
2011
Streamline is a stream-based OS communication subsystem that spans from peripheral hardware to userspace processes. It improves… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The use of virtualization is progressively accommodating diverse and unpredictable workloads as being adopted in virtual desktop… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2009
2009
FPGA-based computation engines have been used as Cellular Automata accelerators in the scientific community for some time now… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
Clusters of workstations represent today a satisfactory alternative to MPPs and supercomputers in many areas of application. The… (More)
  • figure 3
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper examines the implications of gang scheduling for generalpurpose multiprocessors. The workloads in these environments… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Scientific applications often manipulate very large sets of persistent data. Over the past decade, advances in disk storage… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?