Abstract
We present an experimental study of a new approach for task assignment for irregularly structured problems under dynamic conditions. Our method is fast and gives solutions that are always close to those obtained for simulated annealing. The target parallel computer we have considered has the Boolean n-cube interconnection structure.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C.H. Papadimitriou, M. Yannakakis, Optimization, Approximation and Complexity Classes, JCSS, 43 (1991), 425–440.
M.X.Goemans, D.P.Williamson, .878-Approximation Algorithm for MAX CUT and MAX 2SAT, accepted in STOC 94.
D.J. Haglin and S.M. Venkatesan, Approximation and Intractability results for the maximum cut problem and its variants, IEEE TC, 40 (1991), 110–113.
R.M. Karp, Reducibility among combinatorial problems, In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, Plenum Press, NY, (1972), 85–103.
R. Ercal, J. Ramanujam, R. Sadyappan, Task Allocation onto a Hypercube by Recursive Mincut Bipartitioning, JPDC, 10 (1990), 35–44.
M.R. Garey, D.H.Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W.H.Freeman and Company, (1979).
F. Berman, L. Snyder, On mapping parallel algorithms into parallel architectures, JPDC, 4 (1987), 429–458.
V. Chaudhary, J.K. Aggarwal, A Generalized Scheme for Mapping Parallel Algorithms, IEEE PDS, Vol.4. No.3. (1993), 328–346.
S.H. Bokhari, On the mapping problem, IEEE TC, Vol.C-30, No.3 (1981), 207–214.
S.J. Kim, J.C. Browne, A general approach to mapping of parallel computations upon multiprocessor architectures, in Prof. Int. Conf. Parallel Processing, (1988), 1–8.
K. Efe, Heuristic models of task assignment scheduling in distributed systems, IEEE Comput. Mag., Vol.15 (1982), 50–56.
C.C.Shen, W.H.Tsai, A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion, IEEE TC, Vol.C-34. No.3. (1985), 197–203.
V.M.Lo, Heuristic algorithms for task assignment in distributed systems, IEEE TC, Vol.C-37. No.11. (1988), 1384–1397.
S.Kirkpatrick, C.D.Gelatt, M.P.Vecchi, Optimization by simulated annealing, Science, 220 (1983), 671–680.
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, E. Teller, Equation of state calculations by fast computing machines, J. Chem. Phys., 21 (1953), 1087–1092.
D.M. Nicol, Dynamic remapping of parallel computations with varying resource demands, IEEE TC, Vol.C-37. No.9. (1988), 1073–1087.
K.V.S. Bhat, On the complexity of testing a graph for a N-cube, Inf. Prof. Letters, Vol.11. No.1 (1980), 16–19.
R.K. Sen, On maximum Edge Deletion Bipartite Subgraph Problem, Congressus Numerantum, Vol.74. (1990), 38–54.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sen, R.k. (1995). A new scheme for dynamic processor assignment for irregular problems. In: Ferreira, A., Rolim, J. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1995. Lecture Notes in Computer Science, vol 980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60321-2_8
Download citation
DOI: https://doi.org/10.1007/3-540-60321-2_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60321-4
Online ISBN: 978-3-540-44915-7
eBook Packages: Springer Book Archive