SlideShare uma empresa Scribd logo
1 de 28
Baixar para ler offline
Theoretical
   Assignment 2


    Saúl Gausin
  Ramón González
Page table

A page table is the data structure used by a virtual memory
system in a computer operating system to store the mapping
between virtual addresses and physical addresses. Virtual
addresses are those unique to the accessing process.
TLB

A TLB has a fixed number of slots that contain page table
entries, which map virtual addresses to physical addresses.
The virtual memory is the space seen from a process. This
space is segmented in pages of a prefixed size. The page table ke
track of where the virtual pages are loaded in the physical
memory. The TLB is a cache of the page table.
Translation process

When a virtual address needs to be translated into a physical
address, the TLB is searched first. If a match is found (a TLB
hit), the physical address is returned and memory access can
continue. However, if there is no match (called aTLB miss), the
handler will typically look up the address mapping in the page
table to see whether a mapping exists (a Page Walk). If one
exists, it is written back to the TLB, and the faulting instruction
is restarted.
This is a example about Virtual Memory and
Physical Memory
Virtual Memory

One way of combining RAM with slower storage to give the
system the appearance of having more RAM than is actually
installed.

The disadvantage of Virtual Memory is obvious: the access
time to hard disk is very high.
Pagination/Swaping

Accessed Pages: 1, 2, 1, 3, 4, 1, 2, 3, 4
Available Page Frames: 3
FIFO


The first data to be added to the queue will be the first data to
be removed, then processing proceeds sequentially in the
same order.
FIFO

struct fifo_node
{
                                           As you see this pseudo-code
  struct fifo_node *next;
  value_type value;
};

class fifo
{
  fifo_node *front;
  fifo_node *back;

 fifo_node *dequeue(void)
 {
   fifo_node *tmp = front;
   front = front->next;
   return tmp;
 }

  queue(value)
  {
    fifo_node *tempNode = new fifo_node;
    tempNode->value = value;
    back->next = tempNode;
    back = tempNode;
  }
};
LRU

LRU is an efficient algorithm to find an item that most likely has
not been accessed very recently,given a set of items and a
sequence of access events to the items.
File system - FAT

A normal directory entry contains the short name, file size,
starting cluster, and temporal information. When we're looking
at that information it will be all collected together in the 32 bytes
directory.

Each directory entry points to a starting cluster and to a place in
the FAT where the cluster chain for the rest of the file is
located.
File system - NTFS

In NTFS, you'll still
have a boot sector with
cluster sizes and other
fundamental
information about the
file system

The Bitmap is used to
determine
allocation/unallocation
of clusters.
File system - Ext2/3

The boot record in Linux is called a Superblock. Linux divides
the drive up into block groups and you'll frequently find a copy
of the Superblock at the beginning of these block groups.
Superblocks

The first data structure we
should be concered with is the
Superblock. It is located 1024
bytes from the beginning of
the drive.In the 1024 bytes
before the Superblock
contains the boot code. Its
contents are basic size and
configuration information.
You'll find copies of it at the
beginning of many of the block
groups.
Information in the superblock

● The total number of blocks in the whole file system.
● The number of blocks per block group.
● The number of reserved blocks preceding the first block
  group.
● The total number of inodes in the system.
● Number of inodes per block group.
● Number of sectors per block are all located in the
  Superblock.
i-node

i-nodes have 12 direct
pointers to content blocks.
They will have 1 indirect
pointer, 1 double indirect
pointer, and 1 triple
indirect pointer.
Example of hard disk statistics

                          WD RE Hard Drives
Compare with Rinard's notes

Media Transfer Rate (MB/s): 3.6-5.5   Media Transfer Rate (MB/s): 61
Track-to-track Seek: 1.3 ms           Track-to-track Seek: 2.0 ms
Max Seek: 25 ms                       Max Seek: 21 ms
Rotational Speed: 5,400 rpm           Rotational Speed: 7,200 rpm
Average Latency: 5.6 ms               Average Latency: 4.2 ms
Difference between SATA and ATA

