On the public citation graph

Lower-bound performance estimation for the high-level synthesis scheduling problem

0 signed · 104 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1016/0141-9331(85)90187-5openalex-snapshot
Computer architecture and parallel processing
inferredcites →https://doi.org/10.1016/0378-4754(89)90069-4openalex-snapshot
Discrete optimization
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/32.62447openalex-snapshot
Lower bound on the number of processors and time for scheduling precedence graphs with communication costs
inferredcites →https://doi.org/10.1109/4.121562openalex-snapshot
Optimal synthesis of high-performance architectures
inferredcites →https://doi.org/10.1109/43.149767openalex-snapshot
Predicting system-level area and delay for pipelined and nonpipelined designs
inferredcites →https://doi.org/10.1109/43.31522openalex-snapshot
Force-directed scheduling for the behavioral synthesis of ASICs
inferredcites →https://doi.org/10.1109/43.3169openalex-snapshot
Sehwa: a software package for synthesis of pipelines from behavioral specifications
inferredcites →https://doi.org/10.1109/43.39073openalex-snapshot
Behavioral transformation for algorithmic level IC design
inferredcites →https://doi.org/10.1109/43.75629openalex-snapshot
A formal approach to the scheduling problem in high level synthesis
inferredcites →https://doi.org/10.1109/43.87595openalex-snapshot
The ADAM design planning engine
inferredcites →https://doi.org/10.1109/43.87596openalex-snapshot
Architectural partitioning for system level synthesis of integrated circuits
inferredcites →https://doi.org/10.1109/cicc.1992.591165openalex-snapshot
A Branch-and-bound Method For The Optimal Scheduling
inferredcites →https://doi.org/10.1109/dac.1986.1586129openalex-snapshot
MAHA: A Program for Datapath Synthesis
inferredcites →https://doi.org/10.1109/dac.1992.227806openalex-snapshot
Distributed design-space exploration for high-level synthesis systems
inferredcites →https://doi.org/10.1109/dac.1992.227831openalex-snapshot
High-level synthesis with pin constraints for multiple-chip designs
inferredcites →https://doi.org/10.1109/dac.1992.227833openalex-snapshot
Specification partitioning for system design
inferredcites →https://doi.org/10.1109/icassp.1994.389612openalex-snapshot
RECALS II: a new list scheduling algorithm
inferredcites →https://doi.org/10.1109/iccd.1989.63401openalex-snapshot
A cost function based optimization technique for scheduling in data path synthesis
inferredcites →https://doi.org/10.1109/tc.1973.5009153openalex-snapshot
Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules
inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1145/127601.127609openalex-snapshot
Simultaneous scheduling and allocation for cost constrained optimal architectural synthesis
inferredcites →https://doi.org/10.1145/127601.127724openalex-snapshot
CHOP
inferredcites →https://doi.org/10.1145/127601.127751openalex-snapshot
Empirical evaluation of some high-level synthesis scheduling heuristics
inferredcites →https://doi.org/10.1145/127601.127768openalex-snapshot
Redundant operator creation
inferredcites →https://doi.org/10.1145/157485.164929openalex-snapshot
Estimating architectural resources and performance for high-level synthesis applications
inferredcites →https://doi.org/10.1145/74382.74393openalex-snapshot
Experience with ADAM synthesis system
inferredcites →https://doi.org/10.2307/2348051openalex-snapshot
Sequencing and Scheduling.
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.5555/113938.149411openalex-snapshot
Specification partitioning for system design
inferredcites →https://doi.org/10.5555/113938.149415openalex-snapshot
High-level synthesis with pin constraints for multiple-chip designs
inferredcites →https://doi.org/10.5555/113938.149651openalex-snapshot
Distributed design-space exploration for high-level synthesis systems
inferredcites →https://doi.org/10.5555/318013.318087openalex-snapshot
MAHA: A Program for Datapath Synthesis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4615-0292-0_13openalex-snapshot
Exploring Performance Tradeoffs for Clustered VLIW ASIPs
inferred← citeshttps://doi.org/10.1007/978-1-4757-4419-4_6openalex-snapshot
Overlapped Scheduling Techniques for High-Level Synthesis and Multiprocessor Realizations of DSP Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-28977-4_2openalex-snapshot
Formal Methods in High-Level and System Synthesis
inferred← citeshttps://doi.org/10.1007/bf00209909openalex-snapshot
Lower bounds on the iteration time and the initiation interval of functional pipelining and loop folding
inferred← citeshttps://doi.org/10.1007/bf02106824openalex-snapshot
Resource-constrained loop list scheduler for DSP algorithms
inferred← citeshttps://doi.org/10.1007/bf02960762openalex-snapshot
Lower bound estimation of hardware resources for scheduling in high-level synthesis
inferred← citeshttps://doi.org/10.1007/s10951-005-2862-8openalex-snapshot
Data-Dependency Graph Transformations for Instruction Scheduling
inferred← citeshttps://doi.org/10.1016/b978-155860702-6/50042-9openalex-snapshot
LOWER BOUND ON LATENCY FOR VLIW ASIP DATAPATHS**This work is supported by a National Science Foundation NSF CAREER Award MIP-9624321 and by Grant ATP-003658-088 of the Texas Higher Education Coordinating Board.
inferred← citeshttps://doi.org/10.1016/j.amc.2010.05.009openalex-snapshot
A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.10.003openalex-snapshot
An integer programming approach to optimal basic block instruction scheduling for single-issue processors
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00303-9openalex-snapshot
Lower bounds on precedence-constrained scheduling for parallel processors
inferred← citeshttps://doi.org/10.1023/a:1008191708726openalex-snapshot
A Framework for High Level Estimations of Signal Processing VLSI Implementations
inferred← citeshttps://doi.org/10.1023/a:1020601110391openalex-snapshot
Backtracking-Based Instruction Scheduling to Fill Branch Delay Slots
inferred← citeshttps://doi.org/10.1049/iet-cdt:20070162openalex-snapshot
Heuristic algorithm for the resource-constrained scheduling problem during high-level synthesis
inferred← citeshttps://doi.org/10.1109/12.946999openalex-snapshot
Scheduling superblocks with bound-based branch trade-offs
inferred← citeshttps://doi.org/10.1109/43.851990openalex-snapshot
Functional area lower bound and upper bound on multicomponent selection for interval scheduling
inferred← citeshttps://doi.org/10.1109/92.406996openalex-snapshot
Global scheduling with code-motions for high-level synthesis applications
inferred← citeshttps://doi.org/10.1109/92.555988openalex-snapshot
A solution methodology for exact design space exploration in a three-dimensional design space
inferred← citeshttps://doi.org/10.1109/cadcg.2007.4407903openalex-snapshot
A New ILP Based Approach to Schedule and Bind Simultaneously
inferred← citeshttps://doi.org/10.1109/ccece.1995.526283openalex-snapshot
Maximal performance of pipelined circuits under hardware constraints
inferred← citeshttps://doi.org/10.1109/ccece.1996.548062openalex-snapshot
Performance analysis for hardware/software co-synthesis
inferred← citeshttps://doi.org/10.1109/codes-isss.2013.6659001openalex-snapshot
Bound-oriented parallel pruning approaches for efficient resource constrained scheduling of high-level synthesis
inferred← citeshttps://doi.org/10.1109/glsv.1999.757420openalex-snapshot
Bounding algorithms for design space exploration
inferred← citeshttps://doi.org/10.1109/iccad.1995.480153openalex-snapshot
PARAS: System-level concurrent partitioning and scheduling
inferred← citeshttps://doi.org/10.1109/iccad.1998.144233openalex-snapshot
Tutorial I Embedded Memories In System Design From Technology To Systems Architecture
inferred← citeshttps://doi.org/10.1109/iccad.1999.810659openalex-snapshot
Lower bound on latency for VLIW ASIP datapaths
inferred← citeshttps://doi.org/10.1109/iccad.2000.896523openalex-snapshot
Exploring performance tradeoffs for clustered VLIW ASIPs
inferred← citeshttps://doi.org/10.1109/iccd.1993.393412openalex-snapshot
A recursive technique for computing lower-bound performance of schedules
inferred← citeshttps://doi.org/10.1109/iccd.1994.331980openalex-snapshot
Register estimation from behavioral specifications
inferred← citeshttps://doi.org/10.1109/iccd.2002.1106801openalex-snapshot
Accelerated SAT-based scheduling of control/data flow graphs
inferred← citeshttps://doi.org/10.1109/icm.1998.825581openalex-snapshot
A static method for system performance estimation
inferred← citeshttps://doi.org/10.1109/icpp.2000.876172openalex-snapshot
Lower bounds on precedence-constrained scheduling for parallel processors
inferred← citeshttps://doi.org/10.1109/iscas.1994.408802openalex-snapshot
Estimating performance characteristics of loop transformations
inferred← citeshttps://doi.org/10.1109/iscas.1999.780174openalex-snapshot
A lower bound on general minimal resource interval scheduling with arbitrary component selection
inferred← citeshttps://doi.org/10.1109/isie.2008.4677118openalex-snapshot
High-level delay estimation technique for porting C-based applications on FPGA
inferred← citeshttps://doi.org/10.1109/isss.1995.520616openalex-snapshot
An exact methodology for scheduling in a 3D design space
inferred← citeshttps://doi.org/10.1109/isvlsi.2013.6654637openalex-snapshot
Branch-and-bound style resource constrained scheduling using efficient structure-aware pruning
inferred← citeshttps://doi.org/10.1109/micro.1999.809465openalex-snapshot
Balance scheduling: weighting branch tradeoffs in superblocks
inferred← citeshttps://doi.org/10.1109/micro.2004.27openalex-snapshot
Optimal Superblock Scheduling Using Enumeration
inferred← citeshttps://doi.org/10.1109/pact.2000.888354openalex-snapshot
Efficient backtracking instruction schedulers
inferred← citeshttps://doi.org/10.1109/pact.2002.1106004openalex-snapshot
Effective compilation support for Variable Instruction Set Architecture
inferred← citeshttps://doi.org/10.1109/tc.2003.1214337openalex-snapshot
Variable instruction set architecture and its compiler support
inferred← citeshttps://doi.org/10.1109/tc.2015.2468230openalex-snapshot
Efficient Resource Constrained Scheduling Using Parallel Structure-Aware Pruning Techniques
inferred← citeshttps://doi.org/10.1109/vtsa.1995.524635openalex-snapshot
MPT-based scheduling for high-level synthesis
inferred← citeshttps://doi.org/10.1145/1498690.1498694openalex-snapshot
Optimal trace scheduling using enumeration
inferred← citeshttps://doi.org/10.1145/1835420.1835422openalex-snapshot
An in-place search algorithm for the resource constrained scheduling problem during high-level synthesis
inferred← citeshttps://doi.org/10.1145/224486.224505openalex-snapshot
An exact methodology for scheduling in a 3D design space
inferred← citeshttps://doi.org/10.1145/234860.234866openalex-snapshot
Register estimation in unscheduled dataflow graphs
inferred← citeshttps://doi.org/10.1145/238997.239002openalex-snapshot
A recursive technique for computing lower-bound performance of schedules
inferred← citeshttps://doi.org/10.1145/250243.250245openalex-snapshot
Recent developments in high-level synthesis
inferred← citeshttps://doi.org/10.1145/2509420.2512432openalex-snapshot
Preallocation instruction scheduling with register pressure minimization using a combinatorial optimization approach
inferred← citeshttps://doi.org/10.1145/288548.289091openalex-snapshot
Improving the computational performance of ILP-based problems
inferred← citeshttps://doi.org/10.1145/290833.290839openalex-snapshot
Estimation of lower bounds in scheduling algorithms for high-level synthesis
inferred← citeshttps://doi.org/10.1145/3174243.3174268openalex-snapshot
A Scalable Approach to Exact Resource-Constrained Scheduling Based on a Joint SDC and SAT Formulation
inferred← citeshttps://doi.org/10.1145/3200920openalex-snapshot
Survey on Combinatorial Register Allocation and Instruction Scheduling
inferred← citeshttps://doi.org/10.1145/330855.331020openalex-snapshot
A new technique for estimating lower bounds on latency for high level synthesis
inferred← citeshttps://doi.org/10.1145/3368826.3377918openalex-snapshot
Optimizing occupancy and ILP on the GPU using a combinatorial approach
inferred← citeshttps://doi.org/10.1145/337292.337573openalex-snapshot
On lower bounds for scheduling problems in high-level synthesis
inferred← citeshttps://doi.org/10.1145/502175.502178openalex-snapshot
A fast approach to computing exact solutions to the resource-constrained scheduling problem
inferred← citeshttps://doi.org/10.1145/581630.581633openalex-snapshot
A near-optimal instruction scheduler for a tightly constrained, variable instruction set embedded processor
inferred← citeshttps://doi.org/10.1155/2012/156907openalex-snapshot
Formal ESL Synthesis for Control-Intensive Applications
inferred← citeshttps://doi.org/10.32657/10356/47497openalex-snapshot
Rapid area-time estimation of C-based applications for hardware/software partitioning and design exploration
inferred← citeshttps://doi.org/10.5555/224841.225082openalex-snapshot
PARAS: system-level concurrent partitioning and scheduling
inferred← citeshttps://doi.org/10.5555/320080.320122openalex-snapshot
Balance scheduling: weighting branch tradeoffs in superblocks
inferred← citeshttps://doi.org/10.5555/339492.340024openalex-snapshot
Lower bound on latency for VLIW ASIP datapaths
inferred← citeshttps://doi.org/10.5555/517554.825772openalex-snapshot
Efficient Backtracking Instruction Schedulers
inferred← citeshttps://doi.org/10.5555/602902.602904openalex-snapshot
Physical planning with retiming
inferred← citeshttps://doi.org/10.5555/602902.603016openalex-snapshot
Exploring performance tradeoffs for clustered VLIW ASIPs
inferred← citeshttps://doi.org/10.5555/645989.674316openalex-snapshot
Effective compilation support for Variable Instruction Set Architecture
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.