-
2
-
-
0003415652
-
-
Addison-Wesley, Reading, MA
-
A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
-
(1974)
The Design and Analysis of Computer Algorithms
-
-
Aho, A.V.1
Hopcroft, J.E.2
Ullman, J.D.3
-
3
-
-
0040634183
-
The time complexity of scheduling interval orders with communication is polynomial
-
H.H. Ali, H. El-Rewini, The time complexity of scheduling interval orders with communication is polynomial, Parallel Processing Letters 3 (1) (1993) 53-58.
-
(1993)
Parallel Processing Letters
, vol.3
, Issue.1
, pp. 53-58
-
-
Ali, H.H.1
El-Rewini, H.2
-
5
-
-
0041886549
-
A low overhead schedule for a 3D-grid graph
-
E. Bampis, J.-C. König, D. Trystram, A low overhead schedule for a 3D-grid graph, Parallel Processing Letters 2 (4) (1992) 363-372.
-
(1992)
Parallel Processing Letters
, vol.2
, Issue.4
, pp. 363-372
-
-
Bampis, E.1
König, J.-C.2
Trystram, D.3
-
6
-
-
0003151227
-
Scheduling with communication delays: A survey
-
P. Chretienne et al. (Eds.), Wiley, New York
-
P. Chrétienne, C. Picouleau, Scheduling with communication delays: A survey, in: P. Chretienne et al. (Eds.), Sheduling Theory and Its Applications, Wiley, New York, 1995.
-
(1995)
Sheduling Theory and Its Applications
-
-
Chrétienne, P.1
Picouleau, C.2
-
7
-
-
0030212249
-
Optimal schedules for UET-UCT series parallel digraphs on two processors
-
L. Finta, Z. Liu, I. Milis, E. Bampis, Optimal schedules for UET-UCT series parallel digraphs on two processors, Theoretical Computer Science 162 (1996) 323-340.
-
(1996)
Theoretical Computer Science
, vol.162
, pp. 323-340
-
-
Finta, L.1
Liu, Z.2
Milis, I.3
Bampis, E.4
-
8
-
-
0004155526
-
-
Addison-Wesley, Reading, MA
-
R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1989.
-
(1989)
Concrete Mathematics
-
-
Graham, R.L.1
Knuth, D.E.2
Patashnik, O.3
-
11
-
-
0028530486
-
Three, four, five, six or the complexity of scheduling with communication delays
-
J.A. Hoogeveen, J.K. Lenstra, B. Veltman, Three, four, five, six or the complexity of scheduling with communication delays, Operational Research Letters 16 (1994) 129-137.
-
(1994)
Operational Research Letters
, vol.16
, pp. 129-137
-
-
Hoogeveen, J.A.1
Lenstra, J.K.2
Veltman, B.3
-
12
-
-
0003620778
-
-
Addison-Wesly, Reading, MA
-
J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesly, Reading, MA, 1979.
-
(1979)
Introduction to Automata Theory, Languages, and Computation
-
-
Hopcroft, J.E.1
Ullman, J.D.2
-
14
-
-
0030363273
-
The complexity of scheduling trees with communication delays
-
J.K. Lenstra, M. Veldhorst, B. Veltman, The complexity of scheduling trees with communication delays, Journal of Algorithms 20 (1) (1996) 157-173.
-
(1996)
Journal of Algorithms
, vol.20
, Issue.1
, pp. 157-173
-
-
Lenstra, J.K.1
Veldhorst, M.2
Veltman, B.3
-
16
-
-
0025418536
-
Towards an architecture-independent analysis of parallel algorithms
-
C. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, SIAM Journal of Computing 19 (2) (1990) 322-328.
-
(1990)
SIAM Journal of Computing
, vol.19
, Issue.2
, pp. 322-328
-
-
Papadimitriou, C.1
Yannakakis, M.2
-
18
-
-
0023476962
-
UET scheduling with unit interprocessor communication delays
-
V.J. Rayward-Smith, UET scheduling with unit interprocessor communication delays, Discrete Applied Mathematics 18 (1987) 55-71.
-
(1987)
Discrete Applied Mathematics
, vol.18
, pp. 55-71
-
-
Rayward-Smith, V.J.1
-
19
-
-
20044383248
-
Scheduling in and out forests in the presence of communication delays
-
Newport Beach, CA
-
T. Varvarigou, V.P. Roychowdhury, T. Kailath, Scheduling in and out forests in the presence of communication delays, Proceedings of the International Parallel Processing Symposium, Newport Beach, CA, 1993, 222-229.
-
(1993)
Proceedings of the International Parallel Processing Symposium
, pp. 222-229
-
-
Varvarigou, T.1
Roychowdhury, V.P.2
Kailath, T.3
|