BibSLEIGH — Sander

Travelled to:

1 × France
4 × USA
5 × Germany

Collaborated with:

T.Basten M.Geilen H.Corporaal A.H.Ghamarian Y.Yang X.Zhu S.V.Gheorghita B.Mesman M.Damavandpeyma H.Shojaei R.Hoes R.Frijns S.Adyanthaya J.Voeten M.C.W.Geilen R.R.H.Schiffelers U.Waqas J.Kandelaars L.J.Somers P.Vestjens

Talks about:

graph (8) synchron (6) dataflow (5) schedul (4) throughput (3) time (3) multiprocessor (2) constrain (2) scenario (2) resourc (2)

Person: Sander Stuijk

DBLP: Stuijk:Sander

Contributed to:

2015

2014

2012

2010

2009

2008

2007

2006

2005

Wrote 13 papers:

DATE-2015-WaqasGKSBSVC #heuristic #online #scalability #scheduling: A re-entrant flowshop heuristic for online scheduling of the paper path in a large scale printer (UW, MG, JK, LJS, TB, SS, PV, HC), pp. 573–578.
DATE-2014-FrijnsASVGSC #analysis #graph: Timing analysis of First-Come First-Served scheduled interval-timed Directed Acyclic Graphs (RF, SA, SS, JV, MCWG, RRHS, HC), pp. 1–6.
DATE-2014-ZhuGBS #data flow #graph #scheduling: Memory-constrained static rate-optimal scheduling of synchronous dataflow graphs via retiming (XYZ, MG, TB, SS), pp. 1–6.
DATE-2012-DamavandpeymaSBGC #data flow #graph #modelling: Modeling static-order schedules in synchronous dataflow graphs (MD, SS, TB, MG, HC), pp. 775–780.
DATE-2012-YangGBSC #game studies #graph #policy #resource management: Playing games with scenario- and resource-aware SDF graphs through policy iteration (YY, MG, TB, SS, HC), pp. 194–199.
DATE-2010-YangGBSC #automation: Automated bottleneck-driven design-space exploration of media processing systems (YY, MG, TB, SS, HC), pp. 1041–1046.
DAC-2009-ShojaeiGBGSH #composition #heuristic #multi #runtime: A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management (HS, AHG, TB, MG, SS, RH), pp. 917–922.
DATE-2008-GhamarianGBS #analysis #data flow #graph #parametricity #throughput: Parametric Throughput Analysis of Synchronous Data Flow Graphs (AHG, MG, TB, SS), pp. 116–121.
DAC-2007-StuijkBGC #data flow #graph #multi #resource management: Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs (SS, TB, MG, HC), pp. 777–782.
DAC-2006-StuijkGB #constraints #data flow #graph #requirements #throughput #trade-off: Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs (SS, MG, TB), pp. 899–904.
DAC-2005-GeilenBS #data flow #graph #model checking #requirements: Minimising buffer requirements of synchronous dataflow graphs with model checking (MG, TB, SS), pp. 819–824.
DAC-2005-GheorghitaSBC #automation #detection #estimation: Automatic scenario detection for improved WCET estimation (SVG, SS, TB, HC), pp. 101–104.
DATE-2005-StuijkBMG #data type #multi #predict #scalability: Predictable Embedding of Large Data Structures in Multiprocessor Networks-on-Chip (SS, TB, BM, MG), pp. 254–255.