
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Syam Menon, "Effective Reformulations for Task Allocation in Distributed Systems with a Large Number of Communicating Tasks," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 12, pp. 14971508, December, 2004.  
BibTex  x  
@article{ 10.1109/TKDE.2004.91, author = {Syam Menon}, title = {Effective Reformulations for Task Allocation in Distributed Systems with a Large Number of Communicating Tasks}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {16}, number = {12}, issn = {10414347}, year = {2004}, pages = {14971508}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2004.91}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Effective Reformulations for Task Allocation in Distributed Systems with a Large Number of Communicating Tasks IS  12 SN  10414347 SP1497 EP1508 EPD  14971508 A1  Syam Menon, PY  2004 KW  Task allocation KW  nonlinear optimization KW  integer programming. VL  16 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] A. Auyeung, I. Gondra, and H. Dai, “MultiHeuristic List Scheduling Genetic Algorithm for Task Scheduling,” Proc. 2003 ACM Symp. Applied Computing, pp. 721724, 2003.
[2] A. Billionnet, M. Costa, and A. Sutter, “An Efficient Algorithm for a Task Allocation Problem,” J. ACM, vol. 39, no. 3, pp. 502518, 1992.
[3] H. Chen and M. Maheswaran, “Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems,” Proc. 11th IEEE Heterogeneous Computing Workshop, pp. 8897, 2002.
[4] W. Chen and C. Lin, “A Hybrid Heuristic to Solve a Task Allocation Problem,” Computers and Operations Research, vol. 27, pp. 287303, 2000.
[5] F. de la Vega and M. Lamari, “The Task Allocation Problem with Constant Communication,” Discrete Applied Math., vol. 131, pp. 169177, 2003.
[6] A. Dutta, G. Koehler, and A. Whinston, “On Optimal Allocation in a Distributed Processing Environment,” Management Science, vol. 28, no. 8, pp. 839853, 1982.
[7] A. Ernst, H. Jiang, and M. Krishnamoorthy, “Mathematical Programming Approaches for Solving Task Allocation Problems,” Proc. 16th Nat'l Conf. Australian Soc. of Operations Research, 2001.
[8] A. Gabrielian and D. Tyler, “Optimal Object Allocation in Distributed Systems,” Proc. Int'l Conf. Distributed Computing Systems, 1984.
[9] F. Glover, “Improved Linear Integer Programming Formulations of Nonlinear Integer Programs,” Management Science, vol. 22, no. 4, pp. 455460, Dec. 1975.
[10] A. HadjAlouane, J. Bean, and K. Murty, “A Hybrid Genetic/Optimization Algorithm for a Task Allocation Problem,” J. Scheduling, vol. 2, pp. 189201, 1999.
[11] Y. Hamam and K. Hindi, “Assignment of Program Modules to Processors: A Simulated Annealing Approach,” European J. Operations Research, vol. 122, pp. 509513, 2000.
[12] M. İkinci, “Multilevel Heuristics for Task Assignment in Distributed Systems,” master's thesis, Bilkent Univ., 1998.
[13] ILOG, Inc., Gentilly, France, ILOG CPLEX 7.5 User's Manual, 2001.
[14] Y. Kopidakis, M. Lamari, and V. Zissimopoulos, “On the Task Assignment Problem: Two New Efficient Heuristic Algorithms,” J. Parallel and Distributed Computing, vol. 42, pp. 2129, 1997.
[15] Y. Kwok and I. Ahmad, “Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors,” ACM Computer Surveys, vol. 31, no. 4, pp. 406471, 1999.
[16] V. Lo, “Heuristic Algorithms for Task Assignment in Distributed Systems,” IEEE Trans. Computers, vol. 37, no. 11, pp. 13841397, Nov. 1988.
[17] P. Ma, E. Lee, and M. Tsuchiya, “A Task Allocation Model for Distributed Computing Systems,” IEEE Trans. Computers, vol. 31, no. 1, pp. 4147, Jan. 1982.
[18] M. Maheswaran and H. Siegel, “A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems,” Proc. Seventh IEEE Heterogeneous Computing Workshop, pp. 5769, 1998.
[19] I. Page, T. Jacob, and E. Chern, “Fast Algorithms for Distributed Resource Allocation,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 188197, Feb. 1993.
[20] D. Pisinger, “A Minimal Algorithm for the 01 Knapsack Problem,” Operations Research, vol. 45, pp. 758767, 1997.
[21] C. Price and S. Krishnaprasad, “Software Allocation Models for Distributed Computing Systems,” Proc. Fourth Int'l Conf. Distributed Computing Systems, 1984.
[22] C. Shen and W. Tsai, “A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion,” IEEE Trans. Computers, vol. 34, no. 3, pp. 197203, Mar. 1985.
[23] G. Sih and E. Lee, “Declustering: A New Multiprocessor Scheduling Technique,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 6, pp. 625637, June 1993.
[24] S. Srinivasan and N. Jha, “Safety and Reliability Driven Task Allocation in Distributed Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 3, pp. 238251, Mar. 1999.
[25] H. Stone, “Multiprocessor Scheduling with the Aid of Network Flow Algorithms,” IEEE Trans. Software Eng., vol. 3, pp. 8593, 1977.
[26] R. Szymanek and K. Krzysztof, “Partial Task Assignment of Task Graphs under Heterogeneous Resource Constraints,” Proc. 40th Conf. Design Automation, pp. 244249, 2003.