Summary:
1. ATA cables are wider than SATA cables.
2. SATA devices are faster than ATA devices with gains
ranging from 12% to 350%.
3. Two devices per ATA cable, only one on SATA.
4. ATA drives are prone to jumper mix-ups.
5. SATA drives can be hot-swapped while ATA devices cannot.
6. SATA has an external implementation called eSATA which
ATA doesn’t have.
Difference between SATA and ATA

ATA cables have connectors at each end and another one in the middle that allows up to two
devices to be connected at the same time. SATA or Serial ATA is the newer interfacing standard
that is meant to replace ATA. It can be easily recognized with its much narrower cable that only
allows one device to be attached per cable.

ATA is a relatively old technology that has gone over a few changes before arriving to its current
state. The latest IDE devices and controllers can theoretically achieve up to 133MB/s data
transfer, the actual speed can be lower; even more so when two devices attached to a single are
used at the same time since only one device can transmit data at a time. Having two hard drives
on a single connector could also cause problems when the jumpers that identify the master and
the slave are mixed up. This problem doesn’t occur in SATA drives since there is only one drive
attached to every connector.

The SATA interface was meant as an improvement over the older ATA interface. Although SATAs
initial speed of 150MB/s isn’t much of an improvement, later versions that could achieve up to
300MB/s and 600MB/s makes the speed advantage totally undeniable. SATA drives are also hot-
swappable, meaning you can remove and attach drives while the OS is running, which is not
possible with the older ATA drives. This capability developed into eSATA which is an external
implementation of SATA drives much like in USB drives. A minor advantage, though still worth
mentioning, is that the inherent smallness of SATA cables makes it easier to clean up the cables
inside the computer. This isn’t only good in an aesthetic point of view but it also creates lesser
blockages to air circulation that cools the system.
RAID disk

Acronym for Redundant Array of Independent Disks, is a
storage technology that provides increased reliability and
functions through redundancy. This is achieved by combining
multiple disk drive components into a logical unit, where data is
distributed across the drives in one of several ways called
"RAID levels".

RAID is now used as an umbrella term for computer data
storage schemes that can divide and replicate data among
multiple physical drives.
The physical drives are said to be in a RAID, which is accessed by the
operating system as one single drive. The different schemes or
architectures are named by the word RAID followed by a number.

Each scheme provides a different balance between two key goals:
Increase data reliability and Increase input/output performance.

RAID 0 - Has no redundancy. Improved performance and additional
storage.

RAID 1 - Data is written identically to multiple drives. Increased read
performance, and only a minimal write performance reduction.
FAT and NTFS

FAT highs:
 ● The effective work requires few of RAM.
 ● Fast work with small and average directories.
 ● The disc implements less movements of the heads.
 ● The effective work on slow discs.
FAT lows:
 ● Quick performance decrease with the fragmentation going up (only
   for FAT32).
 ● Difficulty in access to big files (more than 10% of the disc space).
 ● Very slow work with directories containing huge amount of files.
FAT and NTFS

NTFS highs:
 ● Fragmentation does not influence the system performance.
 ● Complicity of the structure of directories and the number of files do
   not affect the performance.
 ● Quick access to the required file fragment.
 ● Very quick access to small files.
NTFS lows:
 ● The memory size mustn't be less than 64 MBytes.
 ● Slow discs and controllers without Bus Mastering slows the system
   performance down tremendously.
 ● The work with average-size directories is quite difficult, since they
   are fragmented.
 ● The disc working for a long time with 80% - 90% of its space
   occupied shows low performance.
Reference links

Virtual Memory:
http://es.scribd.com/doc/36258183/73/Escenario-de-
rendimiento-del-peor-caso
NTFS Vs. FAT:
http://ixbtlabs.com/articles/ntfs/index3.html
RAID:
http://en.wikipedia.org/wiki/RAID
Hard disk statistics:
http://wdc.com/en/products/legacy/Legacy.asp?r=8
Others:
http://thinkdifferent.typepad.com/edulog/computer_forensics_i/
http://en.wikipedia.org/wiki/Page_table
http://es.wikipedia.org/wiki/Translation_Lookaside_Buffer

