Introduction Name: Jani Peusaari Office: 6608 Contact: Reception hours: Wednesday 13-14.

Slides:



Advertisements
Similar presentations
Kalpesh Vyas & Seward Khem
Advertisements

Course Web Site – Also linked from Blackboard Course Materials – Excel Tutorials – Access Tutorials – PPT.
TS 313 Multimedia Applications Welcome to TS 313 Multimedia Applications There is no audio lecture associated with this set of introduction slides Refer.
Introduction CSCI 444/544 Operating Systems Fall 2008.
1 Finding the Sample Mean  Given: The times, in seconds, required for a sample of students to perform a required task were: 6,  Find the sample mean.
1 Distributed Computing Algorithms CSCI Distributed Computing: everything not centralized many processors.
1 CS4513 Distributed Computing Systems Bob Kinicki Term D04.
CS101- Lecture 11 CS101 Fall 2004 Course Introduction Professor Douglas Moody –Monday – 12:00-1:40 – – –Web Site: websupport1.citytech.cuny.edu.
Administrivia- Introduction CSE 373 Data Structures.
Cloud Computing Lecture #1 Parallel and Distributed Computing Jimmy Lin The iSchool University of Maryland Monday, January 28, 2008 This work is licensed.
CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
1 Netprog 2002 Network Terminology Motivation, Terminology, Layered systems (and other random stuff)
On the Task Assignment Problem : Two New Efficient Heuristic Algorithms.
Introduction Name: Jani Peusaari Office: 6608 Contact: Reception hours: Tuesday
Microsoft® Small Basic Sharing Code Estimated time to complete this lesson: 1 hour.
1.1 Course summary SO 2013_2014_QP. 1.2 Outline Goals Competences Methodology Course scheduling Evaluation
Physics 215–Elementary Modern Physics Everyone Pick Up: Syllabus Student Info sheet – fill it out 8/27
CS 470/570:Introduction to Parallel and Distributed Computing.
Welcome to Back to School Night! Mrs. Cooperman Mrs. Swenson (Mrs. Engelhardt) Ms. Walsh 7 th Grade Pre-Algebra: CMP3 Connected Mathematics Project
WEEK 1 CS 361: ADVANCED DATA STRUCTURES AND ALGORITHMS Dong Si Dept. of Computer Science 1.
1 ITQ 2009 at Bilston Resource Centre Information Technology NVQ 2009 Use the ARROW keys to move to next slide.
CGS3066: Web Programming and Design Summer 2014 Instructor Mir Anamul Hasan.
Exercise problems for students taking the Programming Parallel Computers course. Janusz Kowalik Piotr Arlukowicz Tadeusz Puzniakowski Informatics Institute.
Introduction CSE 1310 – Introduction to Computers and Programming
EMT1111 Logic and Problem Solving Dr. José M. Reyes Álamo Lecture 1.
Computer Networks CEN 5501C Spring, 2008 Ye Xia (Pronounced as “Yeh Siah”)
Typing –Keyboard control and speed development. Basic computer - Knowledge and component of computer and how to operate it. Ms Office package-Has word.
Android Platform. Course Instructor Yourself? Lectures, Labs, Text-Book Moodle Course Syllabus Online Resources Assessment Deadlines Code of professional.
1 Introduction to Operating Systems 9/16/2008 Lecture #1.
ITCS 4/5145 Cluster Computing, UNC-Charlotte, B. Wilkinson, 2006outline.1 ITCS 4145/5145 Parallel Programming (Cluster Computing) Fall 2006 Barry Wilkinson.
Fall 2000M.B. Ibáñez Lecture 01 Introduction What is an Operating System? The Evolution of Operating Systems Course Outline.
1 Scheduling CEG 4131 Computer Architecture III Miodrag Bolic Slides developed by Dr. Hesham El-Rewini Copyright Hesham El-Rewini.
Welcome to Back to School Night. Mrs. Cooperman (Mrs
2001 Networking Operating Systems (CO32010) 1. Operating Systems 2. Processes and scheduling 3.
MIS 300: Introduction to Management Information Systems Yong Choi School of Business Administration CSU, Bakersfield.
Leena Razzaq Office: 310BWVH Office hours: Monday 11am-1pm or by appointment jys.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 March 01, 2005 Session 14.
CS1201: Programming Language 2 C++(Course Introduction) Level 2 Nouf Aljaffan 1 st Term Nouf Aljaffan (C) CSC 1201 Course at KSU.
المحاضرة الاولى Operating Systems. The general objectives of this decision explain the concepts and the importance of operating systems and development.
CSE/ISE 308 Software Engineering Team Organization.
IPC144 An Introduction to Programming Using C. Instructor Murray Saul Office: Rm –Office hours are posted on my IPC144 web page or on bulletin board.
Quantitative Methods in Geography Geography 391. Introductions and Questions What (and when) was the last math class you had? Have you had statistics.
BASIC INTERNET PROTOCOLS: http, ftp, telnet. Mirela Walczak.
Introduction to Computing Muhammad Saeed. Topics Course Description Overview of Areas Contact Information.
Forecasting Steps and Deadlines Attend a running start orientation at Clark (contact running start office for make up dates if you.
INF 117 Project in Software Engineering Lecture Notes -Winter Quarter, 2008 Michele Rousseau Set 1.
Course Overhead. 1.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 9 th Edition, Jan 12, 2012.
CDA 3100 Fall2009. Special Thanks Thanks to Dr. Xiuwen Liu for letting me use his class slides and other materials as a base for this course.
1 Introduction to Data Communication Networks ISQS 3349, Spring 2000 Instructor: Zhangxi Lin Office: BA 708 Phone: Homepage:
Chapter 2 Process Management. 2 Objectives After finish this chapter, you will understand: the concept of a process. the process life cycle. process states.
©2008 LWW Chapter 2 Winning Tactics for the First Day of Class.
INSTRUCTIONS FOR WORK ON 8/27/15 EXERCISES 1. EXTRA CREDIT # 1 YOU MUST SHOW YOUR WORK TO ONE OF THE TEACHING ASSISTANTS IN CLASS WHEN DONE. THE TA WILL.
Administrative Preliminaries Computer Architecture.
RN/BSN Online Program Online Success! Technical Readiness Connect with Your Instructor Develop a Schedule Be Organized.
The Steppings Library Delegation and Monitoring story MOVES FOLIO Course.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington 1.
CT1503 Network Operating System
Computer Science 2 What’s this course all about?
Introduction to Algorithms
Introduction to Data Structures and Algorithms
Course Description Algorithms are: Recipes for solving problems.
Chapter 4 Data-Level Parallelism in Vector, SIMD, and GPU Architectures Topic 17 NVIDIA GPU Computational Structures Prof. Zhang Gang
CDA 3100 Summer 2011.
CPSC 441: Computer Communications
CDA 3100 Spring 2010.
General Packet Radio Service (GPRS), 2 credits
Course Description Algorithms are: Recipes for solving problems.
Presentation transcript:

Introduction Name: Jani Peusaari Office: 6608 Contact: Reception hours: Wednesday 13-14

Timetable wk 1: Introduction, terms, other basic stuff wk 2: Complexity analysis wk 3: Abstract models wk 4: Abstract models, architectures wk 5: Interconnections, embedding wk 6: Communications wk 7: Practical issues, coding assignment

Exercises Not mandatory in general No extra points from attendance Internet: –Not all answers / explanations published in the web Course web page –Changes to schedule, questions, feedback

Terms Task – Tehtävä –General description of a processing element Process – Prosessi –A process runs in some arbitrary computer Thread – Säie –”Lightweight process”, threads run in some arbitrary process Communication –Between tasks, processes, threads

Terms Shared Memory – Jaettu muisti Distributed Memory – Hajautetty muisti Architecture –Way to connect Processors to each other Problem size: n, N Number of tasks: p, P Memory: m, M Time to complete certain operation: t, T

Example 1 The job is to estimate how long it takes to count n numbers with p people, One person calculates n numbers in (n-1)t c. Let us presume, that there are eight persons and the numbers are easily divided among them. Transferring the results takes t w. How long it takes for n people if: a) They are sitting in a circle b) They are sitting in 2 by 4 rows.

Example 2 One person uses (n-1)t c to count n numbers. Is it possible that p persons solves the problem in less time than (n-1)t c /p ? Justify your answer !

Example 3 What if the eight people from assignment number 1 calculate partial sums on the blackboard so that everyone can see the others results as soon as they are ready. How long a time it takes now and how about assignment number 2?