Application-Set Driven Architecture Exploration

Concept

Application-Set Driven Architecture Exploration is a design-space exploration methodology for custom processor architectures in which a target application set, rather than a single workload, is used to drive the search for optimal architectural configurations. The approach, presented as Chapter IV of Mehmet Ali Arslan's PhD thesis, combines constraint programming, Pareto-point analysis, and modulo scheduling to systematically generate and evaluate candidate architectures that balance competing design objectives.

First seen 6/9/2026

Last seen 6/9/2026

Evidence 1 chunks

Wiki v1

WIKI

Overview

Application-Set Driven Architecture Exploration is a methodology for designing custom processor architectures in which a set of target applications is used to constrain and drive the design-space exploration. The method is presented in Chapter IV ("Application-Set Driven Exploration for Custom Processor Architectures") of Mehmet Ali Arslan's PhD thesis, and forms part of a broader research effort on compiler–architecture co-design for embedded and smart-device processors that are expected to be both fast and energy efficient.

Rather than tuning a processor for a single representative kernel, the approach takes the collective demands of an application set as the primary input, and seeks architectural configurations that perform well across that set. This is particularly relevant for custom processor design, where architecture choices have a large impact on throughput, code size, storage, and data-rate requirements.

READ FULL ARTICLE →

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

3 connections

Code Generation for Custom Architectures using Constraint Programming ← mentions 90% 1e

Application-set driven architecture exploration is a topic covered in one of the included papers.

Pareto Points uses → 90% 1e

Application-set driven architecture exploration uses Pareto points to identify optimal architecture candidates.

Modulo Scheduling uses → 85% 1e

Modulo scheduling is used as background technique in application-set driven architecture exploration.

LINKED ENTITIES

3 links

Pareto Points USES Extracted graph relationship

Modulo Scheduling USES Extracted graph relationship

Code Generation for Custom Architectures using Constraint Programming MENTIONS Extracted graph relationship

CITATIONS

6 sources

6 citations — click to expand

[1] Application-Set Driven Architecture Exploration is the subject of Chapter IV ('Application-Set Driven Exploration for Custom Processor Architectures') of Mehmet Ali Arslan's PhD thesis, spanning pages 117–131. Arslan, Mehmet Ali — PhD thesis (Table of Contents)

[2] The chapter's background covers constraint programming (3.1, p. 120), Pareto points (3.2, p. 121), and modulo scheduling (3.3, p. 121). Arslan, Mehmet Ali — PhD thesis (Table of Contents)

[3] The approach has two main components: Pareto points generation (Section 5.1, p. 125) and modeling details (Section 5.2, p. 126). Arslan, Mehmet Ali — PhD thesis (Table of Contents)

[4] The case study (Section 6) covers automated Pareto points generation (6.1, p. 127) and candidate selection and evaluation (6.2, p. 131). Arslan, Mehmet Ali — PhD thesis (Table of Contents)

[5] The thesis is motivated by the need for smart devices that are both faster and more energy-efficient, motivating custom processor architectures. Arslan, Mehmet Ali — PhD thesis (Popular Science Summary)

[6] Chapter V ('Code Generation for a SIMD Architecture with Custom Memory Organisation', pp. 137–152) follows Chapter IV, sharing the constraint-programming foundation and the ePUMA target. Arslan, Mehmet Ali — PhD thesis (Table of Contents)