Optimal scheduling for UET-UCT grids into fixed number of processors

Andronikos, T; Koziris, N

dc.contributor.author	Andronikos, T	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T02:48:59Z
dc.date.available	2014-03-01T02:48:59Z
dc.date.issued	2000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34197
dc.subject	Data Flow	en
dc.subject	Low Complexity	en
dc.subject	Optimal Scheduling	en
dc.subject	Parallel Computer	en
dc.subject	Task Graphs	en
dc.subject	Nearest Neighbor	en
dc.title	Optimal scheduling for UET-UCT grids into fixed number of processors	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/EMPDP.2000.823417	en
heal.identifier.secondary	http://dx.doi.org/10.1109/EMPDP.2000.823417	en
heal.publicationDate	2000	en
heal.abstract	The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. Many scientific algorithms, which require nearest neighbor communication in a lattice space, are modeled by a task graph with the properties of a simple or enhanced grid. In this paper we consider an enhanced model of the n-dimensional grid by adding extra diagonal edges	en
heal.journalName	International Conference on Energy Management and Power Delivery	en
dc.identifier.doi	10.1109/EMPDP.2000.823417	en