Mais conteúdo relacionado

Mais procurados

Fat 32 file system
Fat 32 file systemFat 32 file system
Fat 32 file systemkeshav546
 
Resilient file system
Resilient file systemResilient file system
Resilient file systemAyush Gupta
 
Control dataset partitioning and cache to optimize performances in Spark
Control dataset partitioning and cache to optimize performances in SparkControl dataset partitioning and cache to optimize performances in Spark
Control dataset partitioning and cache to optimize performances in SparkChristophePraud2
 
Free Space Management, Efficiency & Performance, Recovery and NFS
Free Space Management, Efficiency & Performance, Recovery and NFSFree Space Management, Efficiency & Performance, Recovery and NFS
Free Space Management, Efficiency & Performance, Recovery and NFSUnited International University
 
Mass Storage Structure
Mass Storage StructureMass Storage Structure
Mass Storage StructureVimalanathan D
 
Linux and windows file system
Linux and windows  file systemLinux and windows  file system
Linux and windows file systemlin yucheng
 
Fat File Systems
Fat File SystemsFat File Systems
Fat File SystemsArthyR3
 
Introduction to Flume
Introduction to FlumeIntroduction to Flume
Introduction to FlumeRupak Roy
 
Windows
WindowsWindows
WindowsEzzah
 
Snapshot in Hadoop Distributed File System
Snapshot in Hadoop Distributed File SystemSnapshot in Hadoop Distributed File System
Snapshot in Hadoop Distributed File SystemBhavesh Padharia
 
11. Storage and File Structure in DBMS
11. Storage and File Structure in DBMS11. Storage and File Structure in DBMS
11. Storage and File Structure in DBMSkoolkampus
 
11.file system implementation
11.file system implementation11.file system implementation
11.file system implementationSenthil Kanth
 

Mais procurados (20)

Fat 32 file system
Fat 32 file systemFat 32 file system
Fat 32 file system
 
Resilient file system
Resilient file systemResilient file system
Resilient file system
 
Control dataset partitioning and cache to optimize performances in Spark
Control dataset partitioning and cache to optimize performances in SparkControl dataset partitioning and cache to optimize performances in Spark
Control dataset partitioning and cache to optimize performances in Spark
 
Free Space Management, Efficiency & Performance, Recovery and NFS
Free Space Management, Efficiency & Performance, Recovery and NFSFree Space Management, Efficiency & Performance, Recovery and NFS
Free Space Management, Efficiency & Performance, Recovery and NFS
 
Mass Storage Structure
Mass Storage StructureMass Storage Structure
Mass Storage Structure
 
Linux and windows file system
Linux and windows  file systemLinux and windows  file system
Linux and windows file system
 
Fat File Systems
Fat File SystemsFat File Systems
Fat File Systems
 
Ppt
PptPpt
Ppt
 
Introduction to Flume
Introduction to FlumeIntroduction to Flume
Introduction to Flume
 
Windows
WindowsWindows
Windows
 
Snapshot in Hadoop Distributed File System
Snapshot in Hadoop Distributed File SystemSnapshot in Hadoop Distributed File System
Snapshot in Hadoop Distributed File System
 
04 cache memory
04 cache memory04 cache memory
04 cache memory
 
11. Storage and File Structure in DBMS
11. Storage and File Structure in DBMS11. Storage and File Structure in DBMS
11. Storage and File Structure in DBMS
 
File organisation
File organisationFile organisation
File organisation
 
11.file system implementation
11.file system implementation11.file system implementation
11.file system implementation
 
File System Implementation
File System ImplementationFile System Implementation
File System Implementation
 
Ch11
Ch11Ch11
Ch11
 
04 cache memory
04 cache memory04 cache memory
04 cache memory
 
DBMS
DBMSDBMS
DBMS
 
