A Framework and Toolkit for Understanding User Comfort with Resource Borrowing

Resource borrowing is a common underlying approach in grid computing and thin-client computing. In both cases, external processes borrow resources that would otherwise be delivered to the interactive processes of end-users, creating contention that slows these processes and decreases the comfort of the end-users. How resource borrowing and user comfort are related is not well understood and thus resource borrowing tends to be extremely conservative. To address this lack of understanding, we have developed a sophisticated distributed application for directly measuring user comfort with the borrowing of CPU time, memory space, and disk bandwidth. Using this tool, we have conducted a controlled user study with qualitative and quantitative results that are of direct interest to the designers of grid and thin-client systems. In this report, we describe the system in detail and related implementation issues. We also discuss other factors related to the project and also details of the controlled study. A separate paper documents the results of this controlled study in more detail. Effort sponsored by the National Science Foundation under Grants ANI-0093221, ACI-0112891, ANI-0301108, EIA-0130869, and EIA-0224449. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation (NSF).

[1]  Fred Douglis,et al.  Transparent process migration: Design alternatives and the sprite implementation , 1991, Softw. Pract. Exp..

[2]  Akinori Komatsubara.  Psychological Upper and Lower Limits of System Response Time and User's Preference on Skill Level , 1997, HCI.

[3]  Carson Jonathan Reynolds,et al.  The sensing and measurement of frustration with computers , 2001 .

[4]  DouglisFred,et al.  Transparent process migration , 1991 .

[5]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[6]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[7]  Srinivasan Seshan,et al.  Enabling conferencing applications on the internet using an overlay muilticast architecture , 2001, SIGCOMM '01.

[8]  Srinivasan Seshan,et al.  Enabling conferencing applications on the internet using an overlay muilticast architecture , 2001, SIGCOMM 2001.

[9]  Jonathan T. Klein,et al.  Computer response to user frustration , 1998 .

[10]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[11]  Kyung D. Ryu,et al.  Efficient Network and I/O Throttling for Fine-Grain Cycle Stealing , 2001, ACM/IEEE SC 2001 Conference (SC'01).

[12]  Jeffrey K. Hollingsworth,et al.  Fine-Grain Cycle Stealing for Networks of Workstations , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[13]  Andrew A. Chien,et al.  Entropia: architecture and performance of an enterprise desktop grid system , 2003, J. Parallel Distributed Comput..

[14]  David A. Patterson,et al.  A case for networks of workstations (now) , 1994, Symposium Record Hot Interconnects II.

[15]  Mustaque Ahamad,et al.  Workload modeling for highly interactive applications , 1999, SIGMETRICS '99.

[16]  David P. Anderson,et al.  A new major SETI project based on Project Serendip data and 100 , 1997 .

[17]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[18]  Miron Livny,et al.  The Available Capacity of a Privately Owned Workstation Environmont , 1991, Perform. Evaluation.

[19]  Peter A. Dinda,et al.  The statistical properties of host load , 1999, Sci. Program..

[20]  Justin Dolskeinterhack,et al.  A Brute Force Search of DES KeyspaceMatt Curtin , 1997 .

[21]  David W. Embley,et al.  Behavioral Aspects of Text Editors , 1981, CSUR.

[22]  David E. Culler,et al.  A case for NOW (networks of workstation) , 1995, PODC '95.

[23]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.

[24]  Zheng Wang,et al.  Using latency to evaluate interactive system performance , 1996, OSDI '96.

[25]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[26]  A DindaPeter.  The statistical properties of host load , 1999 .

[27]  Ian T. Foster,et al.  Condor-G: A Computation Management Agent for Multi-Institutional Grids , 2004, Cluster Computing.