See this document in CiteSeerX!

Received November 7, 1997; revised June 15, 1998; accepted August 11, 1998 (2000)  (Make Corrections)  
Communicated by Shing-Tsaan Huang. Journal Of Information Science And...



  Home/Search   Context   Related

 
View or download:
sinica.edu.tw/JISE/2000...200005_06.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  sinica.edu.tw/JISE/20...200005_06 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper to eliminate such initial transient periods (Update)


Active bibliography (related documents):   More   All
0.6:   An Interactive Tool for Design, Simulation, Verification, and.. - Chao, Wang (1994)   (Correct)
0.4:   An Upper Bound Of The Throughput Of Multirate.. - Schoenen, Zivojnovic.. (1997)   (Correct)
0.4:   List Scheduling for Iterative Data-Flow Graphs - Koster, Gerez (1995)   (Correct)

Similar documents based on text:   More   All
0.1:   An Evaluation of Confidence Bound Estimation Methods - For Neural Networks (2000)   (Correct)
0.0:   Efficient Block Scheduling for Programmable Embedded.. - Hong, Potkonja.. (1996)   (Correct)
0.0:   Adaptive Real-Time Management Of Communication And Computation.. - West (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ shing-tsaan-received,
  author = "Communicated By Shing-Tsaan",
  title = "Received November 7, 1997; revised June 15, 1998; accepted August 11, 1998.",
  url = "citeseer.ist.psu.edu/635731.html" }
Citations (may not include all citations):
76   Performance evaluation of asynchronous concurrent systems us.. (context) - Ramamoorthy, Ho - 1980
72   a routing problem (context) - Bellman - 1958
42   Algorithm transformation techniques for concurrent processor.. (context) - Parhi - 1989
31   The maximum sampling rate of digital filters under hardware .. (context) - Renfors, Neuvo - 1981
22   Algorithm 97: shortest path (context) - Floyd - 1962
14   Range-chart-guided iterative data-flow graph scheduling (context) - de Groot, Gerez et al. - 1992
14   A preliminary evaluation of the critical path method for sch.. (context) - Kohler - 1975
13   Selected topics in scheduling theory (context) - Blazewicz - 1987
9   Iteration bounds of single-rate data flow graphs for concurr.. (context) - Chao, Wang - 1995
8   Optimal automatic periodic multiprocessor scheduler for full.. (context) - Gelabert - 1993
7   Cyclo-static multiprocessor scheduling on the optimal realiz.. (context) - Schwartz, Barnwell - 1985
5   Rate-optimal DSP synthesis by pipeline and minimum unfolding (context) - Jeng, Chen - 1994
5   Synchronous multiprocessor realizations of shift invariant f.. (context) - Schwartz - 1985
4   A tournament problem (context) - Ford, Johnson - 1959
3   Realizability of digital filter networks (context) - Fettweis - 1989
3   Scheduling techniques for iterative data-flow graphs, and ap.. (context) - de Groot - 1990
2   Extensions on performance evaluation technique for concurren.. (context) - Yaw, Wei et al. - 1988
1   Fast multiprocessor realization of digital filters (context) - Renfors, Neuvo - 1989
1   Multiprocessor implementation of real-time DSP algorithms (context) - Wang, Hu - 1995
1   Evaluation of some multiprocessor scheduling techniques of a.. (context) - de Groot, Hermann - 1989
1   Performance of multi-rate data flow graphs for concurrent pr.. (context) - Chao
1   A polynomial time algorithm data flow graphs (context) - Gerez, de Groot et al. - 1993
1   Dedicated DSP architecture synthesis using the MARS design s.. (context) - Wang, Parhi - 1992

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC