We aren't endorsed by this school

CS 385 - Stevens Study Resources
  • 14 Pages CUDA-Concepts
    CUDA-Concepts

    School: Stevens

    Scalable Parallel with Is CUDA the parallel programming model that application developers have been waiting for? FOCUS Scalable Parallel FOCUS with _syncthreads() barrier synchronization Scalable Parallel threadIdx 0, 1, 2, ., blockDim1 blockI

  • 1 Page project
    Project

    School: Stevens

    CS 385 Semester Project: Idea approval by Fri, Sep 19, 1pm Prof. Dietrich Assignment If you havent done so already, read Part VI in GPU Gems 3, or the PDF from GPU Gems 2 on the course web site, the CUDA-related pages at www.nvidia.com, and the Gen

  • 3 Pages hw00
    Hw00

    School: Stevens

    CS 385 Homework Assignment 0 Due by Tue, Sep 2, 2008. Prof. Dietrich You are expected to learn enough of the C programming language to implement the algorithms covered in class. There is no way to learn a programming language other than by writing pr

  • 1 Page hw6
    Hw6

    School: Stevens

    CS 385 Homework Assignment 6 Due Nov 17, 1:00pm Prof. Dietrich Assignment Use the le word4.dat and graph.dat (created in homework assign- ment 4) in a program which implements the word game. In this game, the user is asked to enter two ve letter wor

  • 1 Page hw2
    Hw2

    School: Stevens

    CS 385 Homework Assignment Due by Fri, Sep 19, 1pm Prof. Dietrich Assignment Do Levitin, problem 6, page 83 and problem 3, page 106. Implement both InsertionSort and QuickSort in C. Write a program sorttest.c which asks the user for two integers

  • 1 Page shw
    Shw

    School: Stevens

    CS 385 Special Homework Assignment Due Nov 24, 1:00pm Prof. Dietrich Assignment Write a 2-page summary of either the article Scalable Parallel Programming with CUDA, in ACM Queue No. 6 Vol. 2, page 40, Spring 2008, or the article A Closer Look at GP

  • 1 Page hw5
    Hw5

    School: Stevens

    CS 385 Homework 5 Due by Nov 3 1:00pm Prof. Dietrich Assignment 1. Do exercises 1 and 5 on page 176. 2. Apply the strong connected component nding algorithm discussed in class to the directed graphs in exercises 1 and 9a on pages 176-177. Recall tha

  • 1 Page hw2-ques3-sol
    Hw2-ques3-sol

    School: Stevens

    CS385: Solutions for Problem 3, Page 106 Gadget Testing Drop the rst gadget from oors n , 2 n , and so on until either the oor i n a drop from which makes the gadget malfunction is reached or no such oor in this sequence is encountered before the

Back to course listings