Chercheurs

Technologie / TORNG, ERIC

torng

Position

Associate Professor, Department of Computer Science and Engineering, College of Engineering, Michigan State University, East Lansing, MI , USA.

Thèmes de recherche

· Online Algorithms
· Scheduling
· Computational Biology
· Multicast Communication

Prix et récompenses

Publications

On-line Algorithms and Scheduling Papers

Existence Theorems, Lower Bounds and Algorithms for Scheduling to Meet Two Objectives
coauthors: April Rasala, Cliff Stein, and Patchrawat Uthaisombut
Accepted for publication in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.

On-line Restricted Caching
coauthors: Mark Brehob, Richard Enbody, and Stephen Wagner
Accepted for publication in Journal of Scheduling.
Preliminary version appeared in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 374-383, 2001.

Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks
coauthors: Bala Kalyanasundaram and Kirk Pruhs
Algorithmica, 28, pages 269-270, 2000.

Generating Adversaries for Request-Answer Games
coauthors: Todd Gormley, Nicholas Reingold, and Jeffery Westbrook
Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 564-565, 2000.

Applying Extra Resource Analysis to Load Balancing
coauthors: Mark Brehob and Patchrawat Uthaisombut
Journal of Scheduling, 3, pages 273-288, 2000.
Preliminary version appeared in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

A tight lower bound for the best-Alpha algorithm
coauthor: Patchrawat Uthaisombut
Information Processing Letters, 71, pages 17-22, 1999.
Preliminary version appeared in ACM-SIAM SODA 1999 as "Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling"

On-line Scheduling with Lookahead: Multipass Assembly Line Machines
coauthors: Rajeev Motwani and Vijay Saraswat
INFORMS Journal on Computing, Volume 10, Number 3, pages 331-340, Summer 1998.

Optimal Time-Critical Scheduling Via Resource Augmentation
coauthors: Cynthia A. Phillips, Cliff Stein, and Joel Wein
Algorithmica, 32, pages 163-200, 2002.
Preliminary version appeared in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), 1997.

The k-client Problem
coauthors: Houman Alborzi, Patchrawat Uthaisombut, and Stephen Wagner
Journal of Algorithms, 41, pages 115-173, 2001.
Preliminary version appeared in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1997.

A Unified Analysis of Paging and Caching
Eric Torng
Algorithmica, Volume 20, pages 175-200, 1998.
Preliminary version appeared in IEEE FOCS 1995.

A Better Algorithm for an Ancient Scheduling Problem
coauthors: David Karger and Steven Phillips
Journal of Algorithms, Volume 20, pages 400-430, 1996.
Preliminary version appeared in ACM-SIAM SODA, 1994.

Non-clairvoyant Scheduling
coauthors: Rajeev Motwani and Steven Phillips
Theoretical Computer Science, Volume 130, pages 17-47, 1994.
Preliminary version appeared in ACM-SIAM SODA, 1993.

Non-omniscient Scheduling
Eric Torng
Stanford University PhD Thesis, July, 1994
Multicast Communication

Source Limited Inclusive Routing: A New Paradigm for Multicast Communication
coauthors: Barbara D. Birchler and Abdol-Hossein Esfahanian
Networks, Volume 35, Number 1, pages 40-55, 2000.

Sufficient Conditions for Optimal Multicast Communication
coauthors: Barbara D. Birchler and Abdol-Hossein Esfahanian
Proceedings of the International Conference on Parallel Processing, pages 390-393, 1997.

Information Dissemination in Restricted Routing Networks
coauthors: Barbara D. Birchler and Abdol-Hossein Esfahanian
Proceedings of the International Symposium on Combinatorics and Applications, pages 33-44, 1996.

Toward a General Theory of Unicast-Based Multicast Communication
coauthors: Barbara Birchler and Abdol-Hossein Esfahanian
Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Volume 1017, pages 237-251, Springer-Verlag, 1995
Other Topics

Inferring Relatedness of a Macromolecule to a Sequence Database Without Sequencing
coauthors: Jin Kim, James R. Cole, and Sakti Pramanik
Proceedings of Intelligent Systems for Molecular Biology, pages 125-133, 1996.

A Novel Fault Tolerance Technique for Recursive Least Squares Minimization
coauthors: Cynthia J. Anfinson and Franklin T. Luk
Journal of VLSI Signal Processing, 1, pages 181-188, 1989
Preliminary version appeared in Advanced Algorithms and Architectures for Signal Processing III, Proceedings SPIE Vol. 975, pages 268-276, 1988
currently not on-line

Fault Tolerance Techniques for Systolic Arrays
coauthor: Franklin T. Luk
Real Time Signal Processing X, Proceedings SPIE Vol. 827, pages 30-36, 1987
currently not on-line