BibSLEIGH — Marc

Travelled to:

1 × Poland
2 × France
5 × Germany
6 × USA

Collaborated with:

T.Basten S.Stuijk H.Corporaal ∅ A.H.Ghamarian Y.Yang F.Siyoum X.Zhu M.Wiggers M.Bekooij B.Mesman M.Damavandpeyma H.Shojaei R.Hoes B.v.d.Sanden M.A.Reniers J.Jacobs J.Voeten R.R.H.Schiffelers U.Waqas J.Kandelaars L.J.Somers P.Vestjens

Talks about:

graph (9) synchron (7) dataflow (7) throughput (4) constrain (3) schedul (3) resourc (3) requir (3) buffer (3) model (3)

Person: Marc Geilen

DBLP: Geilen:Marc

Contributed to:

2015

2014

2012

2010

2009

2008

2007

2006

2005

2003

Wrote 18 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.
MoDELS-2015-SandenRGBJVS #composition #design #modelling: Modular model-based supervisory controller design for wafer logistics in lithography machines (BvdS, MAR, MG, TB, JJ, JV, RRHS), pp. 416–425.
DAC-2014-SiyoumGC #analysis #data flow: Symbolic Analysis of Dataflow Applications Mapped onto Shared Heterogeneous Resources (FS, MG, HC), p. 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-WiggersBGB #graph: Simultaneous budget and buffer size computation for throughput-constrained task graphs (MW, MB, MG, TB), pp. 1669–1672.
DATE-2010-YangGBSC #automation: Automated bottleneck-driven design-space exploration of media processing systems (YY, MG, TB, SS, HC), pp. 1041–1046.
DAC-2009-Geilen #data flow #graph #reduction: Reduction techniques for synchronous dataflow graphs (MG), pp. 911–916.
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.
DATE-2007-GeilenB: A calculator for Pareto points (MG, TB), pp. 285–290.
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.
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.
CAV-2003-Geilen #logic #on the fly #realtime: An Improved On-The-Fly Tableau Construction for a Real-Time Temporal Logic (MG), pp. 394–406.
ESOP-2003-GeilenB #execution #network #process #requirements: Requirements on the Execution of Kahn Process Networks (MG, TB), pp. 319–334.