Previous: Implementation Up: Implementation Next: Parallel Reverberation
Figure 2.1. Kiwi Overview
Figure 2.1 shows the flow of information between Kiwi objects. The score, provided by the composer, is converted into a linked list of Notes, which are stored in the ScoreList. Then several Processors are created. The number of Processors created is given by the user, and depends on the size and usage load of the user's computer. Tasks are assigned to these Processors by a Scheduler. The Scheduler uses the InstrTable to construct a instance tree of Sound objects for each note. The instance tree forms an algorithm supplied by the composer which computes the next sample for a particular note. When each Task terminates, the Processor passes it to the Collector, which sums samples from each Note and builds a sound file. We now examine each of these objects in turn.