
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Daniel C. Lee, "Some Compartmentalized Secure Task Assignment Models for Distributed Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 12, pp. 14141424, December, 2006.  
BibTex  x  
@article{ 10.1109/TPDS.2006.178, author = {Daniel C. Lee}, title = {Some Compartmentalized Secure Task Assignment Models for Distributed Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {17}, number = {12}, issn = {10459219}, year = {2006}, pages = {14141424}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.178}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Some Compartmentalized Secure Task Assignment Models for Distributed Systems IS  12 SN  10459219 SP1414 EP1424 EPD  14141424 A1  Daniel C. Lee, PY  2006 KW  Task assignment KW  distributed systems KW  load balancing KW  complexity KW  information security. VL  17 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—This paper formulates abstract problems of assigning subtasks to agents (processors) in a distributed system with a goal that they can perform its global task efficiently. The paper models the distributed system with a graph that describes the communication capabilities of the constituting agents. This graph is referred to as the "organizational graph.” In addition, the desired taskperforming activity is modeled with another graph describing the required communications. Then, a few variants of the task assignment problem are formulated with potentially conflicting objectives (or constraints) of load balancing and communication costs. For some of these variants this paper provides efficient algorithms that solve the assignment problem. Some problems are proven NPcomplete, and some others are left open.
[1] A.H. Alhusaini, V.K. Prasanna, and C.S. Raghavendra, “A Unified Resource Scheduling Framework for Heterogeneous Computing Environments,” Proc. Eighth Heterogeneous Computing Workshop (HCW '99), Apr. 1999.
[2] F.D. Anger, J.J. Hwang, and Y.C. Chow, “Scheduling with Sufficiently Loosely Coupled Processors,” J. Parallel and Distributed Computing, vol. 9, no. 1, pp. 8792, 1990.
[3] R. Armstrong, D. Hensgen, and T. Kidd, “The Relative Performance of Various Mapping Algorithm Is Independent of Sizable Variance in RunTime Predictions,” Proc. Seventh Heterogeneous Computing Workshop (HCW '98), Mar. 1998.
[4] M.S. Bazaraa, J.J. Jarvis, and H.D. Sherali, Linear Programming and Network Flows. Wiley, 2005.
[5] S. Bataineh and B. AlAlsir, “An Efficient Scheduling Algorithm for Divisible and Indivisible Tasks in Loosely Coupled Multiprocessor Systems,” Software Eng. J., vol. 9, pp. 1318, 1994.
[6] D.P. Bertsekas, Network Optimization: Continuous and Discrete Models. Athena Scientific, 1998.
[7] D. Bertsekas and R. Gallager, Data Networks, second ed. Prentice Hall, 1992.
[8] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Prentice Hall, 1989.
[9] D. Bertsimas and J.N. Tsitsiklis, Introduction to Linear Optimization. Athena Scientific, 1997.
[10] F. Berman and R. Wolski, “Scheduling from the Perspective of the Application,” Proc. Fifth IEEE Int'l Symp. High Performance Distributed Computing, Aug. 1996.
[11] V. Bharadwaj, D. Ghose, and V. Mani, “An Efficient Load Distribution Strategy for a Distributed Linear Network of Processors with Communication Delays,” Computers and Math. with Applications, vol. 29, no. 9, pp. 95112, 1995.
[12] J. Blazewicz and M. Drozdowski, “The Performance Limits of a TwoDimensional Network of Load Sharing Processors,” Foundations of Computing and Decision Sciences, vol. 21, no. 1, pp. 315, 1996.
[13] S. Bokhari, “A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System,” IEEE Trans. Software Eng., vol. 7, no. 6, pp. 583589, June 1981.
[14] S.H. Bokhari, Assignment Problems in Parallel and Distributed Computing. Kluwer Academic Publishers, 1987.
[15] T.D. Braun et al., “A Taxonomy for Describing Matching and Scheduling Heuristics for MixedMachine Heterogeneous Computing Systems,” Proc. IEEE Workshop Advances in Parallel and Distributed Systems, pp. 330335, Oct. 1998.
[16] T.L. Casavant and J.G. Kuhl, “A Taxonomy of Scheduling Heuristics in GeneralPurpose Distributed Computing Systems,” IEEE Trans. Software Eng., vol. 14, no. 2, Feb. 1988.
[17] W.W. Chu, L.J. Holloway, M. Lan, and K. Efe, “Task Allocation in Distributed Data Processing,” Computer, pp. 5769, Nov. 1980.
[18] R. Diekmann, R. Lüling, A. Reinefeld, “Distributed Combinatorial Optimization,” Proc. SOFSEM '93, pp. 3360, 1993.
[19] K. Efe, “Heuristic Models of Task Assignment Scheduling in Distributed Systems,” Computer, pp. 5056, June 1982.
[20] D. FernándezBaca, “Allocating Modules to Processors in a Distributed System,” IEEE Trans. Software Eng., vol. 15, no. 11, pp. 14271436, Nov. 1989.
[21] R. Freund, B. Carter, D. Watson, E. Keith, and F. Mirabile, “Generational Scheduling for Heterogeneous Computing Systems,” Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications (PDPTA '96), pp. 769778, Aug. 1996.
[22] M.R. Garey and D.S. Johnson, Computers and Intractability. W.H.Freeman and Company, 1979.
[23] The Grid: Blueprint for New Computing Infrastructure, I. Foster and C. Kesselman, eds., Morgan Kaufmann Publishers, 1999.
[24] D. Gusfield, “Parametric Combinatorial Computing and a Problem in Module Distribution,” J. ACM, vol. 30, no. 3, pp.551563, July 1983.
[25] M. Iverson, F. Ozguner, G.J. Follen, “Parallelizing Existing Applications in a Distributed Homogeneous Environment,” Proc. Fourth Heterogeneous Computing Workshop (HCW '95), pp. 93100, Apr. 1995.
[26] C. Leangsuksun, J. Potter, and S. Scott, “Dynamic Task Mapping Algorithms for a Distributed Homogeneous Computing Environment,” Proc. Fourth Heterogeneous Computing Workshop (HCW '95), pp. 3034, Apr. 1995.
[27] D.C. Lee, “Task Allocation for Efficient Performance of a Decentralized Organization,” master's thesis, Dept. of Electrical Eng. and Computer Science, Massachusetts Inst. of Tech nology, 1987.
[28] V.M. Lo, “Heuristic Algorithms for Task Assignment in Distributed Systems,” IEEE Trans. Computers, vol. 37, no. 11, pp. 13841397, Nov. 1988.
[29] M. Maheswaran and H.J. Siegel, “A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems,” Proc. Seventh Heterogeneous Computing Workshop (HCW '98), pp. 5769, Mar. 1998.
[30] B. Monien, R. Diekmann, R. Feldmann, R. Klasing, R. Lüling, K. Menzel, T. Römke, and U.P. Schroeder, “Efficient Use of Parallel & Distributed Systems: From Theory to Practice,” Lecture Notes in Computer Science, no. 1000, SpringerVerlag, 1995.
[31] C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1982.
[32] D.T. Peng and K.G. Shin, “Optimal Scheduling of Cooperative Tasks in a Distributed System Using an Enumerative Method,” IEEE Trans. Software Eng., vol. 19, no. 3, pp. 253267, 1993.
[33] T. Römke, M. Röttger, U.P. Schroeder, and J. Simon, “On Efficient Embedding of Grids into Grids in PARIX,” Proc. First Int'l Conf. Parallel Processing, EuroPAR '95, pp. 181192, Aug. 1996.
[34] Scheduling and Load Balancing in Parallel and Distributed Systems, B.A. Shirazi, A.R. Hurson, and K.M. Kavi, eds., CS Press, 1995.
[35] B. Shirazi, M. Wang, and G. Pathak, “Analysis and Evaluation of Heuristic Methods for Static Task Scheduling,” J. Parallel and Distributed Computing, vol. 10, pp. 222232, 1990.
[36] G.C. Sih and E.A. Lee, “A CompileTime Schedule Heuristic for InterconnectionConstrained Heterogeneous Processor Architectures,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, Feb. 1993.
[37] J.B. Sinclair, “Efficient Computation of Optimal Assignments for Distributed Tasks,” J. Parallel and Distributed Computing, vol. 4, no. 4, pp. 342362, Aug. 1987.
[38] J. Sohn and T. G. Robertazzi, “An Optimum Load Sharing Strategy for Divisible Jobs with TimeVarying Processor Speed,” Proc. Eighth Int'l Conf. Parallel and Distributed Computer Systems, pp. 2732, 1995.
[39] H.S. Stone, “Multiprocessor Scheduling with the Aid of Network Flow Algorithms,” IEEE Trans. Software Eng., vol. 3, pp. 8594, Jan. 1977.
[40] H.S. Stone, “Critical Load Factors in TwoProcessor Distributed Systems,” IEEE Trans. Software Eng., vol. 4, pp. 254258, May 1978.
[41] D. Towsley, “Allocating Problems Containing Branches and Loops Within a Multiple Processor System,” IEEE Trans. Software Eng., vol. 12, no. 10, pp. 10181024, 1986.
[42] J.N. Tsitsiklis, “Problems in Decentralized Decision Making and Computation,” PhD thesis, Dept. of Electrical Eng. and Computer Science, Massachusetts Inst. of Technology, Cambridge, Mass., 1984.
[43] L. Wang, H.J. Siegel, V.P. Roychowdhury, and A.A. Maciejewski, “Task Matching and Scheduling in Heterogeneous Computing Environments Using a GeneticAlgorithmBased Approach,” J.Parallel and Distributed Computing, vol. 47, no. 1, pp. 822, Nov. 1997.
[44] R. Weber, “On a Conjecture About Assigning Jobs to Processes of Different Speeds,” IEEE Trans. Automatic Control, vol. 38, no. 1, pp.166170, 1993.
[45] T. Yang and A. Gerasoulis, “DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9, Sept. 1994.