• DocumentCode
    3783767
  • Title

    Implementing parallelism and scheduling data flow graphs on Java virtual machine

  • Author

    J. Xu;E.H.-M. Sha

  • Author_Institution
    Dept. of Comp. Sci. & Eng. Dept. of Comp. Sci., Notre Dame Univ., IN, USA
  • Volume
    2
  • fYear
    2001
  • fDate
    6/23/1905 12:00:00 AM
  • Firstpage
    1157
  • Abstract
    We present a scheme which explores the parallelism on a Java virtual machine (JVM). An algorithm, called dynamic-duplication scheduling is developed for solving the static scheduling and code generation for data flow graphs on the parallel JVM. Experimental results show that the schedule produced by the algorithm on the parallel JVM is significantly improved compared with the traditional JVM.
  • Keywords
    "Flow graphs","Java","Virtual machining","Dynamic scheduling","Scheduling algorithm","Parallel processing","Heuristic algorithms","Computer languages","Writing","Optimizing compilers"
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP ´01). 2001 IEEE International Conference on
  • ISSN
    1520-6149
  • Print_ISBN
    0-7803-7041-4
  • Type

    conf

  • DOI
    10.1109/ICASSP.2001.941128
  • Filename
    941128
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3783767