Staff View
Federated DAFS: scalable cluster-based direct access file servers

Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
1 online resource (10 pages) : illustrations
Note (type = special display note)
Technical report DCS-TR-516
Name (type = corporate); (authority = RutgersOrg-School)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (type = corporate); (authority = RutgersOrg-Department)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
Federated DAFS: scalable cluster-based direct access file servers
Abstract (type = abstract)
Protocols like the Direct Access File System (DAFS) leverage user-level memory-mapped communication to enable low overhead access to network-attached storage for applications. DAFS offers significant improvement in application performance using features like direct data transfer and RDMA. Our goal is to build high performance network file servers using DAFS. The benefits of the DAFS protocol can be extended to cluster-based servers, using low overhead user-level communication within the cluster. In this paper, we present Federated DAFS, a scalable and efficient cluster-based direct access file server. Federated DAFS combines an efficient user-space DAFS implementation with a low overhead clustering layer to present a scalable clustering solution for DAFS servers. Federated DAFS uses a portable mechanism for distribution and handling of client requests across the servers in the cluster. Federated DAFS also minimizes the intra-cluster communication by caching data blocks and by matching the file placement on the servers with the distribution of requests from the clients. Our results show that reasonable speedups(2.6 on four nodes and 4.5 on eight nodes) can be achieved using Federated DAFS on server clusters of up to eight nodes.
Name (type = personal)
NamePart (type = family)
Rangarajan
NamePart (type = given)
Murali
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (type = text); (authority = marcrt)
author
Name (type = personal)
NamePart (type = family)
Gopalakrishnan
NamePart (type = given)
Suresh
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (type = text); (authority = marcrt)
author
Name (type = personal)
NamePart (type = family)
Arumugam
NamePart (type = given)
Ashok
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (type = text); (authority = marcrt)
author
Name (type = personal)
NamePart (type = family)
Sarker
NamePart (type = given)
Rabita
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (type = text); (authority = marcrt)
author
Name (type = personal)
NamePart (type = family)
Iftode
NamePart (type = given)
Liviu
Affiliation
University of Maryland, College Park
Role
RoleTerm (type = text); (authority = marcrt)
author
OriginInfo
DateCreated (encoding = w3cdtf); (qualifier = approximate); (keyDate = yes)
2003
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/t3-ny1h-az05
Back to the top

Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
Document
CreatingApplication
Version
1.4
ApplicationName
GPL Ghostscript 9.07
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:32:27
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:32:27
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2020