Fragmentation

calender iconUpdated on October 05, 2023
business
business essentials

Table of Contentstable of content icon

Fragmentation

Fragmentation is a phenomenon that occurs when a data structure is divided into smaller fragments, which are not contiguous in memory. This can lead to a number of problems, including:

1. Inefficient memory usage: Fragmentation can cause the system to use more memory than is necessary for the data structure, as the fragments are not contiguous.2. Performance degradation: Fragmentation can cause performance degradation, as the system may have to spend extra time traversing the fragments.3. Cache misses: Fragmentation can cause cache misses, as the fragments may not be able to fit into the cache.4. Increased memory overhead: Fragmentation can increase the memory overhead, as the fragments may require extra data structures to keep track of their location.

Causes of Fragmentation:

  • Dynamic allocation: When data is dynamically allocated, it can often lead to fragmentation, as the fragments are not necessarily contiguous in memory.
  • Pointer-based data structures: Pointer-based data structures, such as linked lists, can easily lead to fragmentation, as the fragments are linked together through pointers.
  • Compacted data structures: Data structures that are compacted in memory, such as arrays, can also lead to fragmentation, as the fragments may not be contiguous.

Solutions to Fragmentation:

  • Buddy systems: Buddy systems allocate blocks of memory in multiples of a certain size, which can help to reduce fragmentation.
  • Linked lists with compaction: Linked lists with compaction techniques can help to reduce fragmentation by rearranging the list to make the fragments contiguous.
  • Tree reorganization: Tree reorganization techniques can help to reduce fragmentation by rearranging the tree structure to make the fragments contiguous.

Prevention:

  • Use data structures that minimize fragmentation: There are a number of data structures that are designed to minimize fragmentation, such as linked lists with compaction and tree reorganization techniques.
  • Allocate data structures in contiguous blocks: If possible, allocate data structures in contiguous blocks of memory to reduce fragmentation.
  • Minimize dynamic allocation: Avoid dynamic allocation whenever possible, as this can help to reduce fragmentation.

Categories

Pocketful Fintech Capital Private Limited (CIN U65999DL2021PTC390548):

The SEBI Registration No. allotted to us is INZ000313732.
NSE Member Code: 90326| BSE Member Code: 6808| MCX Member Code: 57120
DP CDSL: 12099800

Compliance Officer : Mr. Randhir Kumar Chaudhari
Tel no: 011- 49022222 / 011-49022277
Email: randhir@pocketful.in

Registered Address/Correspondence Address: C- 3, Ground Floor, Okhla Industrial Area, Phase - 1, New Delhi - 110020

For any complaints, drop us an email atlegal@pocketful.in

Procedure to file a complaint on SEBI SCORES: Register on SCORES portal. Mandatory details for filing complaints on SCORES: Name, PAN, Address, Mobile Number, E-mail ID.

Smart Online Dispute Resolution|Link To Circular|Procedures and Policies|Broker Investor Charter|DP Investor Charter

Benefits: Effective Communication, Speedy redressal of the grievances.

Benefits: Effective Communication, Speedy redressal of the grievances.

Please ensure you carefully read the Risk Disclosure Document as prescribed by SEBI and our Terms of Use and Privacy Policy.
The brand name Pocketful and logo is in process of trademarks registration. The cost-effective brokerage plans make Pocketful a trustworthy and reliable online stock broker. Available on both the web and mobile, it offers unmatched convenience to traders. If you are considering opening......

Read More