dblp.uni-trier.dewww.uni-trier.de

Kemal Efe

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2000
25 Kemal Efe, Adrienne L. Broadwater, Antonio Fernández: Embedding complete binary trees in product graphs. Telecommunication Systems 13(1): 99-109 (2000)
1999
24 Kemal Efe, Putchong Uthayopas, Adrienne L. Broadwater: Speedup and Scalability of SPMD Computations on Workstation Clusters. PDPTA 1999: 1776-1782
1997
23 Kemal Efe, Nancy Eleser: An Optimal Emulator and VLSI Layout for Complete Binary Trees. Acta Inf. 34(6): 429-447 (1997)
22 Antonio Fernández, Kemal Efe: Efficient VLSI Layouts for Homogeneous Product Networks. IEEE Trans. Computers 46(10): 1070-1082 (1997)
21EEAntonio Fernández, Kemal Efe: Generalized Algorithm for Parallel Sorting on Product Networks. IEEE Trans. Parallel Distrib. Syst. 8(12): 1211-1225 (1997)
1996
20 Adrienne L. Broadwater, Kemal Efe, Antonio Fernández: Embedding Complete Binary Trees in Product Graphs. WG 1996: 56-66
19EEMargaret A. Schaar, Kemal Efe: Effective queueing strategies for co-scheduling in a pool of processors. Computer Communications 19(9-10): 743-753 (1996)
18EEKemal Efe, Antonio Fernández: Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees. IEEE Trans. Parallel Distrib. Syst. 7(12): 1281-1291 (1996)
17 Kemal Efe: Embedding Large Complete Binary Trees in Hypercubes with Load Balancing. J. Parallel Distrib. Comput. 35(1): 104-109 (1996)
1995
16 Antonio Fernández, Nancy Eleser, Kemal Efe: Generalized Algorithm for Parallel Sorting on Product Networks. ICPP (3) 1995: 155-159
15EEKemal Efe, Venkatesh Krishnamoorthy: Optimal Scheduling of Compute-Intensive Tasks on a Network of Workstations. IEEE Trans. Parallel Distrib. Syst. 6(6): 668-673 (1995)
14EEKemal Efe, Antonio Fernández: Products of Networks with Logarithmic Diameter and Fixed Degree. IEEE Trans. Parallel Distrib. Syst. 6(9): 963-975 (1995)
1994
13 Kemal Efe, Antonio Fernández: Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation. ICPP (1) 1994: 72-76
12EEMargaret A. Schaar, Kemal Efe, Weijia Shang: Queueing performance analysis of co-scheduling in a pool of processors environment. International Conference on Supercomputing 1994: 313-322
11 Kemal Efe, P. K. Blackwell, W. Slough, T. Shiau: Topological Properties of the Crossed Cube Architecture. Parallel Computing 20(12): 1763-1775 (1994)
1993
10 Kemal Efe, Margaret A. Schaar: Performance of Co-Scheduling on a Network of Workstations. ICDCS 1993: 525-531
9 Kemal Efe: Embedding Large Mesh of Trees and Related Networks in the Hypercube With Load Balancing. ICPP 1993: 311-315
1992
8 Kemal Efe: Reconfigurable Cube Architecture for Parallel Computation. ICDCS 1992: 218-225
7EEKemal Efe: The Crossed Cube Architecture for Parallel Computation. IEEE Trans. Parallel Distrib. Syst. 3(5): 513-524 (1992)
1991
6 Kemal Efe, Kumar Ramaiyer: Congestion and Fault Tolerance of Binary Tree Embeddings on Hypercube. IPPS 1991: 458-463
5 Kemal Efe: A Variation on the Hypercube with Lower Diameter. IEEE Trans. Computers 40(11): 1312-1316 (1991)
4 Kemal Efe: Embedding Mesh of Trees in the Hypercube. J. Parallel Distrib. Comput. 11(3): 222-230 (1991)
1990
3 Kemal Efe: Embedding Mesh of Trees in the Hypercube. ICPP (3) 1990: 358-359
2 Margaret A. Schaar, Kemal Efe, Lois M. L. Delcambre, Srinivas Koppolu: Heuristic Algorithms for Adaptive Load Sharing in Local Networks. ICSI 1990: 762-770
1987
1 Kemal Efe: A Proposed Solution to the Problem of Levels in Error-Message Generation. Commun. ACM 30(11): 948-955 (1987)

Coauthor Index

1P. K. Blackwell [11]
2Adrienne L. Broadwater [20] [24] [25]
3Lois M. L. Delcambre [2]
4Nancy Eleser [16] [23]
5Antonio Fernández [13] [14] [16] [18] [20] [21] [22] [25]
6Srinivas Koppolu [2]
7Venkatesh Krishnamoorthy [15]
8Kumar Ramaiyer [6]
9Margaret A. Schaar [2] [10] [12] [19]
10Weijia Shang [12]
11T. Shiau [11]
12W. Slough [11]
13Putchong Uthayopas [24]

Colors in the list of coauthors

Copyright © Wed May 28 02:56:03 2008 by Michael Ley (ley@uni-trier.de)