On the public citation graph
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraing Programming
0 signed · 43 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45578-7_52openalex-snapshot
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
inferredcites →https://doi.org/10.1007/3-540-54444-5_89openalex-snapshot
Optimal instruction scheduling using constraint logic programming
inferredcites →https://doi.org/10.1007/978-1-4615-1479-4openalex-snapshot
Constraint - based scheduling : applying constraint programming to scheduling problems
inferredcites →https://doi.org/10.1007/978-3-540-24800-2openalex-snapshot
Project Scheduling with Time Windows and Scarce Resources
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_41openalex-snapshot
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint
inferredcites →https://doi.org/10.1007/978-3-642-57506-8openalex-snapshot
Project Scheduling with Time Windows: From Theory to Applications
inferredcites →https://doi.org/10.1007/s10601-005-0552-yopenalex-snapshot
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint
inferredcites →https://doi.org/10.1007/s10951-005-2862-8openalex-snapshot
Data-Dependency Graph Transformations for Instruction Scheduling
inferredcites →https://doi.org/10.1016/s0096-0551(98)00002-2openalex-snapshot
Scheduling expression DAGs for minimal register need
inferredcites →https://doi.org/10.1016/s0898-1221(97)00184-3openalex-snapshot
Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
inferredcites →https://doi.org/10.1109/71.372778openalex-snapshot
An optimal instruction scheduler for superscalar processor
inferredcites →https://doi.org/10.1109/92.555991openalex-snapshot
Time-constrained code compaction for DSPs
inferredcites →https://doi.org/10.1109/micro.2004.27openalex-snapshot
Optimal Superblock Scheduling Using Enumeration
inferredcites →https://doi.org/10.1109/tc.1985.1676531openalex-snapshot
An Optimal Instruction-Scheduling Model for a Class of Vector Processors
inferredcites →https://doi.org/10.1142/s0218213008003765openalex-snapshot
OPTIMAL BASIC BLOCK INSTRUCTION SCHEDULING FOR MULTIPLE-ISSUE PROCESSORS USING CONSTRAINT PROGRAMMING
inferredcites →https://doi.org/10.1145/2166.357217openalex-snapshot
Postpass Code Optimization of Pipeline Constraints
inferredcites →https://doi.org/10.1145/349299.349318openalex-snapshot
Optimal instruction scheduling using integer programming
inferredcites →https://doi.org/10.1145/384196.384217openalex-snapshot
ILP-based Instruction Scheduling for IA-64
inferredcites →https://doi.org/10.1145/581630.581633openalex-snapshot
A near-optimal instruction scheduler for a tightly constrained, variable instruction set embedded processor
inferredcites →https://doi.org/10.1147/rd.385.0577openalex-snapshot
Instruction scheduling in the TOBEY compiler
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1175openalex-snapshot
Classification and generation of schedules for VLIW processors
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_48openalex-snapshot
On Universal Restart Strategies for Backtracking Search
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_7openalex-snapshot
An Application of Constraint Programming to Superblock Instruction Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-32548-9_29openalex-snapshot
Improvements of Instruction Scheduling
inferred← citeshttps://doi.org/10.1007/s10732-007-9051-1openalex-snapshot
Learning heuristics for basic block instruction scheduling
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/j.micpro.2014.04.004openalex-snapshot
Instruction selection and scheduling for DSP kernels
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80008-8openalex-snapshot
Backtracking Search Algorithms
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1109/dasip.2016.7853802openalex-snapshot
Code generation for a SIMD architecture with custom memory organisation
inferred← citeshttps://doi.org/10.1109/ictai.2007.143openalex-snapshot
Granule Based Intertransaction Association Rule Mining
inferred← citeshttps://doi.org/10.1109/ictai.2007.38openalex-snapshot
On Portfolios for Backtracking Search in the Presence of Deadlines
inferred← citeshttps://doi.org/10.1109/rteict42901.2018.9012401openalex-snapshot
Cluster-Based Scheduling Algorithm
inferred← citeshttps://doi.org/10.1109/tkde.2009.17openalex-snapshot
Learning Heuristics for the Superblock Instruction Scheduling Problem
inferred← citeshttps://doi.org/10.1142/s0218213008004187openalex-snapshot
PORTFOLIOS WITH DEADLINES FOR BACKTRACKING SEARCH
inferred← citeshttps://doi.org/10.1145/2628071.2628090openalex-snapshot
Bounded memory scheduling of dynamic task graphs
inferred← citeshttps://doi.org/10.1145/2712386.2712399openalex-snapshot
Programming support for reconfigurable custom vector architectures
inferred← citeshttps://doi.org/10.26076/44c2-3908openalex-snapshot
Constraint Programming Techniques for Generating Efficient Hardware Architectures For Field Programmable Gate Arrays
inferred← citeshttps://doi.org/10.70675/70d08bbfz72fez450fz87e6z7b635bb238a1openalex-snapshot
Benchmark-driven approaches to performance modeling of multi-core architectures
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.