Saturday, March 6, 2010

CP5080/CP5090: Lecture Notes 4th Mar 10

Thursday will be used as discussion groups

Next week, read through Dom, then Pedro

Friday will be used for presentations, location is TBA

Papers will be stored on LearnJCU, as well as dunk. Or, emailed out.

There will be two papers that will be used for group discussion
--> dum.pdf * Week 3
--> pedro.pdf * Week 4

Focusing on how to talk about presenting papers

Why was this particular paper picked? (Parallel Prefix Computation)
  • The paper is a landmark
  • Although printed in 1979, it is NOT obsolete
  • Short, only 7-8 pages
  • Author/s are still alive
  • Small references, --> at time, not many were available
Meta Data
  • What isn't text
  • --> Bibliography
  • --> Names
  • --> Etc
Content of Paper
Important
Presenter is obliged only to present which elements in depth. Depends on target audience. Generally for our presentation, audience will be much like ourselves.

Points
  • What is the idea/s of the paper?
  • --> Wider framework
  • --> How does this fit into the frame of computer science?
  • What are the authors trying to do?
  • What is the motivation?
  • --> Good way to convey points to audience
  • Relationships among results, what is the core?
How is the paper organised?
Functions? Logically organised?
Proofs? Defintions
--> THings well defined?
Originality and significance?
Does the paper have structural errors?

In ~1970, knowledge was limited 0 how to take sequential methods and make them parallel

Explaining the paper
Motivation for tjheir work

Binary \
Radix (base 2)
Notation /
Integer addition

Binary addition
Carry the one
(1) (1) (1)
1 0 0 1 Textbook approach
+ 1 1 1 1
--------------
1 1 0 0 0

Finite State Automation

1 1 1 0 1 0 1 1
A B A B A B A B

Parallel Prefix Computation

Author's Motivation
Takes --------------> Boolean Circuit
FSA in parallel
\________________________/
This was a novel idea in the 1970's. The 'hook' of this paper is integer addition

Responsibility of the presenter -> What you think is central to the paper

Key point of the paper

ADDER_SIZE(n) = c.n
ADDER_DEPTH(n) = c.log2n

Cardinal Points

Lacunae - Paper missing on element, gap

Paper Overview
  1. Introduction
  2. Parallel Prefix Computation
  3. FSA --> Boolean Circuit via PPC
  4. Application of (3) ... addition FSA
A good presenter should allow the audience to read the paper profitably. Should provide a road map of the presentation and paper.

Originality and significance
Original result

Bullet points of paper
  • How to present
  • How to read intelligently.
Notes still incomplete.

No comments:

Post a Comment