Physical Sciences and Mathematics Commons^™

Filesystems: Addressing The Last-Mile “Problem” In Services-Oriented/Cloud Computing, George K. Thiruvathukal, Joseph P. Kaylor, Konstantin Läufer

Computer Science: Faculty Publications and Other Works

We have designed and implemented RestFS, a software framework that provides a uniform, configurable connector layer for mapping remote web-based resources to local filesystem-based resources, recognizing the similarity between these two types of resources. Such mappings enable programmatic access to a resource, as well as composition of two or more resources, through the local operating system’s standard filesystem application programming interface (API), script-able file-based command-line utilities, and interprocess communication (IPC) mechanisms. The framework supports automatic and manual authentication.

As part of this talk, we demonstrate a new filesystem that interfaces to the SketchFab.com service to support 3D model visualization. For …

Computational Thinking...And Doing, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

Computing in Science and Engineering, From the Editors

At Issue, Bill Feireisen, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

In this installment of At Issue, two of CiSE's editorial board members describe the magazine's current and future Web presence. We start with Bill Feiereisen's discussion of science on the Web and what it could mean for CiSE ("Are We There Yet?") and end with George Thiruvathukal's discussion of the challenges therein ("If We Build It, Will They Come?"). CiSE's official homepage is www.computer.org/cise; we gladly welcome comments with suggestions or feedback. You can contact lead editor (Jenny Stout; jstout@computer.org) or write to either Bill or George (their email addresses appear at the end of their respective essays).

The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows that a fat-pyramid of area Θ(A) requires only O(log A) slowdown to simulate any competing network of area A under very general conditions. The result holds regardless of the processor size (amount of attached memory) and number of processors in the competing networks as long as the limitation on total area is met. Furthermore, the result is valid regardless of the relationship between wire length and wire delay. We especially focus on elimination of the common simplifying assumption that unit time suffices to traverse a wire regardless of its length, since the assumption becomes more and more …

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.