Download:
|
|
by Borut Robic, Borut Robic
ftp://martin.ijs.si/pub/CSD/Reports/CSD-TR-95-12.ps.gz
Add To MetaCart
Abstract:
Dynamic program allocation on the mesh-connected parallel architecture
Citations
| 52 | Efficient processor allocation strategies for meshconnected parallel computers – Zhu - 1992 |
| 20 | Job scheduling in mesh multicomputers – Sharma, Pradhan - 1994 |
| 19 | A new algorithm for the largest empty rectangle problem. Algorithmica – Orlowski - 1990 |
| 8 | Computing largest empty circles with location constraints – Toussaint - 1983 |
| 6 | Using simulated annealing for mapping algorithms onto data driven arrays – Mendelson, Koren - 1991 |
| 3 | scheduling in partitionable mesh connected systems – Li, Cheng, et al. - 1989 |
| 3 | Area optimization of dataflow-graph mappings, Parallel Comput – Robic, Kolbezen, et al. - 1992 |
| 3 | Fault-tolerant mapping onto VLSI/WSI processor arrays – Robic, Silc - 1994 |
