
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K.G. Shin, M.S. Chen, "On the Number of Acceptable Task Assignments in Distributed Computing Systems," IEEE Transactions on Computers, vol. 39, no. 1, pp. 99110, January, 1990.  
BibTex  x  
@article{ 10.1109/12.46284, author = {K.G. Shin and M.S. Chen}, title = {On the Number of Acceptable Task Assignments in Distributed Computing Systems}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {1}, issn = {00189340}, year = {1990}, pages = {99110}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.46284}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On the Number of Acceptable Task Assignments in Distributed Computing Systems IS  1 SN  00189340 SP99 EP110 EPD  99110 A1  K.G. Shin, A1  M.S. Chen, PY  1990 KW  acceptable task assignments; distributed computing systems; cooperating tasks; processor graph; hops; dilation; distributed processing; graph theory. VL  39 JA  IEEE Transactions on Computers ER   
A distributed computing system and cooperating tasks can be represented by a processor graph G/sub p/=(V/sub p/, E/sub p/) and a task graph G/sub T/=(V/sub T/, E/sub T/), respectively. An edge between a pair of nodes in G/sub T/ represents the existence of direct communications between the two corresponding tasks. The maximal number of hops between two processors in G/sub p/ to which two adjacent tasks in G/sub T/ are assigned is called dilation of that assignment. Characterization and use of the number of acceptable assignments for given G/sub T/ and G/sub P/ are treated. Assignments with the dilation less than or equal to one are considered. This dilation constraint represents a special case in which two adjacent tasks in G/sub T/ must be assigned to either a single processor or two adjacent processors in G/sub p/. For the case where N(G/sub T/, G/sub P/) denotes the numbers of acceptable assignments under this constraint, N(G/sub T/, G/sub P/) are derived for arbitrary G/sub T/ and G/sub P/, and a recursive expression is formulated for N(G/sub T/, G/sub P/) when G/sub T/ is a tree. For some restricted cases, either closedform or recursiveform expressions of N(G/sub T/, G/sub P/) are derived. The results on N(G/sub T/, G/sub P/) are extended to the completely general case, assignments with dilations greater than one, where two adjacent tasks in G/sub T/ can be assigned to any two processors in G/sub P/ which are not necessarily adjacent to each other.
[1] W. W. Chu, L. J. Holloway, M. T. Lan, and K. Efe, "Task allocation in distributed data processing,"IEEE Comput. Mag., vol. 13, pp. 5769, Nov. 1980.
[2] W. W. Chu and L. M.T. Lan, "Task allocation and precedence relations for distributed realtime systems,"IEEE Trans. Comput., vol. C36, pp. 667679, June 1987.
[3] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 2233, Jan. 1985.
[4] C. C. Shen and W. H. Tsai, "A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion,"IEEE Trans. Comput., vol. C34, no. 3, pp. 197203, Mar. 1985.
[5] F. Harary, "The topological cubical dimension of a graph," inLecture Notes First Japan Conf., Graph Theory Appl., June 3, 1986.
[6] R. C. Read and D. G. Corneil, "The graph isomorphism disease,"J. Graph Theory, pp. 339363, 1977.
[7] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[8] N. Nilsson,Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
[9] S. H. Bokhari, "On the mapping problem,"IEEE Trans. Comput., vol. C30, no. 3, pp. 207214, Mar. 1981.
[10] K. Efe, "Heuristic models of task assignment scheduling in distributed systems,"IEEE Comput. Mag., vol. 15, pp. 5056, June 1982.
[11] G. S. Rao, H. S. Stone, and T. C. Hu, "Assignment of tasks in a distributed processing system with limited memory,"IEEE Trans. Comput., vol. C28, no. 4, pp. 291299, Apr. 1979.
[12] F. Harary,Graph Theory. Reading, MA: AddisonWesley, 1969.
[13] A. W. Marshall and I. Olkin,Inequalities: Theory of Majorization and Its Applications. New York: Academic, 1969.
[14] D. G. Corneil and D. G. Kirkpatrick, "A theoretical analysis of various heuristics for the graph isomorphism problem,"SIAM J. Comput., vol. 9, no. 2, pp. 281297, May 1980.