Synthesis Oriented Scheduling of Multiparty Rendezvous in Transaction Level Models

Due to the large semantic gap between transaction level models and actual implementations, hardware syn-thesis based on system level models has been a great challenge. Aiming to close the semantic gap, we studied an approach that uses rendezvous to model communica-tion. By allowing both conjunctive and disjunctive com-position of rendezvous, the approach supports flexible communication patterns involving multiple processes. However, a practical issue of the model is the complexi-ty of scheduling of multiparty rendezvous, which is NP hard in general. This paper proposes an efficient sche-duling algorithm. It begins by encapsulating state tran-sition information of processes into a relation graph. It then creates a tree that relates edge combinations. The tree is used to guide the scheduler at run time to search for schedulable sets. Experimental results prove that this algorithm improves our scheduler significantly. The algorithm lays the ground for the synthesis of the com-munication and synchronization circuitry for the system. 1