Abstract
In this paper, we present a scheme which explores the parallelism on JVM. An algorithm, called dynamic-duplication scheduling is developed for solving the static scheduling and code generation for data flow graphs (DFG) on the parallel JVM. Experimental results show that the schedule produced by the algorithm on parallel JVM is significantly improved compared with the traditional JVM.
| Original language | English |
|---|---|
| Pages (from-to) | 1157-1160 |
| Number of pages | 4 |
| Journal | Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing |
| Volume | 2 |
| State | Published - 2001 |
| Externally published | Yes |
| Event | 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing - Salt Lake, UT, United States Duration: 7 May 2001 → 11 May 2001 |