Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Automatic Synthesis for Distributed Systems

Yang Yang

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2009-38
March 11, 2009

http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-38.pdf

Distributed architectures are widely used in various application domains to cope with the increasing system complexity. In this work, we focus on finding a mapping from an application description to a distributed architecture platform, to optimize certain objectives while satisfying design constraints. Specifically, the mapping problem includes allocating functional tasks to distributed processors and allocating messages to buses, scheduling tasks and messages, as well as deciding buffer sizes. This synthesis problem is still largely open nowadays. In three case studies, we developed a set of algorithms to address various aspects of mapping, including applying on different types of architecture platforms, exploring different design variables and optimizing different optimization objectives.

Advisor: Alberto L. Sangiovanni-Vincentelli


BibTeX citation:

@mastersthesis{Yang:EECS-2009-38,
    Author = {Yang, Yang},
    Title = {Automatic Synthesis for Distributed Systems},
    School = {EECS Department, University of California, Berkeley},
    Year = {2009},
    Month = {Mar},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-38.html},
    Number = {UCB/EECS-2009-38},
    Abstract = {Distributed architectures are widely used in various application domains to cope with the increasing system complexity. In this work, we focus on finding a mapping from an application description to a distributed architecture platform, to optimize certain objectives while satisfying design constraints. Specifically, the mapping problem includes allocating functional tasks to distributed processors and allocating messages to buses, scheduling tasks and messages, as well as deciding buffer sizes. This synthesis problem is still largely open nowadays. In three case studies, we developed a set of algorithms to address various aspects of mapping, including applying on different types of architecture platforms, exploring different design variables and optimizing different optimization objectives.}
}

EndNote citation:

%0 Thesis
%A Yang, Yang
%T Automatic Synthesis for Distributed Systems
%I EECS Department, University of California, Berkeley
%D 2009
%8 March 11
%@ UCB/EECS-2009-38
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-38.html
%F Yang:EECS-2009-38