Define a package contract for multi-dispatch execution graphs
Nadie ha tomado este issue todavía.
Evaluación
- Dificultad
- 5/5
- Tiempo estimado
- Más de una semana
- Aptitud para principiantes
- 30/100
Línea de trabajo
Start by mapping the public package schema and C++ data model to the proposed versioned execution graph, then review package verification and inspection entry points. Define the graph, resource, node, dependency, and diagnostic coverage described in the acceptance criteria. Done means deterministic round-tripping, validation tests for each listed failure, inspection counts and diagnostics, and a one-node compatibility fixture without a host scheduler.
Escrito por el modelo de indexación a partir del texto del issue.
Descripción
Problem
Compiler packages describe compiled artifacts, reflection, validation, and source metadata, but they cannot represent an operation that dispatches multiple artifacts over shared resources with explicit ordering and visibility requirements.
Repository runtimes commonly sequence initialization, transformation, reduction, scan, FFT, and aggregation kernels through temporary buffers. Treating each artifact as an independent package entry loses the resource lifetime, dependency, and synchronization contract needed by package verification and downstream runtime tooling.
Expected behavior
- Define a versioned, target-neutral execution graph document that can be embedded in or referenced by a compiler package.
- Represent graph-scoped external inputs, external outputs, and temporary resources with logical type, physical layout, allocation size/alignment, and lifetime.
- Represent dispatch, copy, fill, and barrier nodes with stable IDs and explicit dependency edges.
- Resolve dispatch nodes to packaged artifact identity, entry point, specialization values, resource binding coordinates, and dispatch geometry.
- Express resource access and memory visibility without encoding one target API's barrier enum.
- Permit conditional or repeated execution only when the control resource and finite bound are explicit; arbitrary host callbacks remain outside the portable contract.
- Preserve source/provenance metadata for graph nodes and referenced artifacts.
- Extend package verification and inspection to reject missing artifacts, missing interfaces, incompatible resource layouts, invalid ranges, dependency cycles, unordered conflicting accesses, and unsupported graph capabilities.
Acceptance criteria
- The public package schema and C++ data model round-trip a deterministic two-dispatch graph.
- Package verification checks every referenced artifact, entry point, resource binding, and physical layout before reporting the graph ready.
- Validation tests cover missing references, duplicate IDs, dependency cycles, unsafe barriers, invalid temporary lifetimes, and bounded-control errors.
- Package inspection reports graph/node/resource counts, readiness, and structured diagnostics.
- A compatibility fixture demonstrates that a single packaged compute artifact can be represented as a one-node graph without changing existing package consumers.
- The contract is documented as metadata and verification; it does not claim a built-in host scheduler or native runtime executor.
Real-world driver
At MLX commit 4367c73b60541ddd5a266ce4644fd93d20223b6e, operations including reductions, scans, FFTs, split-kernel matrix multiplication, and quantized paths sequence multiple compute pipelines and temporary allocations. CrossTL issue CrossGL/crosstl#1736 is implementing the translator-side repository-neutral graph and runtime validation needed to exercise these paths on DirectX and OpenGL. A compiler package contract would let both repositories exchange the same artifact and graph identities without making the translator depend on a compiler release.
- Lenguaje dominante
- C++
- Estrellas
- 0
- Forks
- 0
- Métricas de merge de PR
- Sin PR fusionados en 30 d
Preparar el entorno
Este proyecto no incluye contenedor de desarrollo, Dockerfile ni guía de contribución, así que la configuración corre por tu cuenta: empieza por su README y consulta nuestra guía para la primera contribución para los pasos generales.
Primeros pasos
- Lee el issue completo y luego la guía de contribución del proyecto.
- Comenta en el issue que vas a ocuparte — evita que dos personas hagan lo mismo.
- Haz un fork del repositorio y trabaja en una rama.
- Abre un pull request que haga referencia al número del issue.
Más de CrossGL/compiler
-
Dificultad 5/5 Más de una semana Aptitud para principiantes 25/100
-
Dificultad 5/5 Más de una semana Aptitud para principiantes 25/100
-
Dificultad 5/5 Más de una semana Aptitud para principiantes 35/100
-
Dificultad 5/5 Más de una semana Aptitud para principiantes 35/100
-
Track CrossTL project-porting report and source-remap compatibilityQuizá libre de nuevo Un pull request para esta issue se cerró sin fusionarse. Abierto
Dificultad 4/5 3-5 días Aptitud para principiantes 42/100
Todos los issues de CrossGL/compiler
Issues similares
-
Dificultad 2/5 1-3 horas Aptitud para principiantes 82/100
Los mantenedores suelen responder en 1 día
-
enhancement GUI maintainer-review
Dificultad 2/5 1-3 horas Aptitud para principiantes 66/100
aethersdr/AetherSDR#6681 · 1 comentario ·
Los mantenedores suelen responder en 1 día
-
Add string concatenationAbierto
Dificultad 2/5 1-3 horas Aptitud para principiantes 65/100
Los mantenedores suelen responder en 1 día
-
Bug
Dificultad 2/5 1-3 horas Aptitud para principiantes 70/100
Los mantenedores suelen responder en 1 día
-
Dificultad 2/5 1-3 horas Aptitud para principiantes 68/100
Los mantenedores suelen responder en 1 día