Ple nodes wring to the same le result in concurrent

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: are allow to write from their current write offsets without further token conflicts •  When mul.ple nodes are to non ­overlapping sec.ons of the same file? –  Node A will relinquish only part of its byte ­range token –  Each node will be able to acquire the necessary token with a single token exchange as part of its first write opera.on CS480 Principles of Data Management Spring 2013 Negotiating byte-range token (4/4) •  Specifying the required range passed during the token nego.a.on: –  The offset –  Length of the write() system call currently being processed –  Desired range •  For future accesses •  For access, it will be from the current write offset to infinity •  Token server revokes byte ranges only from nodes that conflict with the required range CS480 Principles of Data Management Spring 2013 Optimizing coarse-grain sharing •  Sharing happens in a large regions of the file •  GPFS predicts the region of the file being accessed by a par.cular node in the near future –  When the access paHern is predictable • access •  Reverse access •  Forward/backword strides access paHern –  Grants as large a sub ­range of the desired range as possible without with ranges s.ll held by other nodes CS480 Principles of Data Management Spring 2013 Optimizing fine-grain sharing (1/4) •  GPFS supports fine ­grain sharing •  Each node writes to mul.ple, smaller regions in a block •  Byte ­range tokens guarantee POSIX seman.cs and synchronized I/O to the data block of file –  Smallest unit of I/O is one sector •  Byte ­range token granularity can be no smaller than one sector –  Mul.ple nodes in the sam...
View Full Document

This note was uploaded on 02/11/2014 for the course CS 480 taught by Professor Staff during the Spring '08 term at Colorado State.

Ask a homework question - tutors are online