(1/2) 2/45 HPC top runner application programmer PC-9801F N88-BASIC Quick BASIC + DOS ( ) BCB Windows Percolation, Event-driven MD ActionScript Flash

Similar documents
I 2 tutimura/ I 2 p.1/??

debug ( ) 1) ( ) 2) ( ) assert, printf ( ) Japan Advanced Institute of Science and Technology

C

あっと! デジタル ver.7


double float


コンピュータ概論

¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse

01_OpenMP_osx.indd

r07.dvi

ohp07.dvi

C言語によるアルゴリズムとデータ構造

超初心者用

新・明解C言語 実践編

A/B (2010/10/08) Ver kurino/2010/soft/soft.html A/B

r03.dvi

3.1 stdio.h iostream List.2 using namespace std C printf ( ) %d %f %s %d C++ cout cout List.2 Hello World! cout << float a = 1.2f; int b = 3; cout <<

2

ohp03.dvi


PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU

WinHPC ppt

A/B (2018/10/19) Ver kurino/2018/soft/soft.html A/B

新版明解C言語 実践編

: CR (0x0d) LF (0x0a) line separator CR Mac LF UNIX CR+LF MS-DOS WINDOWS Japan Advanced Institute of Science and Technology

新版 明解C++入門編

Java (7) Lesson = (1) 1 m 3 /s m 2 5 m 2 4 m 2 1 m 3 m 1 m 0.5 m 3 /ms 0.3 m 3 /ms 0.6 m 3 /ms 1 1 3

新コンフィギュレータのフレームワークについて

DCL intro Manual for Ubuntu11.10

年計グラフ作成システム

Condition DAQ condition condition 2 3 XML key value


/

RX501NC_LTE Mobile Router取説.indb

tutorial_lc.dvi


workshop Eclipse TAU AICS.key

DOPRI5.dvi

double 2 std::cin, std::cout 1.2 C fopen() fclose() C++ std::fstream 1-3 #include <fstream> std::fstream fout; int a = 123; fout.open( "data.t

8 / 0 1 i++ i 1 i-- i C !!! C 2

cat A

OpenMP (1) 1, 12 1 UNIX (FUJITSU GP7000F model 900), 13 1 (COMPAQ GS320) FUJITSU VPP5000/64 1 (a) (b) 1: ( 1(a))

