This is a thesis work for the M.Sc. degree in mathematics and computer science at the University of Stockholm, accomplished at SICS, Swedish Institute of Computer Science, Kista during the summer and autumn 1989. This thesis deals with hardware synthesis by space-time mappings. It is a method to map the steps in algorithm to distinct events in a space-time. If the pattern of an algorithm is known in advance then the algorithm can be implemented directly in the hardware when it is known where and then all steps in the algorithm will be executed then it can be determined where cells shall be placed and how they shall be connected to each other. I have developed a prototype, an Interactive Space-Time Scheduler, that can be used as an aid to schedule algorithms manually in the space-time. The user interface is developed in the Xerox/Interlisp-D environment.