Virginia Mary Lo

Affiliations:
  • University of Oregon, Eugene, USA


According to our database1, Virginia Mary Lo authored at least 39 papers between 1983 and 2010.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2010
Undergraduate computer science education in China.
Proceedings of the 41st ACM technical symposium on Computer science education, 2010

2006
WaveGrid: a scalable fast-turnaround heterogeneous peer-based desktop grid system.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005
The impact of spatial layout of jobs on I/O hotspots in mesh networks.
J. Parallel Distributed Comput., 2005

Result Verification and Trust-Based Scheduling in Peer-to-Peer Grids.
Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (P2P 2005), 31 August, 2005

Using n-trees for scalable event ordering in peer-to-peer games.
Proceedings of the Network and Operating System Support for Digital Audio and Video, 2005

Wave Scheduler: Scheduling for Faster Turnaround Time in Peer-Based Desktop Grid Systems.
Proceedings of the Job Scheduling Strategies for Parallel Processing, 2005

Scalable supernode selection in peer-to-peer overlay networks.
Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems, 2005

2004
The multicast address allocation problem: theory and practice.
Comput. Networks, 2004

Low latency and cheat-proof event ordering for peer-to-peer games.
Proceedings of the Network and Operating System Support for Digital Audio and Video, 2004

A fully distributed architecture for massively multiplayer online games.
Proceedings of the 3rd Workshop on Network and System Support for Games, 2004

Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet.
Proceedings of the Peer-to-Peer Systems III, Third International Workshop, 2004

Cluster Computing on the Fly: resource discovery in a cycle sharing peer-to-peer system.
Proceedings of the 4th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2004), 2004

2002
An Evaluation of Shared Multicast Trees with Multiple Cores.
Telecommun. Syst., 2002

Modeling the multicast address allocation problem.
Proceedings of the Global Telecommunications Conference, 2002

A theoretical framework for the multicast address allocation problem.
Proceedings of the Global Telecommunications Conference, 2002

Job Scheduling for Prime Time vs. Non-Prime Time.
Proceedings of the 2002 IEEE International Conference on Cluster Computing (CLUSTER 2002), 2002

2000
Job Scheduling that Minimizes Network Contention due to both Communication and I/O.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
Cyclic Block Allocation: A New Scheme for Hierarchical Multicast Address Allocation.
Proceedings of the Networked Group Communication, 1999

The Impact of Spatial Layout of Jobs on Parallel I/O Performance.
Proceedings of the Sixth Workshop on I/O in Parallel and Distributed Systems, 1999

1998
Lee distance, Gray codes, and the torus.
Telecommun. Syst., 1998

A Comparative Study of Real Workload Traces and Synthetic Workload Models for Parallel Job Scheduling.
Proceedings of the Job Scheduling Strategies for Parallel Processing, 1998

1997
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers.
IEEE Trans. Parallel Distributed Syst., 1997

Collective Buffering: Improving Parallel I/O Performance.
Proceedings of the 6th International Symposium on High Performance Distributed Computing, 1997

1996
Parallel Divide and Conquer on Meshes.
IEEE Trans. Parallel Distributed Syst., 1996

1995
Contiguous and Non-Contiguous Processor Allocation Algorithms for kappa-cubes.
Proceedings of the 1995 International Conference on Parallel Processing, 1995

1994
Operating Systems Enhancements for Distributed Shared Memory.
Adv. Comput., 1994

Non-contiguous processor allocation algorithms for distributed memory multicomputers.
Proceedings of the Proceedings Supercomputing '94, 1994

1992
Temporal Communication Graphs: Lamport's Process-Time Graphs Augmented for the Purpose of Mapping and Scheduling.
J. Parallel Distributed Comput., 1992

Application-Specific Deadlock Free Wormhole Routing on Multicomputers.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

Parallel Implementation of Divide-and-Conquer Algorithms on Binary de Bruijn Networks.
Proceedings of the 6th International Parallel Processing Symposium, 1992

An Efficient Heuristic for Application-Specific Routing on Mesh Connected Multicomputers.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

1991
OREGAMI: Tools for mapping parallel computations to parallel architectures.
Int. J. Parallel Program., 1991

Distributed Shared Memory: A Survey of Issues and Algorithms.
Computer, 1991

1990
Mapping Divide-and-Conquer Algorithms to Parallel Architectures.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

1988
Heuristic Algorithms for Task Assignment in Distributed Systems.
IEEE Trans. Computers, 1988

Algorithms for Static Task Assignment and Symmetric Contraction in Distributed Computing Systems.
Proceedings of the International Conference on Parallel Processing, 1988

1985
Task Assignment to Minimize Completion Time.
Proceedings of the 5th International Conference on Distributed Computing Systems, 1985

1983
Task Assignment in Distributed Systems
PhD thesis, 1983


  Loading...