Privacy Policy  |  About Peer Evaluation  |  Terms
Reading PAGE

Peer Evaluation activity

Trusted by 1
Downloads 1
Views 4
Followed by 1
View details

Total impact ?

    Invite this peer to...

    Send a

    Send

    Edward has...

    Trusted 0
    Reviewed 0
    Emailed 0
    Shared/re-used 0
    Discussed 0
    Invited 0
    Collected 0
    View details

     

    This was brought to you by:

    block this user Edward Lee Trusted member

    Professor

    University of California, Berkeley

    Statically Scheduling Communication Resources in Multiprocessor DSP Architectures

    Export to Mendeley

    In statically scheduled multiprocessors inter-processor communication resources can be scheduled by determining, at compile time, the order in which processors require access to shared resources and enforcing this order at run time. We show how to choose an access order such that, under certain assumptions, imposing that order incurs no performance penalty. 1.0 Introduction In this paper we address multiprocessor implementation of applications that are specified as Synchronous Data Flow (SDF) graphs. We recall that in a dataflow representation, an algorithm is represented as a graph where nodes (actors) are individual computations and directed arcs between them represent flow of data (tokens). SDF refers to a subclass of dataflow graphs where the actors lack data dependency in their firing patterns. I.e. the number of tokens produced and consumed in each of the output and input arcs of each actor is constant and fixed at compile time. In this paper we assume that the application is a...

    Oh la laClose

    Your session has expired but don’t worry, your message
    has been saved.Please log in and we’ll bring you back
    to this page. You’ll just need to click “Send”.

    Your evaluation is of great value to our authors and readers. Many thanks for your time.

    Review Close

    Short review
    Select a comment
    Select a grade
    You and the author
    Anonymity My review is anonymous( Log in  or  Register )
    publish
    Full review
    Display full review
    Close

    When you're done, click "publish"

    Only blue fields are mandatory.

    Relation to the author*
    Overall Comment*
    Anonymity* My review is anonymous( Log in  or  Register )
     

    Focus & Objectives*

    Have the objectives and the central topic been clearly introduced?

    Novelty & Originality*

    Do you consider this work to be an interesting contribution to knowledge?

    Arrangement, Transition and Logic

    Are the different sections of this work well arranged and distributed?

    Methodology & Results

    Is the author's methodology relevant to both the objectives and the results?

    Data Settings & Figures

    Were tables and figures appropriate and well conceived?

    References and bibliography

    Is this work well documented and has the bibliography been properly established?

    Writing

    Is this work well written, checked and edited?

    Write Your Review (you can paste text as well)
    Please be civil and constructive. Thank you.


    Grade (optional, N/A by default)

    publish
    Cancel
    N/A 1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6 6.5 7 7.5 8 8.5 9 9.5 10
    Close

    Your mailing list is currently empty.
    It will build up as you send messages
    and links to your peers.

     No one besides you has access to this list.
    Close
    Enter the e-mail addresses of your recipients in the box below.  Note: Peer Evaluation will NOT store these email addresses   log in
    Your recipients

    Your message:

    Your email : Your email address will not be stored or shared with others.

    Your message has been sent.

    Description

    New Full text for this article was not available? Send a request to the author(s).
    Title : Statically Scheduling Communication Resources in Multiprocessor DSP Architectures
    Abstract : In statically scheduled multiprocessors inter-processor communication resources can be scheduled by determining, at compile time, the order in which processors require access to shared resources and enforcing this order at run time. We show how to choose an access order such that, under certain assumptions, imposing that order incurs no performance penalty. 1.0 Introduction In this paper we address multiprocessor implementation of applications that are specified as Synchronous Data Flow (SDF) graphs. We recall that in a dataflow representation, an algorithm is represented as a graph where nodes (actors) are individual computations and directed arcs between them represent flow of data (tokens). SDF refers to a subclass of dataflow graphs where the actors lack data dependency in their firing patterns. I.e. the number of tokens produced and consumed in each of the output and input arcs of each actor is constant and fixed at compile time. In this paper we assume that the application is a...
    Subject : unspecified
    Area : Computer Science
    Language : English
    Affiliations : 
    Url : http://ptolemy.thomson-csf.fr/mirrors/ptolemy.eecs.berkeley.edu/ptolemy/papers/ordering_asilomar94.ps.Z
    Doi : 10.1.1.47.5865

    Leave a comment

    This contribution has not been reviewed yet. review?

    You may receive the Trusted member label after :

    • Reviewing 10 uploads, whatever the media type.
    • Being trusted by 10 peers.
    • If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.

    Does this seem fair to you? Please make your suggestions.

    Please select an affiliation to sign your evaluation:

    Cancel Evaluation Save

    Please select an affiliation:

    Cancel   Save

    Edward's Peer Evaluation activity

    Edward has...

    Trusted 0
    Reviewed 0
    Emailed 0
    Shared/re-used 0
    Discussed 0
    Invited 0
    Collected 0
    Invite this peer to...
    Title
    Start date (dd/mm/aaaa)
    Location
    URL
    Message
    send
    Close

    Full Text request

    Your request will be sent.

    Please enter your email address to be notified
    when this article becomes available

    Your email


     
    Your email address will not be shared or spammed.