Finding the maximum subsequence sum on interconnection networks

References

• Agrawal , R. , Imielinski , T. and Swami , A. 1993 . “ Mining association rules between sets of items in large databases ” . In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data 207 – 216 .
   Google Scholar
• Akers , S.B. and Krishnamurthy , B. 1989 . A group theoretic model for symmetric interconnection networks . IEEE Transaction on Computers , c-38 ( 4 ) : 555 – 556 .
   Web of Science ®Google Scholar
• Akl , S.G. and Guenther , G.R. 1989 . “ Broadcasting with selective reduction ” . In Proceedings of the 11th IFIP Congress 515 – 520 . San Francisco, California
   Google Scholar
• Akl , S.G. and Guenther , G.R. 1991 . Applications of broadcasting with selective reduction to the maximal sum subsegment problem . International Journal of High Speed Computing , 3 ( 2 ) : 107 – 111 .
   Google Scholar
• Akl , S.G. 1997 . Parallel Computation: Models and Methods , Upper Saddle River, NJ : Prentice Hall .
   Google Scholar
• Akl , S.G. and Qiu , K. 1993 . A novel routing scheme on the star and pancake networks and its applications . Parallel Computing , 19 ( 1 ) : 95 – 101 .
   Web of Science ®Google Scholar
• Alves , C.E.R. , Cáceres , E.N. and Song , S.W. 2004 . “ BSP/CGM algorithms for maximum subsequence and maximum subarray ” . In Proceedings of the 11th European PVM/MPI Users’ Group Conference , Vol. 3241 , 139 – 146 . Springer-Verlag . Budapest, Hungary, LNCS,
   Google Scholar
• Batcher , K.E. 1968 . “ Sorting networks and their applications ” . In Spring Joint Computer Conference AFIPS Proceedings , Vol. 32 , 307 – 314 . Washington, DC : Thompson Books .
   Google Scholar
• Bengtsson , F. and Chen , J. 2004 . “ Efficient algorithms for k maximum sums ” . In Proceedings of the 15th International Symposium on Algorithms and Computation (ISSAC 2004) , 137 – 148 . Springer-Verlag . Hong Kong, LNCS
   Google Scholar
• Bentley , J. 1984 . Programming pearls: solutions for september's problem . Communications of the ACM , 27 : 1090 – 1092 .
   Google Scholar
• Bentley , J. 2000 . Programming Pearls , 2nd ed. , Addison-Wesley .
   Google Scholar
• Blelloch , G. 1987 . “ Scans as primitive parallel operations ” . In Proceedings of the International Conference on Parallel Processing 355 – 362 .
   Google Scholar
• Fukuda , T. , Morimoto , Y. , Morishita , S. and Tokuyama , T. 1996 . “ Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization ” . In Proceedings of the ACM International Conference on Management and Data 13 – 23 .
   Google Scholar
• Gries , D. 1982 . A note on the standard strategy for developing loop invariants and Loops . Science of Computer Programming , 2 : 207 – 214 .
   Google Scholar
• Lakshmivarahan , S. and Dhall , S.K. 1994 . Parallel Computing Using the Prefix Problem , Oxford University Press .
   Google Scholar
• Perumalla , K. and Deo , N. 1995 . Parallel algorithms for maximum subsequence and maximum subarray . Parallel Processing Letters , 5 : 367 – 373 .
   Google Scholar
• Preparata , F.P. and Vuillemin , J. 1981 . The cube-connected cycles: a versatile network for parallel computation . Communications of the ACM , 24 : 300 – 309 .
   Web of Science ®Google Scholar
• Qiu , K. , Akl , S.G. and Meijer , H. 1994 . On some properties and algorithms on the star and pancake interconnection networks . Journal of Parallel and Distributed Computing , 22 : 16 – 25 .
   Google Scholar
• Takaoka , T. 2002 . “ Efficient algorithms for the maximum subarray problem by distance matrix multiplication ” . In Proceedings of the Australasian Theory Symposium 189 – 198 .
   Google Scholar
• Tamaki , H. and Takeshi , T. 1998 . “ Algorithms for the maximum subarray problem based on matrix multiplication ” . In Proceedings of the Ninth Annul ACM-SIAM Symposium on Discrete Algorithms 446 – 452 .
   Google Scholar
• Weiss , M.A. 1994 . Data Structures and Algorithm Analysis , Redwood City, CA : The Benjamin/Cummings Publishing Company, Inc. .
   Google Scholar
• Wen , Z. 1995 . Fast parallel algorithms for the maximum sum problem . Parallel Computing , 21 : 461 – 466 .
   Google Scholar