合肥生活安徽新聞合肥交通合肥房產(chǎn)生活服務(wù)合肥教育合肥招聘合肥旅游文化藝術(shù)合肥美食合肥地圖合肥社保合肥醫(yī)院企業(yè)服務(wù)合肥法律

        ECE 4122代做、代寫(xiě)C++編程語(yǔ)言
        ECE 4122代做、代寫(xiě)C++編程語(yǔ)言

        時(shí)間:2024-11-12  來(lái)源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯(cuò)



        ECE 4122/6122 Lab 4: CUDA-based John Conway’s Game of Life
        (100 pts)
        Category: CUDA
        Due: Tuesday November 8th
        , 2024 by 11:59 PM
        Objective:
        Implement a C++ CUDA program to run the Game of Life.
        Game Description:
        The Game of Life (an example of a cellular automaton) is played on an infinite two-dimensional 
        rectangular grid of cells. Each cell can be either alive or dead. The status of each cell changes 
        each turn of the game (also called a generation) depending on the statuses of that cell's 8 
        neighbors. Neighbors of a cell are cells that touch that cell, either horizontal, vertical, or diagonal 
        from that cell.
        The initial pattern is the first generation. The second generation evolves from applying the rules 
        simultaneously to every cell on the game board, i.e. births and deaths happen simultaneously. 
        Afterwards, the rules are iteratively applied to create future generations. For each generation 
        of the game, a cell's status in the next generation is determined by a set of rules. These simple 
        rules are as follows:
        • If the cell is alive, then it stays alive if it has either 2 or 3 live neighbors
        • If the cell is dead, then it springs to life only in the case that it has 3 live neighbors
        There are, of course, as many variations to these rules as there are different combinations of 
        numbers to use for determining when cells live or die. Conway tried many of these different 
        variants before settling on these specific rules. Some of these variations cause the populations 
        to quickly die out, and others expand without limit to fill up the entire universe, or some large 
        portion thereof.
        Assignment:
        1) Write a C++ application that takes up to 5 command line arguments to dynamically change the 
        number of processing threads ( >= 2), cell size, the image size and the type of memory allocation. 
        Below is an example
         ./Lab2 -c 5 -x 800 -y 600 -t NORMAL
        The flags
        -n is the number of threads per block (must be a multiple of **), 
        -c is used to denote the “cell size” with cells being square (c >=1), 
        -x is the window width, 
        -y is the window height
        -t is either NORMAL, PINNED, or MANAGED. This is the type of memory to use either normal, 
        pinned, or managed.
        The grid size used for calculations and display is the (window size)/(cell size).
        If one of the flags above is missing then automatically use the defaults:
        -n defaults to **
        -c defaults to 5
        -x and -y default to 800 by 600 respectively.
        -t defaults to NORMAL
        2) Write your code using three functions: one for the normal memory allocation, one for pinned 
        memory allocation, and one for managed memory allocation. 
        3) Your code needs to use a random number generator to initially set the individual grid element to 
        either “alive” or “dead”. 
        4) Your code then runs continuously generating new results until either the window is closed or the 
        “Esc” key is pressed. 
        5) While your code is running you need to display to a graphics window the current state of the Life 
        game. Cells that are alive are white and dead cells are black. You don’t need to draw the dead 
        cells.
        6) While your code is running you need to constantly output to the console window the processing 
        time in microseconds of the last 100 generations of the game and the type of memory allocation. 
        Do not include the time it takes to display the results.
        For example:
        100 generations took ??? microsecs with ** threads per block using Normal memory allocation.
        100 generations took ??? microsecs with 64 threads per block using Pinned memory allocation.
        100 generations took ??? microsecs with 1024 threads per block using Managed memory allocation.
        Turn-In Instructions
        Zip up your file(s) into Lab4.zip and upload this zip file on the assignment section of Canvas. 
        Grading Rubric:
        If a student’s program runs correctly and produces the desired output, the student has the potential to get a 100 
        on his or her homework; however, TA’s will look through your code for other elements needed to meet the lab 
        requirements. The table below shows typical deductions that could occur. 
        AUTOMATIC GRADING POINT DEDUCTIONS PER PROBLEM: 
        Element Percentage 
        Deduction 
        Details 
        Does Not Compile 40% Code does not compile on PACE-ICE!
        Does Not Match Output Up to **% The code compiles but does not produce correct outputs.
        Runtime and efficiency of 
        code setup
        Up to 10% 
        extra credit
        Top quartile 10 pts, Second quartile 5 pts, Third quartile 2 pts.
        Clear Self-Documenting 
        Coding Styles 
        Up to 25% This can include incorrect indentation, using unclear variable names, 
        unclear/missing comments, or compiling with warnings. (See 
        Appendix A) 
        LATE POLICY 
        Element Percentage Deduction Details 
        Late Deduction Function score – 0.5 * H H = number of hours (ceiling function) passed 
        deadline 
        Appendix A: Coding Standards
        Indentation:
        When using if/for/while statements, make sure you indent 4 spaces for the content inside those. Also make 
        sure that you use spaces to make the code more readable.
        For example:
        for (int i; i < 10; i++) 
        {
         j = j + i; 
        }
        If you have nested statements, you should use multiple indentions. Each { should be on its own line (like the 
        for loop) If you have else or else if statements after your if statement, they should be on their own line. 
        for (int i; i < 10; i++) 

         if (i < 5)
         {
         counter++; 
         k -= i; 
         } 
         else
         { 
         k +=1;
         } 
         j += i;
        }
        Camel Case:
        This naming convention has the first letter of the variable be lower case, and the first letter in each new word 
        be capitalized (e.g. firstSecondThird). 
        This applies for functions and member functions as well! 
        The main exception to this is class names, where the first letter should also be capitalized. 
        Variable and Function Names:
        Your variable and function names should be clear about what that variable or function represents. Do not use 
        one letter variables, but use abbreviations when it is appropriate (for example: “imag" instead of 
        “imaginary”). The more descriptive your variable and function names are, the more readable your code will 
        be. This is the idea behind self-documenting code. 
        File Headers:
        Every file should have the following header at the top
        /*
        Author: your name
        Class: ECE4122 or ECE6122 (section)
        Last Date Modified: date
        Description:
        What is the purpose of this file?
        */
        Code Comments:
        1. Every function must have a comment section describing the purpose of the function, the input and 
        output parameters, the return value (if any).
        2. Every class must have a comment section to describe the purpose of the class.
        3. Comments need to be placed inside of functions/loops to assist in the understanding of the flow of 
        the code.

        請(qǐng)加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp







         

        掃一掃在手機(jī)打開(kāi)當(dāng)前頁(yè)
      1. 上一篇:CSC1003 代做、JAVA 語(yǔ)言編程代寫(xiě)
      2. 下一篇:代寫(xiě)COMP0034、代做Java/Python程序設(shè)計(jì)
      3. 無(wú)相關(guān)信息
        合肥生活資訊

        合肥圖文信息
        急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計(jì)優(yōu)化
        急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計(jì)優(yōu)化
        出評(píng) 開(kāi)團(tuán)工具
        出評(píng) 開(kāi)團(tuán)工具
        挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
        挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
        海信羅馬假日洗衣機(jī)亮相AWE  復(fù)古美學(xué)與現(xiàn)代科技完美結(jié)合
        海信羅馬假日洗衣機(jī)亮相AWE 復(fù)古美學(xué)與現(xiàn)代
        合肥機(jī)場(chǎng)巴士4號(hào)線
        合肥機(jī)場(chǎng)巴士4號(hào)線
        合肥機(jī)場(chǎng)巴士3號(hào)線
        合肥機(jī)場(chǎng)巴士3號(hào)線
        合肥機(jī)場(chǎng)巴士2號(hào)線
        合肥機(jī)場(chǎng)巴士2號(hào)線
        合肥機(jī)場(chǎng)巴士1號(hào)線
        合肥機(jī)場(chǎng)巴士1號(hào)線
      4. 短信驗(yàn)證碼 酒店vi設(shè)計(jì) deepseek 幣安下載 AI生圖 AI寫(xiě)作 aippt AI生成PPT 阿里商辦

        關(guān)于我們 | 打賞支持 | 廣告服務(wù) | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責(zé)聲明 | 幫助中心 | 友情鏈接 |

        Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網(wǎng) 版權(quán)所有
        ICP備06013414號(hào)-3 公安備 42010502001045

        主站蜘蛛池模板: 狠狠做深爱婷婷综合一区| 免费视频精品一区二区| 麻豆文化传媒精品一区二区| 无码人妻一区二区三区免费看| 久久国产免费一区| 天码av无码一区二区三区四区| 精品亚洲A∨无码一区二区三区| 四虎永久在线精品免费一区二区 | 熟女性饥渴一区二区三区| 久久精品一区二区三区资源网| 国产一区二区三区在线观看免费| 无码人妻精品一区二区三| 久久久久久一区国产精品| 国产伦精品一区二区三区无广告| 亚洲一区二区三区高清在线观看| 中文字幕精品一区影音先锋| 久久精品一区二区三区四区 | 日本一区精品久久久久影院| 无码人妻精品一区二区三区99不卡| 蜜臀AV无码一区二区三区| 无码乱码av天堂一区二区 | 99久久精品日本一区二区免费 | 动漫精品专区一区二区三区不卡 | 日本精品啪啪一区二区三区| 无码精品尤物一区二区三区 | 久久久国产精品一区二区18禁| 久久99国产一区二区三区| 亚洲一区二区三区在线播放| 午夜视频久久久久一区 | 亚洲一区二区视频在线观看| 国产无人区一区二区三区| 精品一区狼人国产在线| 在线不卡一区二区三区日韩| 在线视频亚洲一区| 日本美女一区二区三区 | 免费看AV毛片一区二区三区| 国产精品资源一区二区| 无码人妻一区二区三区精品视频 | 国产激情无码一区二区app| 亚洲国产综合无码一区| 蜜桃视频一区二区三区在线观看 |