Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Naked Object File System (Nofs): A Framework To Expose An Object-Oriented Domain Model As A File System, Joseph P. Kaylor, Konstantin Läufer, George K. Thiruvathukal
Naked Object File System (Nofs): A Framework To Expose An Object-Oriented Domain Model As A File System, Joseph P. Kaylor, Konstantin Läufer, George K. Thiruvathukal
Computer Science: Faculty Publications and Other Works
We present Naked Objects File System (NOFS), a novel framework that allows a developer to expose a domain model as a file system by leveraging the Naked Objects design principle. NOFS allows a developer to construct a file system without having to understand or implement all details related to normal file systems development. In this paper we explore file systems frameworks and object-oriented frameworks in a historical context and present an example domain model using the framework. This paper is based on a fully-functional implementation that is distributed as free/open source software, including virtual machine images to demonstrate and study …
The Hydra Filesystem: A Distrbuted Storage Famework, Benjamin Gonzalez, George K. Thiruvathukal
The Hydra Filesystem: A Distrbuted Storage Famework, Benjamin Gonzalez, George K. Thiruvathukal
Computer Science: Faculty Publications and Other Works
Hydra File System (HFS) is an experimental framework for constructing parallel and distributed filesystems. While parallel and distributed applications requiring scalable and flexible access to storage and retrieval are becoming more commonplace, parallel and distributed filesystems remain difficult to deploy easily and configure for different needs. HFS aims to be different by being true to the tradition of high-performance computing while employing modern design patterns to allow various policies to be configured on a per instance basis (e.g. storage, communication, security, and indexing schemes). We describe a working prototype (available for public download) that has been implemented in the Python …
Scalable Implementations Of Mpi Atomicity For Concurrent Overlapping I/O, Wei-Keng Liao, Alok Choudhary, Kenin Coloma, George K. Thiruvathukal, Lee Ward, Eric Russell, Neil Pundit
Scalable Implementations Of Mpi Atomicity For Concurrent Overlapping I/O, Wei-Keng Liao, Alok Choudhary, Kenin Coloma, George K. Thiruvathukal, Lee Ward, Eric Russell, Neil Pundit
Computer Science: Faculty Publications and Other Works
For concurrent I/O operations, atomicity defines the results in the overlapping file regions simultaneously read/written by requesting processes. Atomicity has been well studied at the file system level, such as POSIX standard. In this paper, we investigate the problems arising from the implementation of MPI atomicity for concurrent overlapping write access and provide a few programming solutions. Since the MPI definition of atomicity differs from the POSIX one, an implementation that simply relies on the POSIX file systems does not guarantee correct MPI semantics. To have a correct implementation of atomic I/O in MPI, we examine the efficiency of three …
The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg
The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
This paper shows that a fat-pyramid of area Theta(A) built from processors of size lg A requires only O(lg^2 A) slowdown in bit-times to simulate any network of area A under very general conditions. Specifically, there is no restriction on processor size (amount of attached memory) or number of processors in the competing network, nor is the assumption of unit wire delay required. This paper also derives upper bounds on the slowdown required by a fat-pyramid to simulate a network of larger area in the case of unit wire delay.