File Systems
File SystemsFile Systems
File Systems
 

Destaque

Front Page Step By Step Course
Front Page Step By Step CourseFront Page Step By Step Course
Front Page Step By Step Courseu058688
 
basic tutorial for frontpage 2003
basic tutorial for frontpage 2003basic tutorial for frontpage 2003
basic tutorial for frontpage 2003israeljumbo
 
Introduction, features and environment of ms front page 2003
Introduction, features and environment of ms front page 2003Introduction, features and environment of ms front page 2003
Introduction, features and environment of ms front page 2003Ann Alcid
 
Front Page Ppt
Front Page PptFront Page Ppt
Front Page PptJeff Flynn
 
Powerpoint: "How to make the first page"
Powerpoint: "How to make the first page"Powerpoint: "How to make the first page"
Powerpoint: "How to make the first page"parrpakala
 
Touchpoint Dashboard Journey Mapping Guide 2014
Touchpoint Dashboard Journey Mapping Guide 2014Touchpoint Dashboard Journey Mapping Guide 2014
Touchpoint Dashboard Journey Mapping Guide 2014Touchpoint Dashboard
 

Destaque (8)

Front Page Step By Step Course
Front Page Step By Step CourseFront Page Step By Step Course
Front Page Step By Step Course
 
MS frontpage 2003
MS frontpage 2003MS frontpage 2003
MS frontpage 2003
 
basic tutorial for frontpage 2003
basic tutorial for frontpage 2003basic tutorial for frontpage 2003
basic tutorial for frontpage 2003
 
Introduction, features and environment of ms front page 2003
Introduction, features and environment of ms front page 2003Introduction, features and environment of ms front page 2003
Introduction, features and environment of ms front page 2003
 
Front Page Ppt
Front Page PptFront Page Ppt
Front Page Ppt
 
Microsoft FrontPage PPT
Microsoft FrontPage PPTMicrosoft FrontPage PPT
Microsoft FrontPage PPT
 
Powerpoint: "How to make the first page"
Powerpoint: "How to make the first page"Powerpoint: "How to make the first page"
Powerpoint: "How to make the first page"
 
Touchpoint Dashboard Journey Mapping Guide 2014
Touchpoint Dashboard Journey Mapping Guide 2014Touchpoint Dashboard Journey Mapping Guide 2014
Touchpoint Dashboard Journey Mapping Guide 2014
 

Semelhante a Exploring Virtual Memory, Disk Storage, and File Systems

CS 542 Putting it all together -- Storage Management
CS 542 Putting it all together -- Storage ManagementCS 542 Putting it all together -- Storage Management
CS 542 Putting it all together -- Storage ManagementJ Singh
 
Designing Information Structures For Performance And Reliability
Designing Information Structures For Performance And ReliabilityDesigning Information Structures For Performance And Reliability
Designing Information Structures For Performance And Reliabilitybryanrandol
 
Tuning Solr and its Pipeline for Logs: Presented by Rafał Kuć & Radu Gheorghe...
Tuning Solr and its Pipeline for Logs: Presented by Rafał Kuć & Radu Gheorghe...Tuning Solr and its Pipeline for Logs: Presented by Rafał Kuć & Radu Gheorghe...
Tuning Solr and its Pipeline for Logs: Presented by Rafał Kuć & Radu Gheorghe...Lucidworks
 
data stage-material
data stage-materialdata stage-material
data stage-materialRajesh Kv
 
Big data interview questions and answers
Big data interview questions and answersBig data interview questions and answers
Big data interview questions and answersKalyan Hadoop
 
I/O System and Case study
I/O System and Case studyI/O System and Case study
I/O System and Case studyLavanya G
 
Chapter 9: SCSI Drives and File Systems
Chapter 9: SCSI Drives and File SystemsChapter 9: SCSI Drives and File Systems
Chapter 9: SCSI Drives and File Systemsaskme
 
Introduction to Memoria
Introduction to MemoriaIntroduction to Memoria
Introduction to MemoriaVictor Smirnov
 

