
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Arnold L. Rosenberg, "On Scheduling MeshStructured Computations for InternetBased Computing," IEEE Transactions on Computers, vol. 53, no. 9, pp. 11761186, September, 2004.  
BibTex  x  
@article{ 10.1109/TC.2004.64, author = {Arnold L. Rosenberg}, title = {On Scheduling MeshStructured Computations for InternetBased Computing}, journal ={IEEE Transactions on Computers}, volume = {53}, number = {9}, issn = {00189340}, year = {2004}, pages = {11761186}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.64}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On Scheduling MeshStructured Computations for InternetBased Computing IS  9 SN  00189340 SP1176 EP1186 EPD  11761186 A1  Arnold L. Rosenberg, PY  2004 KW  Internetbased computing KW  grid computing KW  P2P computing KW  Web computing KW  scheduling KW  meshstructured computations KW  monoid dags KW  Cayley graphs. VL  53 JA  IEEE Transactions on Computers ER   
[1] F.S. Annexstein, M. Baumslag, and A.L. Rosenberg, Group Action Graphs and Parallel Architectures SIAM J. Computing, vol. 19, pp. 544569, 1990.
[2] B.W. Arden and K.W. Tang,“Representation and routing of Cayley graphs,” IEEE Trans. Comm., vol. 39, no. 11, pp. 1,5331,537, Nov. 1991.
[3] M. Baumslag and A.L. Rosenberg, ProcessorTime Tradeoffs for Cayley Graph Interconnection Networks Proc. Sixth Distributed Memory Computing Conf., pp. 630636, 1991.
[4] A.R. Butt, S. Adabala, N.H. Kapadia, R. Figueiredo, and J.A.B. Fortes, “FineGrain Access Control for Securing Shared Resources in Computational Grids,” Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '02), 2002.
[5] R. Buyya, D. Abramson, and J. Giddy, A Case for Economy Grid Architecture for Service Oriented Grid Computing Proc. 10th Heterogeneous Computing Workshop, 2001.
[6] H. Casanova, Distributed Computing Research Issues in Grid Computing, typescript, Univ. of California, San Diego, 2002.
[7] W. Cirne and K. Marzullo, The Computational CoOp: Gathering Clusters into a Metacomputer Proc. 13th Int'l Parallel Processing Symp., pp. 160166, 1999.
[8] S.A. Cook, An Observation on TimeStorage Tradeoff J. Computer and System Sciences, vol. 9, pp. 308316, 1974.
[9] V.V. Dimakopoulos and N.J. Dimopoulos, Optimal Total Exchange in Cayley Graphs IEEE Trans. Parallel and Distributed Systems, vol. 12, pp. 11621168, 2001.
[10] I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure. San Francisco: MorganKaufmann, 1999.
[11] I. Foster, C. Kesselman, and S. Tuecke, The Anatomy of the Grid: Enabling Scalable Virtual Organizations Int'l J. Supercomputer Applications, 2001.
[12] A. Gerasoulis and T. Yang, A Comparison of Clustering Heuristics for Scheduling Dags on Multiprocessors J. Parallel and Distributed Computing, vol. 16, pp. 276291, 1992.
[13] L. He, Z. Han, H. Jin, L. Pan, and S. Li, DAGBased Parallel Real Time Task Scheduling Algorithm on a Cluster Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications (PDPTA '2000), pp. 437443, 2000.
[14] J.W. Hong and H.T. Kung, I/O Complexity: The RedBlue Pebble Game Proc. 13th ACM Symp. Theory of Computing, pp. 326333, 1981.
[15] J.E. Hopcroft, W. Paul, and L.G. Valiant, On Time versus Space J. ACM, vol. 24, pp. 332337, 1977.
[16] The Intel Philanthropic PeertoPeer program www.intel.comcure, 2003.
[17] R.M. Karp, R.E. Miller, and S. Winograd, The Organization of Computations for Uniform Recurrence Equations J. ACM, vol. 4, pp. 563590, 1967.
[18] R.M. Karp, A. Sahay, E. Santos, and K.E. Schauser, Optimal Broadcast and Summation in the logP Model Proc. Fifth ACM Symp. Parallel Algorithms and Architectures, pp. 142153, 1993.
[19] D. Kondo, H. Casanova, E. Wing, and F. Berman, Models and Scheduling Guidelines for Global Computing Applications Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '02), 2002.
[20] E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky, SETI@home: Massively Distributed Computing for SETI Computing in Science and Eng., 2000.
[21] The Olson Laboratory Fight AIDS@Home Project, www.fight aidsathome.org, 2003.
[22] M.S. Paterson and C.E. Hewitt, Comparative Schematology Proc. Project MAC Conf. Concurrent Systems and Parallel Computation, pp. 119127, 1970.
[23] N.J. Pippenger, Pebbling Proc. Fifth IBM Symp. Math. Foundations of Computer Science, 1980.
[24] A.L. Rosenberg, Data Graphs and Addressing Schemes J. Computing Systems Sciences, vol. 5, pp. 193238, 1971.
[25] A.L. Rosenberg, Addressable Data Graphs J. ACM, vol. 19, pp. 309340, 1972.
[26] A.L. Rosenberg, Accountable WebComputing IEEE Trans. Parallel and Distributed Systems, vol. 14, pp. 97106, 2003.
[27] A.L. Rosenberg, On Scheduling Collaborative Computations on the Internet: MeshDags and Their Close Relatives Int'l Parallel and Distributed Processing Symp. (IPDPS '03), 2003.
[28] A.L. Rosenberg and I.H. Sudborough, Bandwidth and Pebbling Computing, vol. 31, pp. 115139, 1983.
[29] A.L. Rosenberg and M. Yurkewych, Guidelines for Scheduling Some Common ComputationDags for InternetBased Computing, submitted for publication, 2004.
[30] The RSA Factoring by Web Project, http://www.npac.syr.edufactoring(with foreword by A. Lenstra). Northeast Parallel Architecture Center, 2003.
[31] W. Shang and J.A.B. Fortes, "Time Optimal Linear Schedules for Algorithms with Uniform Dependencies," IEEE Trans. Computers, vol. 40, June 1991.
[32] X.H. Sun and M. Wu, GHS: A Performance Prediction and Task Scheduling System for Grid Computing Proc. IEEE Int'l Parallel and Distributed Processing Symp., 2003.
[33] C. Weth, U. Kraus, J. Freuer, M. Ruder, R. Dannecker, P. Schneider, M. Konold, and H. Ruder, XPulsar@homeSchools Help Scientists, typescript, Univ. of Tübingen, 2000.
[34] S.W. White and D.C. Torney, Use of a Workstation Cluster for the Physical Mapping of Chromosomes SIAM NEWS, pp. 1417, Mar. 1993.