Virginia M. Lo, Associate Professor

At work:

TEL: (541) 346-4473

FAX: (541) 346-5373

EMAIL: lo@cs.uoregon.edu

Department of Computer and Information Science

University of Oregon, Eugene, OR 97403

Teaching

Research Interests:

Recent Papers

Peer-to-peer Computing

• Cluster Computing on the Fly: This work involves the development of a P2P architecture to support Internet-wide cycle sharing communities. Our emphasis is on application-specific scheduling under a P2P cycle sharing model. Please go to the CCOF website for .pdf of all the papers.
  
  
  • Dayi Zhou and Virginia Lo, WaveGrid: A Scalable Fast-turnaround Heterogeneous Peer-based Desktop Grid System", to appear IEEE International Parallel and Distributed Processing Symposium (IPDPS'06).
  • Virginia Lo, Dayi Zhou, Yuhong Liu, Chris GauthierDickey and Jun Li, The Leader Selection Problem in Peer-to-Peer Overlay Networks, Second International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P'05).
  • Shanyu Zhao and Virginia Lo, Result Verification and Trust-based Scheduling in Open Peer-to-Peer Cycle Sharing Systems, IEEE Fifth International Conference on Peer-to-Peer Systems, 2005.
  • Dayi Zhou and Virginia Lo, Wave Scheduling: Scheduling for Faster Turnaround Time in Peer-to-peer Cycle Sharing Systems, in Scheduling Strategies for Parallel Processing 2005 (JSSPP'05).
  • D. Zhou and V. Lo, Cluster Computing on the Fly: Resource Discovery in a Cycle Sharing Peer-to-Peer System, GP2PC Workshop 2004, CCGrid 2004.
  • V. Lo, D. Zhou, D. Zappala, Y. Liu, and S. Zhao, Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet, IPTPS 2004 and in Springer Verlag LNCS 3279, Peer-to-Peer Systems III, Geoffrey M. Voelker and Scott Shenker (Eds.).
  
  
• Massively Multiplayer Games: Cheat-proof, low latency protocols and scalable event-ordering. (Please get .pdf from Chris GauthierDickey Website
  • C. GauthierDickey, V. Lo, D. Zappala, Using N-Trees for Scalable Event Ordering in Peer-to-Peer Games, NOSSDAV, June 2005.
  • C. GauthierDickey, D. Zappala, V. Lo, J. Marr, Low-Latency Cheat-Proof Event Ordering for Peer-to-Peer Games, NOSSDAV, June 2004.
  • C. GauthierDickey, D. Zappala, V. Lo, A Fully Distributed Architecture for Massively Multiplayer Online Games, NetGames, August 2004.

Virtual Topologiees for Multiparty Communications
This work involves the development of efficient fault tolerant protocols for intradomain and interdomain multi-party communication. Research supported by NSF ANI9977524 and by NSF NCR9714680.

D. Zappala, V. Lo, C. GauthierDickey, The Multicast Address Allocation Problem,to appear in Computer Networks Journal, 2004.

D. Zappala, C. GauthierDickey, and V. Lo, Modeling the Multicast Address Allocation Problem, Proceedings IEEE Globecomm 2002.

V. Lo, D. Zappala, C. GauthierDickey, and T. Singer, A Theoretical Framework for the Multicast Address Allocation Problem, Proceedings IEEE Globecomm 2002.

D. Zappala, A. Fabbri, and V. Lo, An Evaluation of Shared Multicast Trees with Multiple Cores, Journal of Telecommunication Systems, March 2002.

M. Livingston, V. Lo, K. Windisch, D. Zappala, Cyclic Block Allocation: A New Scheme for Hierarchical Multicast Address Allocation in the First International Workshop on Networked Group Communication, NGC99 , Nov. 17-20, Pisa, Italy.

Resource Management for Parallel and Distributed Computing Systems.
This work focuses on the scheduling of resources (processors, processes, and I/O) in systems ranging from message-passing multicomputers to loosely-coupled workstation-based distributed systems. We have developed algorithms and software tools for allocation, mapping, placement, scheduling and migration, with extensions to support fault tolerance, heterogeneous environments, and real time constraints. (Research previously supported by NSF MIP91-08528.)

• V. Lo and J. Mache, Job Scheduling for Prime Time vs. Non-Prime Time, Proceedings of the 4th IEEE International Conference on Cluster Computing (CLUSTER 2002).
• J. Mache, V. Lo and S. Garg, Job Scheduling that Minimizes Network Contention due to both Communication and I/O, Proceedings of the 14th International Parallel and Distributed Processing Symposium, IPDPS'00, 2000.
• B. Nitzberg and V. Lo, Collective Buffering: Improving Parallel I/O Performance, in {\em Readings in Disk Arrays and Parallel I/O}, Edited by R. Buyya, H. Jin, and T. Cortes, IEEE Society Press, expected publication date 2001.
• J. Mache, V. Lo and S. Garg, How to Schedule Parallel I/O Intensive Jobs, Proceedings of the 6th Conference on Parallel and Real-Time Systems, PART'99, 1999
• J. Mache, V. Lo and S. Garg, Parallel I/O Traffic Calls for New Job Scheduling Strategies, Proceedings of SC99 - 12th ACM/ IEEE Conference on High-Performance Networking and Computing (refereed poster exhibit), 1999
• J. Mache, V. Lo, M. Livingston and S. Garg, The Impact of Spatial Layout of Jobs on Parallel I/O Performance, Proceedings of the 6th Workshop on I/O in Parallel and Distributed Systems, FCRC'99, 1999
• B. Bose, B. Broeg, V. Lo, Lee Distance, Gray Codes, and the Torus, {\em International Journal of Telecommunication Systems (Special Issue on High Performance Computing and Interconnection Networks)}, Volume 10, 1998.
• V. Lo, J. Mache and K. Windisch, A Comparative Study of Real Workload Traces and Synthetic Workload Models for Parallel Job Scheduling, Proceedings of the 4th Workshop on Job Scheduling Strategies for Parallel Processing, IPPS '98, also published in "Job Scheduling Strategies for Parallel Processing" edited by Dror G. Feitelson and Larry Rudolph, Springer-Verlag LNCS Vol 1459, 1998
• V. M. Lo, W. Liu, B. Nitzberg, K. Windisch, Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers, {\em IEEE Transactions on Parallel and Distributed Systems}, Volume 8, No. 7, July 1997.

Personal Interests