Semelhante a Exploring Virtual Memory, Disk Storage, and File Systems (20)

Nachos 2
Nachos 2Nachos 2
Nachos 2
 
Nachos 2
Nachos 2Nachos 2
Nachos 2
 
Vmfs
VmfsVmfs
Vmfs
 
Nachos Extra Points
Nachos Extra PointsNachos Extra Points
Nachos Extra Points
 
os
osos
os
 
Thiru
ThiruThiru
Thiru
 
UNIT III.pptx
UNIT III.pptxUNIT III.pptx
UNIT III.pptx
 
CS 542 Putting it all together -- Storage Management
CS 542 Putting it all together -- Storage ManagementCS 542 Putting it all together -- Storage Management
CS 542 Putting it all together -- Storage Management
 
Designing Information Structures For Performance And Reliability
Designing Information Structures For Performance And ReliabilityDesigning Information Structures For Performance And Reliability
Designing Information Structures For Performance And Reliability
 
Tuning Solr & Pipeline for Logs
Tuning Solr & Pipeline for LogsTuning Solr & Pipeline for Logs
Tuning Solr & Pipeline for Logs
 
Tuning Solr and its Pipeline for Logs: Presented by Rafał Kuć & Radu Gheorghe...
Tuning Solr and its Pipeline for Logs: Presented by Rafał Kuć & Radu Gheorghe...Tuning Solr and its Pipeline for Logs: Presented by Rafał Kuć & Radu Gheorghe...
Tuning Solr and its Pipeline for Logs: Presented by Rafał Kuć & Radu Gheorghe...
 
data stage-material
data stage-materialdata stage-material
data stage-material
 
Big data interview questions and answers
Big data interview questions and answersBig data interview questions and answers
Big data interview questions and answers
 
Chapter 3
Chapter 3Chapter 3
Chapter 3
 
I/O System and Case study
I/O System and Case studyI/O System and Case study
I/O System and Case study
 
Chapter 9: SCSI Drives and File Systems
Chapter 9: SCSI Drives and File SystemsChapter 9: SCSI Drives and File Systems
Chapter 9: SCSI Drives and File Systems
 
Hard disk PPT
Hard disk PPTHard disk PPT
Hard disk PPT
 
Introduction to Memoria
Introduction to MemoriaIntroduction to Memoria
Introduction to Memoria
 
Mass storage systemsos
Mass storage systemsosMass storage systemsos
Mass storage systemsos
 
Memory Mapping Cache
Memory Mapping CacheMemory Mapping Cache
Memory Mapping Cache
 

Mais de Esteban Gonzalez

Mais de Esteban Gonzalez (10)

Proyecto Fase 4 - PSA
Proyecto Fase 4 - PSAProyecto Fase 4 - PSA
Proyecto Fase 4 - PSA
 
Proyecto Fase 3 - PSA
Proyecto Fase 3 - PSAProyecto Fase 3 - PSA
Proyecto Fase 3 - PSA
 
Assignment 2 Practical
Assignment 2 PracticalAssignment 2 Practical
Assignment 2 Practical
 
Proyecto Fase 1 - PSA
Proyecto Fase 1 - PSAProyecto Fase 1 - PSA
Proyecto Fase 1 - PSA
 
Problema de las 8 reinas
Problema de las 8 reinasProblema de las 8 reinas
Problema de las 8 reinas
 
Demostración final
Demostración finalDemostración final
Demostración final
 
Presentación final
Presentación finalPresentación final
Presentación final
 
Proyecto de Física Moderna
Proyecto de Física ModernaProyecto de Física Moderna
Proyecto de Física Moderna
 
Especificación técnica
Especificación técnicaEspecificación técnica
Especificación técnica
 
Presentación de proyecto
Presentación de proyectoPresentación de proyecto
Presentación de proyecto
 

Último

How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.Curtis Poe
 
