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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A virtualized data center faces important but challenging issue of performance isolation among heterogeneous customer… 
2012
2012
Partial reconfiguration is possible to deliver virtually unlimited hardware resources since it enables dynamic allocation and de… 
2011
2011
Query processing using mostly various NoSQL languages becomes a significant application area for Hadoop. Despite significant work… 
2008
2008
The success of different computing models, performance analysis, and load balancing algorithms depends on the processor… 
2001
2001
Distributed applications executing on clustered environments typically share resources (computers and network links) with other… 
2000
2000
  • C. Anglano
  • 2000
  • Corpus ID: 10100739
Implicit coscheduling strategies enable parallel applications to dynamically share the machines in a network of workstations (NOW… 
1990
1990
External single-input single-output sorts can use multiple processors each with a large tournament replacement-selection in… 
1982
1982
LINGUIST-86 is a commercially-developed translator-writing-system based on attribute grammars [K]. From an input attribute… 
1971
1971
In computer systems in which resources are allocated dynamically, algorithms must be executed whenever resources are assigned to… 
1967
1967
  • A. Reiter
  • 1967
  • Corpus ID: 15273919
Recently a great deal of interest has been evident in on-line information retrieval systems in which the retrieval search…