,…I…y…„†[…e…B…fi…O…V…X…e…•‡Ì…J†[…l…‰fi®“ì‡Ì›Â”‰›»pdfauthor

OpenCV IS Report No Report Medical Information System Labratry


C による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 新装版 1 刷発行時のものです.

r08.dvi

P05.ppt

関数の動作 / printhw(); 7 printf(" n"); printhw(); printf("############ n"); 4 printhw(); 5 関数の作り方 ( 関数名 ) 戻り値 ( 後述 ) void である. 関数名 (

平成25年度「アウトリーチ(訪問支援)研修事業」報告書

/* do-while */ #include <stdio.h> #include <math.h> int main(void) double val1, val2, arith_mean, geo_mean; printf( \n ); do printf( ); scanf( %lf, &v

講習No.12

ohp08.dvi

1 2

untitled

INDEX

INDEX

1002goody_bk_作業用

外為オンライン FX 取引 操作説明書


CashDrawer ライブラリ API 仕様書 2014/07/09 CashDrawer ライブラリ API 仕様書 Rev / 10

x(t) + t f(t, x) = x(t) + x (t) t x t Tayler x(t + t) = x(t) + x (t) t + 1 2! x (t) t ! x (t) t 3 + (15) Eular x t Teyler 1 Eular 2 Runge-Kutta

1-4 int a; std::cin >> a; std::cout << "a = " << a << std::endl; C++( 1-4 ) stdio.h iostream iostream.h C++ include.h 1-4 scanf() std::cin >>

Tiny Basic for Windows 2 1 Tiny Basic for Windows Tiny Basic for Windows tbasic tbasic BASIC BASIC Visual Basic BASIC BASIC BASIC tbasic Help BASIC tb

目 目 用方 用 用 方

cpp1.dvi

解きながら学ぶJava入門編

exec.dvi

大学等における社会人の受け入れ状況調査

SystemC 2.0を用いた簡易CPUバスモデルの設計

main

program.dvi

C¥×¥í¥°¥é¥ß¥ó¥° ÆþÌç



DX-PC55_−ç(0)-A


( ) ver.2015_01 2

2表紙

joho09.ppt

fp.gby

(2 Linux Mozilla [ ] [ ] [ ] [ ] URL 2 qkc, nkc ~/.cshrc (emacs 2 set path=($path /usr/meiji/pub/linux/bin tcsh b

tuat2.dvi

3.2 Linux root vi(vim) vi emacs emacs 4 Linux Kernel Linux Git 4.1 Git Git Linux Linux Linus Fedora root yum install global(debian Ubuntu apt-get inst

9 8 7 (x-1.0)*(x-1.0) *(x-1.0) (a) f(a) (b) f(a) Figure 1: f(a) a =1.0 (1) a 1.0 f(1.0)

kiso2-03.key

listings-ext

L2plusスイッチバージョンアップ手順書

P06.ppt

/ SCHEDULE /06/07(Tue) / Basic of Programming /06/09(Thu) / Fundamental structures /06/14(Tue) / Memory Management /06/1

WinDriver PCI Quick Start Guide

untitled

解きながら学ぶC++入門編

Microsoft PowerPoint - CproNt02.ppt [互換モード]

FTDI Driver Error and Recovery Procedure Check FTDI driver operation Rev :OK, Rev :NG, Rev :NG May 11, 2017 CHECK FTDI DRIVER

XMPによる並列化実装2

MPI MPI MPI.NET C# MPI Version2

[1] #include<stdio.h> main() { printf("hello, world."); return 0; } (G1) int long int float ± ±

II ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 D

Transcription:

1/45 8 Outline 1. 2. 3. 4. Jun. 6, 2013@ A

(1/2) 2/45 HPC top runner application programmer PC-9801F N88-BASIC Quick BASIC + DOS ( ) BCB Windows Percolation, Event-driven MD ActionScript Flash MPI MD

(2/2) ( ) 3/45 MS-DOS RPG ( BGM ) ( BGM ) RPG ( BGM) Windows (DOS ) 2 ( BGM) Flash

4/45 CPU MPI

5/45

6/45

(1/3) 7/45 ( ) Michael A. Jackson, 1975

(2/3) 8/45 It is not always true that a fast runner is a good soccer player. H. Watanabe, 2012

(3/3) 9/45

10/45 (1 ) (4 ) (1 )

Q. A. 11/45

Q. A. 12/45 ( ) ( )

13/45 sort+diff

14/45 ( ) sort + diff sort + diff print sort diff

15/45

sort+diff 1 (1/2) 16/45 ( ) (Exclusive Grid ) (Non-Exclusive Grid )

sort+diff 1 (2/2) 17/45 O(N) O(N^2) configuration O(N^2) ( ) ( ) O(N) O(N^2) 1 diff $./on2code sort > o2.dat $./on1code sort > o1.dat $ diff o1.dat o2.dat diff

sort+diff 2 (1/2) 18/45 3 26 Domain C 6 Domain A Domain B

sort+diff 2 (2/2) 19/45 (1) ( ) (2) (proc012.dat ) (3) ( ) ( test1/ test2/ ) (4) (sort + diff ) $ sort test1/proc000.dat > test1/proc000s.dat $ sort test2/proc000.dat > test2/proc000s.dat $ diff test1/proc000s.dat test2/proc000s.dat

sort+diff 3 (1/2) 20/45 configuration

sort+diff 3 (2/2) 21/45 ( ) ( ) ( ) (proc???.dat) cat sort + diff $./serial sort > serial.dat $./parallel $ cat proc???.dat sort > parallel.dat $ diff serial.dat parallel.dat

22/45

23/45

24/45 (Y/y) CVS, Subversion, Git checkout update commit commit checkout update

25/45 1) 2) 3) A 4) B B A

26/45 1) 2) 5) 3) 6) B A 4) A 7) ( ) C

27/45 ( ) ( ) ( )

28/45 A C B (1) ( ) (2) (Subversion ) (3) ( )

29/45 Subversion tag trunk tags 130606_bug Subversion ( ) ( )

(1/2) Segmentation Fault ( ) print (gdb ) printf 1 ; printf 2 ; printf 3 ; 1 12 30/45

(2/2) const int N = 10; double data[n]; double func(int index){ return data[index]; index=10 } 31/45 index 0 9 ( ) assert (if ) #include <assert.h> double func(int index){ assert(index<n); assert } assert Assertion failed: (i<10), function func, file test.cc, line 7.

N N rand 0 RAND_MAX (RAND_MAX=2147483647) RAND_MAX 0 1 double myrand_double (void){ return (double)(rand())/(double) (RAND_MAX); } 32/45 int myrand_int (const int N){ return (int)(myrand_double()*n); } rand RAND_MAX myrand_int N const int N = 10; double data[n]; int index = myrand_int(n); // ( ) return data[index]; print +assert

(1/2) 33/45 Input A Main Kernel Ver. 1 Observe Energy OK Input B Main Kernel Ver. 2 Observe Energy NG Observe Pressure Input B ( ) Input B Input B Main Kernel Ver. 1 Observe Energy OK? NG?

(2/2) 34/45 ( ) (2) ( ) (1) Rev. 1 Rev. 2 Rev. 3 Rev. 4 Rev. 5 (3) Rev. 2 Rev. 3 diff

35/45 ( ) ( ) ( ) print assert ( ) ( )

36/45

37/45 PD

38/45 ( )

39/45

40/45 SourceForge.net, SourceForge.jp, GitHub... google sites

SorceForge.net 41/45 http://mdacp.sourceforge.net/ sourceforge.net/projects/mdacp/stats/traffic

SorceForge.jp SourceForge 42/45 http://qcad.sourceforge.jp/ http://sourceforge.jp/projects/qcad/devel SF.jp

GitHub 43/45 https://github.com/kaityo256 https://github.com/kaityo256/flash/blob/ master/sentos/sentos.as SNS

44/45 Academia ( )

45/45