1 free read left. Create a free account for unlimited reading + AI research.
Create free accountWhitepaper
DiGRA
The paper argues that future game consoles and personal computers are likely to adopt symmetric multiprocessor architectures. It therefore proposes replacing the traditional sequential game loop with a concurrent design.
This paper argues that future game consoles and personal computers are likely to adopt symmetric multiprocessor architectures, and that the traditional sequential game loop must therefore be replaced with a concurrent design. The authors draw on parallel computing theory, including Flynn's hardware taxonomy, task-dependency graphs, dependency analysis, and Bernstein's conditions for parallelism, to build a model in which game tasks are organised as a cyclic task-dependency graph and executed by a scheduler across multiple worker threads. This model is implemented in a Concurrent Game Programming Framework, which provides synchronisation primitives, thread creation objects, and a task manager.
To test the approach, the authors decompose a sequential game loop of nineteen tasks for a 3D "capture the flag" car game, analysing flow, anti, and output dependencies between tasks to identify which can run concurrently. Three experiments were conducted. The first verified that the task manager adhered to dependency rules and achieved the expected concurrency. The second, run on a Hyper-Threaded Intel Pentium 4 at 2.80 GHz, compared a sequential loop against framework configurations with one, two, and four workers, averaging three runs across four game scenarios; the framework produced no gain on this two-logical-processor machine, which the authors attribute to the model requiring roughly three processors before a benefit appears. The third, run on a simulated four-processor system using Simics, showed frame-rate improvements over the sequential loop, with reported results of about 1.74 times the sequential rate at the best configuration.
The study's scope is limited to a single game prototype and simulated or small-scale hardware, and the evaluation relies on frame-rate measurements from a limited number of runs. The authors conclude that a game structured as a cyclic task-dependency graph is scalable across processor counts by adjusting the number of worker threads, though the broader claim about future console architectures remains a forward-looking assumption based on industry rumour rather than established fact.