SAP Build Work Zone - Overview L2-L3.pptx
SAP Build Work Zone - Overview L2-L3.pptxSAP Build Work Zone - Overview L2-L3.pptx
SAP Build Work Zone - Overview L2-L3.pptxNavinnSomaal
 
The State of Passkeys with FIDO Alliance.pptx
The State of Passkeys with FIDO Alliance.pptxThe State of Passkeys with FIDO Alliance.pptx
The State of Passkeys with FIDO Alliance.pptxLoriGlavin3
 
A Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptxA Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptxLoriGlavin3
 
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxDigital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxLoriGlavin3
 
"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii Soldatenko"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii SoldatenkoFwdays
 
TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc
 
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptx
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptxUse of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptx
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptxLoriGlavin3
 
Unraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfUnraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfAlex Barbosa Coqueiro
 
How to write a Business Continuity Plan
How to write a Business Continuity PlanHow to write a Business Continuity Plan
How to write a Business Continuity PlanDatabarracks
 
Connect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationConnect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationSlibray Presentation
 
Dev Dives: Streamline document processing with UiPath Studio Web
Dev Dives: Streamline document processing with UiPath Studio WebDev Dives: Streamline document processing with UiPath Studio Web
Dev Dives: Streamline document processing with UiPath Studio WebUiPathCommunity
 
Gen AI in Business - Global Trends Report 2024.pdf
Gen AI in Business - Global Trends Report 2024.pdfGen AI in Business - Global Trends Report 2024.pdf
Gen AI in Business - Global Trends Report 2024.pdfAddepto
 
WordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your BrandWordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your Brandgvaughan
 
TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024Lonnie McRorey
 
Hyperautomation and AI/ML: A Strategy for Digital Transformation Success.pdf
Hyperautomation and AI/ML: A Strategy for Digital Transformation Success.pdfHyperautomation and AI/ML: A Strategy for Digital Transformation Success.pdf
Hyperautomation and AI/ML: A Strategy for Digital Transformation Success.pdfPrecisely
 
"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr Bagan"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr BaganFwdays
 
New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024
New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024
New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024BookNet Canada
 
Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!Commit University
 
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxPasskey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxLoriGlavin3
 

Último (20)

How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.
 
SAP Build Work Zone - Overview L2-L3.pptx
SAP Build Work Zone - Overview L2-L3.pptxSAP Build Work Zone - Overview L2-L3.pptx
SAP Build Work Zone - Overview L2-L3.pptx
 
The State of Passkeys with FIDO Alliance.pptx
The State of Passkeys with FIDO Alliance.pptxThe State of Passkeys with FIDO Alliance.pptx
The State of Passkeys with FIDO Alliance.pptx
 
A Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptxA Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptx
 
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxDigital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
 
"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii Soldatenko"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii Soldatenko
 
TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
 
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptx
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptxUse of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptx
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptx
 
Unraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfUnraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdf
 
How to write a Business Continuity Plan
How to write a Business Continuity PlanHow to write a Business Continuity Plan
How to write a Business Continuity Plan
 
Connect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationConnect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck Presentation
 
Dev Dives: Streamline document processing with UiPath Studio Web
Dev Dives: Streamline document processing with UiPath Studio WebDev Dives: Streamline document processing with UiPath Studio Web
Dev Dives: Streamline document processing with UiPath Studio Web
 
Gen AI in Business - Global Trends Report 2024.pdf
Gen AI in Business - Global Trends Report 2024.pdfGen AI in Business - Global Trends Report 2024.pdf
Gen AI in Business - Global Trends Report 2024.pdf
 
WordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your BrandWordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your Brand
 
TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024
 
Hyperautomation and AI/ML: A Strategy for Digital Transformation Success.pdf
Hyperautomation and AI/ML: A Strategy for Digital Transformation Success.pdfHyperautomation and AI/ML: A Strategy for Digital Transformation Success.pdf
Hyperautomation and AI/ML: A Strategy for Digital Transformation Success.pdf
 
"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr Bagan"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr Bagan
 
New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024
New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024
New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024
 
Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!
 
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxPasskey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
 

