Scheduling of client-server applications

International Transactions in Operational Research

Volumn 6, Issue 4, 1999, Pages 345-363

  Blazewicz J ^a   Dell'Olmo, P ^b   Drozdowski, M ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Communication delays; Deterministic scheduling; Distributed processing; Multiprocessor tasks

Indexed keywords

EID: 0009942972     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.1999.tb00160.x     Document Type: Article

References (29)

1. Adler, R.M., 1995. Distributed coordination models for client/server computing. IEEE Computer 28, 14-22.
2. Aref, M.M., Tayyib, M.A., 1998. Lana-Match algorithm: a parallel version of the Rete-Match algorithm. Parallel Computing 24, 763-775.
3. Błażewicz, J., Dell'Olmo, P., Drozdowski, Speranza, M.G. 1992. Scheduling multiprocessor tasks on three dedicated processors. Information Processing Letters 41, 275-280. Corrigendum: 1994. Information Processing Letters 49, 269-270.
4. Błażewicz, J., Drabowski, M., Wȩglarz, J., 1986. Scheduling multiprocessor tasks to minimize schedule length. IEEE Transactions on Computers C-35, 389-393.
5. Błażewicz, J., Ecker, K., Pesch, E., Schmidt, G., Wȩglarz, J., 1996. Scheduling Computer and Manufacturing Processes. Springer, Heidelberg.
6. Chen, B. 1993. Analysis of a heuristic for scheduling two-stage flow-shop with parallel machines, Report 9338/A, Econometric Institute, Erasmus University, Rotterdam.
7. Coffman Jr., E.G., Garey, M.R., Johnson, D. S., LaPaugh, A. S., 1985. Scheduling file transfers. SIAM Journal on Computing 3, 744-780.
8. Deux, O., et al., 1991. The O2 system. Communications of the ACM 34, 34-48.
9. Drozdowski, M., 1996. Scheduling multiprocessor tasks: an overview. European Journal of Operational Research 94, 215-230.
10. Du, J., Leung, J.Y-T., 1989. Complexity of scheduling parallel task systems. SIAM J. Discrete Mathematics 2, 473-487.
11. Fleischmann, A., 1994. Distributed Systems: Software Design and Implementation. Springer-Verlag, Heidelberg.
12. Garcia, B.-L., Potvin, J.-Y., Rosseau, J.-M., 1994. A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Computers and Operations Research 21, 1025-1033.
13. Garey, M.R., Johnson, D.S., 1978. Strong NP-completeness results: motivation, examples and implications. Comput. J. Assoc. Mach. 25, 499-508.
14. Gendron, B., Crainic, T.G., 1994. Parallel branch-and-bound algorithms: survey and synthesis. Operations Research 42, 1042-1066.
15. Graham, R.L., 1969. Bounds on multiprocessing anomalies. SIAM J. Appl. Math. 17, 263-269.
16. Gonzales, T., Sahni, S., 1978. Flowshop and jobshop schedules: complexity and approximation. Operations Research 26, 36-52.
17. Hall, N.G., Potts, C.N., Sriskandarajah, C., 1996. Parallel machine scheduling with a common server. In: PMS'96 The Fifth International Workshop on Project Management and Scheduling, Abstracts, April 11-13, Poznań, Poland, pp. 102-106.
18. Hoogeveen, J.A., Lenstra, J.K., Veltman, B., 1996. Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. European Journal of Operational Research 89, 172-175.
19. Jean-Marie, A., Lefebvre-Barbaroux, S., Liu, Z., 1998. An analytical approach to the performance evaluation of master-slave computational models. Parallel Computing 24, 841-862.
20. Karp, R.M., 1972. Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (Eds.), Complexity of Computer Computation. Plenum Press, New York, pp. 85-104.
21. Kubiak, W., Lou, S.X.C., Wang, Y., 1996. Mean flow time minimization in re-entrant job-shops with a hub. Operations Research 44, 764-776.
22. Kubale, M., 1987. The complexity of scheduling independent two-processor tasks on dedicated processors. Information Processing Letters 24, 141-147.
23. Lane, E.L., Sidney, J.B., 1993. Batching and scheduling in FMS hubs: flow time considerations. Operations Research 41, 1091-1103.
24. Mitra, G., Hai, I., Hajian, M.T., 1997. A distributed processing algorithm for solving integer programs using a cluster of workstations. Parallel Computing 23, 733-753.
25. Porto, S., Ribeiro, C., 1995. Parallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling Under Precedence Constraints. Journal of Heuristics 1, 207-223.
26. Rinnoy Kan, A.H.G., 1976. Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff, The Hague.
27. Tanenbaum, A.S., 1989. Computer Networks. Prentice-Hall, Englewood Cliffs.
28. Veltman, B., Lageweg, B.J., Lenstra, J.K., 1990. Multiprocessor scheduling with communications delays. Parallel Computing 16, 173-182.
29. Wang, Y., Sethi, S.P., van de Velde, S.L., 1997. Minimizing makespan in a class of re-entrant shops. Operations Research 45, 702-712.