Fragmentation (computing)

Known as: Fragmentation (computer), Internal fragmentation, Fragmentation 
In computer storage, fragmentation is a phenomenon in which storage space is used inefficiently, reducing capacity or performance and often both. The… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1940-2017
010020019402016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Data confidentiality is one of the pressing challenges in the ongoing research in Cloud computing. Hosting confidential business… (More)
  • table 4
  • table 1
  • table 2
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Recently, improving the energy efficiency of HPC machines has become important. As a result, interest in using powerscalable… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
■ Abstract The literature on effects of habitat fragmentation on biodiversity is huge. It is also very diverse, with different… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The power consumption of modern high-performance processors is becoming a major concern because it leads to increased heat… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Traditionally the goal of load management protocols for distributed systems has been to ensure that nodes are equally loaded In… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper proposes new algorithms for protein structure alignment. Protein structure alignment is, given two three-dimensional… (More)
  • table 1
  • figure 3
  • figure 4
  • figure 2
  • figure 1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Internetworks can be built from many different kinds of networks, with varying limits on maximum packet size. Throughput is… (More)
  • figure I
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The processor allocation problem in an n-dimensional hypercube (or an n-cube) multiprocessor is similar to the conventional… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Process scheduling in real-time systems has almost invariably used one or more of three algorithms: fixed priority, FIFO, or… (More)
  • figure 2-1
  • figure 2-2
  • figure 3.1
  • figure 3-3
  • figure 3-4
Is this relevant?