Exploring Virtual Memory, Disk Storage, and File Systems

  • 1. Theoretical Assignment 2 Saúl Gausin Ramón González
  • 2. Page table A page table is the data structure used by a virtual memory system in a computer operating system to store the mapping between virtual addresses and physical addresses. Virtual addresses are those unique to the accessing process.
  • 3. TLB A TLB has a fixed number of slots that contain page table entries, which map virtual addresses to physical addresses. The virtual memory is the space seen from a process. This space is segmented in pages of a prefixed size. The page table ke track of where the virtual pages are loaded in the physical memory. The TLB is a cache of the page table.
  • 4. Translation process When a virtual address needs to be translated into a physical address, the TLB is searched first. If a match is found (a TLB hit), the physical address is returned and memory access can continue. However, if there is no match (called aTLB miss), the handler will typically look up the address mapping in the page table to see whether a mapping exists (a Page Walk). If one exists, it is written back to the TLB, and the faulting instruction is restarted.
  • 5.
  • 6. This is a example about Virtual Memory and Physical Memory
  • 7. Virtual Memory One way of combining RAM with slower storage to give the system the appearance of having more RAM than is actually installed. The disadvantage of Virtual Memory is obvious: the access time to hard disk is very high.
  • 8. Pagination/Swaping Accessed Pages: 1, 2, 1, 3, 4, 1, 2, 3, 4 Available Page Frames: 3
  • 9. FIFO The first data to be added to the queue will be the first data to be removed, then processing proceeds sequentially in the same order.
  • 10. FIFO struct fifo_node { As you see this pseudo-code struct fifo_node *next; value_type value; }; class fifo { fifo_node *front; fifo_node *back; fifo_node *dequeue(void) { fifo_node *tmp = front; front = front->next; return tmp; } queue(value) { fifo_node *tempNode = new fifo_node; tempNode->value = value; back->next = tempNode; back = tempNode; } };
  • 11. LRU LRU is an efficient algorithm to find an item that most likely has not been accessed very recently,given a set of items and a sequence of access events to the items.
  • 12. File system - FAT A normal directory entry contains the short name, file size, starting cluster, and temporal information. When we're looking at that information it will be all collected together in the 32 bytes directory. Each directory entry points to a starting cluster and to a place in the FAT where the cluster chain for the rest of the file is located.
  • 13. File system - NTFS In NTFS, you'll still have a boot sector with cluster sizes and other fundamental information about the file system The Bitmap is used to determine allocation/unallocation of clusters.
  • 14. File system - Ext2/3 The boot record in Linux is called a Superblock. Linux divides the drive up into block groups and you'll frequently find a copy of the Superblock at the beginning of these block groups.
  • 15. Superblocks The first data structure we should be concered with is the Superblock. It is located 1024 bytes from the beginning of the drive.In the 1024 bytes before the Superblock contains the boot code. Its contents are basic size and configuration information. You'll find copies of it at the beginning of many of the block groups.
  • 16. Information in the superblock ● The total number of blocks in the whole file system. ● The number of blocks per block group. ● The number of reserved blocks preceding the first block group. ● The total number of inodes in the system. ● Number of inodes per block group. ● Number of sectors per block are all located in the Superblock.
  • 17. i-node i-nodes have 12 direct pointers to content blocks. They will have 1 indirect pointer, 1 double indirect pointer, and 1 triple indirect pointer.
  • 18. Example of hard disk statistics WD RE Hard Drives
  • 19. Compare with Rinard's notes Media Transfer Rate (MB/s): 3.6-5.5 Media Transfer Rate (MB/s): 61 Track-to-track Seek: 1.3 ms Track-to-track Seek: 2.0 ms Max Seek: 25 ms Max Seek: 21 ms Rotational Speed: 5,400 rpm Rotational Speed: 7,200 rpm Average Latency: 5.6 ms Average Latency: 4.2 ms
  • 20. Difference between SATA and ATA Summary: 1. ATA cables are wider than SATA cables. 2. SATA devices are faster than ATA devices with gains ranging from 12% to 350%. 3. Two devices per ATA cable, only one on SATA. 4. ATA drives are prone to jumper mix-ups. 5. SATA drives can be hot-swapped while ATA devices cannot. 6. SATA has an external implementation called eSATA which ATA doesn’t have.
  • 21. Difference between SATA and ATA ATA cables have connectors at each end and another one in the middle that allows up to two devices to be connected at the same time. SATA or Serial ATA is the newer interfacing standard that is meant to replace ATA. It can be easily recognized with its much narrower cable that only allows one device to be attached per cable. ATA is a relatively old technology that has gone over a few changes before arriving to its current state. The latest IDE devices and controllers can theoretically achieve up to 133MB/s data transfer, the actual speed can be lower; even more so when two devices attached to a single are used at the same time since only one device can transmit data at a time. Having two hard drives on a single connector could also cause problems when the jumpers that identify the master and the slave are mixed up. This problem doesn’t occur in SATA drives since there is only one drive attached to every connector. The SATA interface was meant as an improvement over the older ATA interface. Although SATAs initial speed of 150MB/s isn’t much of an improvement, later versions that could achieve up to 300MB/s and 600MB/s makes the speed advantage totally undeniable. SATA drives are also hot- swappable, meaning you can remove and attach drives while the OS is running, which is not possible with the older ATA drives. This capability developed into eSATA which is an external implementation of SATA drives much like in USB drives. A minor advantage, though still worth mentioning, is that the inherent smallness of SATA cables makes it easier to clean up the cables inside the computer. This isn’t only good in an aesthetic point of view but it also creates lesser blockages to air circulation that cools the system.
  • 22.
  • 23. RAID disk Acronym for Redundant Array of Independent Disks, is a storage technology that provides increased reliability and functions through redundancy. This is achieved by combining multiple disk drive components into a logical unit, where data is distributed across the drives in one of several ways called "RAID levels". RAID is now used as an umbrella term for computer data storage schemes that can divide and replicate data among multiple physical drives.
  • 24. The physical drives are said to be in a RAID, which is accessed by the operating system as one single drive. The different schemes or architectures are named by the word RAID followed by a number. Each scheme provides a different balance between two key goals: Increase data reliability and Increase input/output performance. RAID 0 - Has no redundancy. Improved performance and additional storage. RAID 1 - Data is written identically to multiple drives. Increased read performance, and only a minimal write performance reduction.
  • 25.
  • 26. FAT and NTFS FAT highs: ● The effective work requires few of RAM. ● Fast work with small and average directories. ● The disc implements less movements of the heads. ● The effective work on slow discs. FAT lows: ● Quick performance decrease with the fragmentation going up (only for FAT32). ● Difficulty in access to big files (more than 10% of the disc space). ● Very slow work with directories containing huge amount of files.
  • 27. FAT and NTFS NTFS highs: ● Fragmentation does not influence the system performance. ● Complicity of the structure of directories and the number of files do not affect the performance. ● Quick access to the required file fragment. ● Very quick access to small files. NTFS lows: ● The memory size mustn't be less than 64 MBytes. ● Slow discs and controllers without Bus Mastering slows the system performance down tremendously. ● The work with average-size directories is quite difficult, since they are fragmented. ● The disc working for a long time with 80% - 90% of its space occupied shows low performance.
  • 28. Reference links Virtual Memory: http://es.scribd.com/doc/36258183/73/Escenario-de- rendimiento-del-peor-caso NTFS Vs. FAT: http://ixbtlabs.com/articles/ntfs/index3.html RAID: http://en.wikipedia.org/wiki/RAID Hard disk statistics: http://wdc.com/en/products/legacy/Legacy.asp?r=8 Others: http://thinkdifferent.typepad.com/edulog/computer_forensics_i/ http://en.wikipedia.org/wiki/Page_table http://es.wikipedia.org/wiki/Translation_Lookaside_Buffer