Topological sorting

In this paper, we propose a new method to optimize the occupied memory of embedded software in the design phase based on DSL, T4 and Topological sort. A program is specified as a chain of tasks and the relationship between the tasks. The program is expressed by the dependence graph as a directed graph.

11p binhminhmuatrenngondoithonggio 09-06-2017 41 5   Download

It’s convenient to describe a data structure in terms of the operations performed, rather than in terms of implementation details. That means we should separate the concepts from particular implementations. When a data structure is defined that way, it’s called an abstract data type (ADT).

124p janeeyre_thanh 12-08-2013 77 16   Download