Postscript links have been removed for the time being..
Hardcopies of all papers are available by email
request.
Journal Publications (refereed):
- Optimizing Large Data
Transfers in Parity-Declustered Data Layouts. Journal
of Computer and System Sciences, Vol. 81, No 4.,
pp 271-291, June 2015. (with I. M. Sutherland.)
- Efficient Data Mappings
for Parity-Declustered Data Layouts. Theoretical
Computer Science, Vol. 325, No 3., pp. 391-407, October 2004.
(with I. M. Sutherland.)
- Balancing Load versus Decreasing Communication: Parameterizing the Tradeoff.
Journal of Parallel and Distributed Computing, Vol. 61, No. 5, pp.
567-580, May 2001. (with V. E.
Taylor, B. K. Holmer, and M. R. Hribar.)
- Flexible Usage of Redundancy in Disk Arrays. Theory of Computing Systems,
Vol. 32, pp. 561-587, August 1999. (with I. M. Sutherland.)
- Configuration Compression for the Xilinx XC6200 FPGA. IEEE Transactions on
Computer-Aided Design of Integrated Circuits and Systems, Vol. 18, No. 8, pp.
1107-1113, August 1999. (with S. Hauck and Z. Li.)
- Efficient Algorithms for Dynamic Allocation of Distributed Memory. Algorithmica,
Vol 24, pp. 139-171, March 1999. (with F. T. Leighton.)
- Real-Time Emulations of Bounded-Degree Networks. Information Processing
Letters, Vol. 66, No. 5, pp. 269-276, June 1998. (with B. M. Maggs.)
- Evaluating Approximately Balanced Parity-Declustered Data Layouts for Disk Arrays. Parallel
Computing, Vol. 23, No. 4-5, pp. 501-523, May 1997. (with I. M. Sutherland and B. K.
Holmer.)
- Work-Preserving Emulations of Fixed-Connection Networks. Journal of the ACM,
Vol. 44, No. 1, pp. 57-85, January 1997. (with R. R. Koch, F. T. Leighton, B. M. Maggs, S.
B. Rao, A. L. Rosenberg, and E. J. Schwabe.)
- Improved Parity-Declustered Layouts for Disk Arrays. Journal of Computer and
System Sciences. Vol. 53, No. 3, pp. 328-343, December 1996. (with I. M. Sutherland.)
- Worst-Case Performance of Cellular Channel Allocation Policies. ACM/Baltzer
Journal on Wireless Networks., Vol. 2, No. 4, pp. 265-275, December 1996. (with S.
Jordan.)
- The Cost of Complex Communication on Simple Networks. Journal of Parallel and
Distributed Computing, Vol. 35, No. 2, pp. 133-141, June 1996. (with D. S. Greenberg
and J. K. Park.)
- On Bufferless Routing of Variable-length Messages in Leveled Networks. IEEE
Transactions on Computers, Vol. 45, No. 6, pp. 714-729, June 1996. (with S. N. Bhatt,
G. Bilardi, G. Pucci, A. Ranade, and A. L. Rosenberg.)
- Optimal Emulations by Butterfly-like Networks. Journal of the ACM, Vol.
43, No. 2, pp. 293-330, March 1996. (with S. N. Bhatt, F. R. K. Chung, J.-W. Hong, F. T.
Leighton, B. Obrenic, and A. L. Rosenberg.
- Optimality of a VLSI Decomposition Scheme for the deBruijn Graph. Parallel
Processing Letters, Vol. 3, No. 3, pp. 261-265, March 1994.
- Constant-Slowdown Simulations of Normal Hypercube Algorithms on the Butterfly
Network. Information Processing Letters, Vol. 45, No. 2, pp. 295-301, April
1993.
- A Benes-like Theorem for the Shuffle-Exchange Graph. IEEE Transactions on
Computers, Vol. 41, No. 12, pp. 1627-1630, December 1992.
- Embedding Meshes of Trees into deBruijn Graphs. Information Processing Letters,
Vol. 43, No. 5, pp. 237-240, October 1992.
- Dynamic Tree Embeddings in Butterflies and Hypercubes. SIAM Journal on
Computing, Vol. 21, No. 4, pp. 639-654, August 1992. (with F. T. Leighton, M. J.
Newman, and A. G. Ranade.)
Conference Publications (refereed, with proceedings):
- Efficient Mappings for Parity-Declustered Data Layouts.
To appear in Proceedings of the Ninth International Computing and Combinatorics Conference
(COCOON 2003), July 2003. (with I. M. Sutherland.)
- Configuration Compression for the Xilinx XC6200 FPGA. In Proceedings
of the IEEE Symposium on FPGAs for Custom Computing Machines, pp. 138-146, March 1998.
(with S. Hauck and Z. Li.)
- Improved Access to Optical Bandwidth in Trees. In Proceedings of the 8th
Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 437-444, January 1997. (with V.
Kumar.)
- Improved Algorithms and Data Structures for Solving Graph Problems in External
Memory. In Proceedings of the 8th IEEE Symposium on Parallel and Distributed
Processing, pp. 169-176, October 1996. (with V. Kumar.)
- Flexible Usage of Parity Storage Space in Disk Arrays. In Proceedings of the
8th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 99-108, June
1996. (with I. M. Sutherland.)
- Evaluating Approximately Balanced Parity-Declustered Data Layouts for Disk Arrays.
In Proceedings of the Fourth Annual Workshop on I/O in Parallel and Distributed Systems,
pp. 41-54, May 1996. (with I. M. Sutherland and B. K. Holmer.)
- Balancing Load versus Decreasing Communication: Exploring the Tradeoffs. In Proceedings
of the 29th Hawaii International Conference on System Sciences, Vol. 1, pp. 585-593,
January 1996. (with V. E. Taylor, B. K. Holmer, and M. R. Hribar.)
- Improved Parity-Declustered Layouts for Disk Arrays. In Proceedings of the 6th
Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 76-84, June 1994.
(with I. M. Sutherland.)
- Becoming a Better Host Through Origami: A Mesh Can Be More Than Rows and Columns.
In Proceedings of the 5th Annual IEEE Symposium on Parallel and Distributed Processing,
pp. 276-283, December 1993. (with D. S. Greenberg and J. K. Park.)
- On Bufferless Routing of Variable-length Messages in Leveled Networks. In Proceedings
of the 1st Annual European Symposium on Algorithms, pp. 49-60, September 1993. (with
S. N. Bhatt, G. Bilardi, G. Pucci, A. Ranade, and A. L. Rosenberg.)
- A Separator-Based Framework for Automated Partitioning and Mapping of Parallel
Algorithms for Numerical Solution of PDEs. In Proceedings of the Dartmouth
Institute for Advanced Graduate Studies in Parallel Computation (DAGS/PC) Symposium,
pp. 48-62, June 1992. (with G. E. Blelloch, A. Feldmann, O. Ghattas, J. R. Gilbert, G. L.
Miller, D. R. O'Hallaron, J. R. Shewchuk, and S.-H. Teng.)
- Efficient Algorithms for Dynamic Allocation of Distributed Memory. In Proceedings
of the 32nd Annual IEEE Symposium on Foundations of Computer Science, pp. 470-479,
September 1991. (with F. T. Leighton.)
- On the Computational Equivalence of Hypercube-Derived Networks. In Proceedings
of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 388-397,
July 1990.
- Dynamic Tree Embeddings in Butterflies and Hypercubes. In Proceedings of the
1st Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 224-234, June
1989. (with F. T. Leighton, M. J. Newman, and A. G. Ranade.)
Book Chapters:
- Routing in Optical and Wireless Networks. In Michael T. Heath,
Abhiram Ranade, and Robert S. Schreiber, editors, Algorithms for Parallel Processing,
Volume 105 of IMA Volumes in Mathematics and its Applications (Spring-Verlag),
pp. 101-116, January 1999.
Eric J. Schwabe -
08/02/04