Bibliography Laredo Morning Times Online. March 2009. 21 March 2009. . Wikipedia. March 2009. 21March 2009. . Wikipedia. March 2009. 21 March 2009. . Wikipedia. March 2009. 21 March 2009. . Wikipedia. March 2009. 21 March 2009.
View full slide show




Sorting Quiz questions ITCS4145/5145, Parallel Programming March 19, 2013.
View full slide show




Work Cited Refrences • Centers for Disease Control and Prevention. (2011). Folic acid homepage. Retrieved March 17, 2013, from: http://www.cdc.gov/ncbddd/folicacid/aboutus.html • Abi Assi, K. (n.d.). Folic acid and depression. Retrieved March 17, 2013, from: http://kabiassi.com/10.php?ad=10 • Office of Dietary Supplements. (2012). Folate. Retrieved March 18, 2013, from: http://ods.od.nih.gov/factsheets/Folate-HealthProfessional/ • Organic Facts. (2013). Health benefits of vitamin b9 or folic acid. Retrieved March 18, 2013, from: http://www.organicfacts.net/health-benefits/vitamins/healthbenefits-of-vitamin-b9-or-folic- acid.html • Andrews, T. (2011). What is the function of folic acid?. Retrieved March 18, 2013, from: http://www.livestrong.com/article/426140-what-is-the-function-of-folicacid/ • Organic Facts. (2013). Health benefits of vitamin b9 or folic acid. Retrieved March 18, 2013, from: http://www.organicfacts.net/health-benefits/vitamins/healthbenefits-of-vitamin-b9-or-folic- acid.html • OverDoseInfo.com. (2012). Folic acid overdose- symptoms, dosage, and treatment. Retrieved March 18, 2013, from: http://overdoseinfo.com/folic-acidoverdose/ Images • Healthy foods for pregnant women [Photograph], Retrieved March 17, 2013, from: http://www.healthfoodmadeeasy.com/healthy-foods-for-pregnantwomen-tips-and-tricks/ • Abi Assi, K. (n.d.). Folic acid and depression [Photograph]. Retrieved March 17,
View full slide show




Pipeline Quiz questions ITCS4145/5145, Parallel Programming Oct 24, 2013.
View full slide show




Sieve of Eratosthenes Quiz questions ITCS4145/5145, Parallel Programming Oct 24, 2013.
View full slide show




Stencil Quiz questions ITCS4145/5145, Parallel Programming Oct 24, 2013.
View full slide show




Course Plan  4 assignments 8 points each # 1 Given Feb 1, Due Feb 15 – Due Feb 17 – Returned #2 Given Feb 15, Due March 1 – Due March 8 - Returned #3 Given March1, Due March 29 – Given March 10 – due March 31 #4 March 29 Due April 12 – Given March 31, Due April 14  Two exams – 16 points each Exam #1: March 3 or March 10 – March 10 – will return March 31 - returned Exam #2: May 3 or May 10 – May 10  2 term papers – 10 points each - #1: Due March 3 or March 10 (depending on exam) - Returned - #2: April 19  Programming project: 16 points April 26  Total 100 points
View full slide show




Works Cited "American Burn Association Burn Treatment Facts." The University of New Mexico, 2013. Web. 19 Oct. 2013. . "Artificial Skin." Advameg, Inc., 2013. Web. 19 Oct. 2013. . "Artificial Skin." N.p., n.d. Web. 19 Oct. 2013. . "Artificial Skin." Wikipedia, 17 Oct. 2013. Web. 19 Oct. 2013. . Baker, Chris. "New "artificial Skin" Product Launched." William Reed Business Media, 24 July 2013. Web. 19 Oct. 2013. . DERMAGRAFT® - P000036. FDA, 13 Sept. 2013. Web. 19 Oct. 2013. . Geldhard, Katie. "Artificial Skin." OpenWetWare, 18 Jan. 2013. Web. 19 Oct. 2013. . "Greiner Bio-One Launches Artificial Skin to Replace Animal Testing." Zenopa Ltd, 15 July 2013. Web. 19 Oct. 2013. . Halim, Ahmad S., Teng L. Khoo, and Shah J. Yussof. Biologic and Synthetic Skin Substitutes: An Overview (n.d.): n. pag. Indian Journal of Plastic Surgery. Web. 19 Oct. 2013. . Shingledecker, Leon. N.p., n.d. Web. 19 Oct. 2013. . Shire Regenerative Medicine, In, 2013. Web. 19 Oct. 2013. . "Skin Grafts." WebMD LLC, 2013. Web. 19 Oct. 2013. . "Understanding Differences Types of Burns." Shriners Hospitals for Children, 2013. Web. 19 Oct. 2013. .
View full slide show




4.7.   Sorting and duplicate removal are expressed in ORDER BY and DISTINCT in SQL Parallel algorithms for database sorting   Parallel merge-all sort, parallel binary-merge sort, parallel redistribution binarymerge sort, parallel redistribution merge-all sort, and parallel partitioned sort Cost models for each parallel sort algorithm   Summary Buffer size Parallel redistribution algorithm is prone to processing skew   If processing skew degree is high, then use parallel redistribution merge-all sort. If both data skew and processing skew degrees are high or no skew, then use parallel partitioned sort D. Taniar, C.H.C. Leung, W. Rahayu, S. Goel: High-Performance Parallel Database Processing and Grid Databases, John Wiley & Sons, 2008
View full slide show




Using compiler-directed approach to create MPI code automatically Paraguin Compiler ITCS4145/5145, Parallel Programming Clayton Ferner/B. Wilkinson March 10, 2014. ParagionSlides1.ppt 1
View full slide show




Tentative Schedule          Assignment #1 due date: February 15, 2013 Assignment #2: due date: March 1, 2013 (new date: March 22, 2013) Term Paper #1: February 22, 2013 Exam #1: March 8, 2013 Assignment #3: March 29, 2013 (new date: April 5, 2013) Term paper #2: April 12, 2013 (new date: April 19, 2013) Assignment #4: April 19, 2013 ( new date: April 26, 2013) Programming Project: May 3, 2013 Exam #2: May 10, 2013
View full slide show




Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0; // indicate that no one took the quiz quiz1 |= 1 << 7; // indicate that student #7 took the quiz quiz1 |= 1 << 4; // indicate that student #4 took the quiz quiz1 &= ~(1 << 7); // Oops! Student #7 didn’t take the quiz. Turn it off. int quiz2 = 0; // let’s give another quiz! … // indicate students that took quiz 2 // How can we print out all students that took either quiz 1 or quiz 2 // (but not both)?
View full slide show




Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0; // indicate that no one took the quiz quiz1 |= 1 << 7; // indicate that student #7 took the quiz quiz1 |= 1 << 4; // indicate that student #4 took the quiz quiz1 &= ~(1 << 7); // Oops! Student #7 didn’t take the quiz. Turn it off. int quiz2 = 0; // let’s give another quiz! … // indicate students that took quiz 2 // determine whether a student took either quiz 1 or quiz 2 (but not both) int oneOrTheOther = quiz1 ^ quiz2; // How do we print the students out?
View full slide show




Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0; // indicate that no one took the quiz quiz1 |= 1 << 7; // indicate that student #7 took the quiz quiz1 |= 1 << 4; // indicate that student #4 took the quiz quiz1 &= ~(1 << 7); // Oops! Student #7 didn’t take the quiz. Turn it off. int quiz2 = 0; // let’s give another quiz! … // indicate students that took quiz 2 // determine whether a student took either quiz 1 or quiz 2 (but not both) int oneOrTheOther = quiz1 ^ quiz2; // print out the students if ( (oneOrTheOther & 1) != 0 ) System.out.println( “one” ); oneOrTheOther >>>= oneOrTheOther; if ( (oneOrTheOther & 1) != 0 ) System.out.println( “two” ); …
View full slide show




Intel MMX ISA Extension Class Vector Copy Shift Op type 32 bits Register copy Arithmetic Table 25.1 Instruction Parallel pack 4, 2 Parallel unpack low 8, 4, 2 Parallel unpack high 8, 4, 2 Parallel add 8, 4, 2 Parallel subtract 8, 4, 2 Parallel multiply low 4 Parallel multiply high 4 Parallel multiply-add 4 Parallel compare equal 8, 4, 2 Parallel compare greater 8, 4, 2 Parallel left shift logical 4, 2, 1 Parallel right shift logical 4, 2, 1 Saturate Wrap/Satur ate# Wrap/Satur ate# Architecture, Advanced Architectures Parallel rightComputer shift arith 4, 2 Function or results Integer register  MMX register Convert to narrower elements Merge lower halves of 2 vectors Merge upper halves of 2 vectors Add; inhibit carry at boundaries Subtract with carry inhibition Multiply, keep the 4 low halves Multiply, keep the 4 high halves Multiply, add adjacent products* All 1s where equal, else all 0s All 1s where greater, else all 0s Shift left, respect boundaries Shift right, respect boundaries Arith shift within each (half)word
View full slide show




CAINE 2013 Call for Papers 26th International Conference on Computer Applications in Industry and Engineering September 25{27, 2013, Omni Hotel, Los Angles, Califorria, USA Sponsored by the International Society for Computers and Their Applications (ISCA) Provides an international forum for presentation and discussion of research on computers and their applications. The conference also includes a Best Paper Award. CAINE{2013 will feature contributed papers as well as workshops and special sessions. Papers will be accepted into oral presentation sessions. The topics will include, but are not limited to, the following areas: Agent-Based Systems Image/Signal Processing Autonomous Systems Information Assurance Big Data Analytics Information Systems/Databases Bioinformatics, Biomedical Systems/Engineering Internet and Web-Based Systems Computer-Aided Design/Manufacturing Knowledge-based Systems Computer Architecture/VLSI Mobile Computing Computer Graphics and Animation Multimedia Applications Computer Modeling/Simulation Neural Networks Computer Security Pattern Recognition/Computer Vision Computers in Education Rough Set and Fuzzy Logic Computers in Healthcare Robotics Computer Networks Fuzzy Logic Control Systems Sensor Networks Data Communication Scientic Computing Data Mining Software Engineering/CASE Distributed Systems Visualization Embedded Systems Wireless Networks and Communication Important Dates Workshop/special session proposal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .May 2.5,.2.01.3 Full Paper Submission . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .June 5,.2.0.1.3. Notication of Acceptance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .July.5 , 2013. Pre-registration & Camera-Ready Paper Due . . . . . . . . . . . . . . . . . . . . . .August 5, 2013. Event Dates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .September 25-27, 2013 The 22nd SEDE Conference is interested in gathering researchers and professionals in the domains of Software Engineering and Data Engineering to present and discuss high-quality research results and outcomes in their fields. SEDE 2013 aims at facilitating cross-fertilization of ideas in Software and Data Engineering, The conference also encourages research and discussions on topics including, but not limited to: . Requirements Engineering for Data Intensive Software Systems. Software Verification and Model of Checking. Model-Based Methodologies. Software Quality and Software Metrics. Architecture and Design of Data Intensive Software Systems. Software Testing. Service- and Aspect-Oriented Techniques. Adaptive Software Systems . Information System Development. Software and Data Visualization. Development Tools for Data Intensive. Software Systems. Software Processes. Software Project Mgnt . Applications and Case Studies. Engineering Distributed, Parallel, and Peer-to-Peer Databases. Cloud infrastructure, Mobile, Distributed, and Peer-to-Peer Data Management . Semi-Structured Data and XML Databases. Data Integration, Interoperability, and Metadata. Data Mining: Traditional, Large-Scale, and Parallel. Ubiquitous Data Management and Mobile Databases. Data Privacy and Security. Scientific and Biological Databases and Bioinformatics. Social networks, web, and personal information management. Data Grids, Data Warehousing, OLAP. Temporal, Spatial, Sensor, and Multimedia Databases. Taxonomy and Categorization. Pattern Recognition, Clustering, and Classification. Knowledge Management and Ontologies. Query Processing and Optimization. Database Applications and Experiences. Web Data Mgnt and Deep Web Submission procedures May 23, 2013 Paper Submission Deadline June 30, 2013 Notification of Acceptance July 20, 2013 Registration and Camera-Ready Manuscript Conference Website: http://theory.utdallas.edu/SEDE2013/ September 25-27, 2013 Omni Hotel, Los Angeles, California, USA The International Conference on Advanced Computing and Communications (ACC-2013) provides an international forum for presentation and discussion of research on a variety of aspects of advanced computing and its applications, and communication and networking systems. ACC-2013 will feature contributed as well as invited papers in all aspects of advanced computing and communications and will include a BEST PAPER AWARD given to a paper presented at the conference. Important Dates May 5, 2013 - Special Sessions Proposal Papers on Current FAUST Cluster (functional gap based) and on revisions to FAUST Classification. June 5, 2013 - Full Paper Submission Who will lead what? July 5, 2013 - Author Notification Aug. 5, 2013 - Advance Registration & Camera Ready Paper Due
View full slide show




ITCS 4145/5145 Parallel Programming Spring 2012 Barry Wilkinson Department of Computer Science University of North Carolina at Charlotte Tuesday/Thursday 5:00 pm – 6:15 pm Woodward 135 ITCS 4/5145 Parallel Programming, UNC-Charlotte, B. Wilkinson, Nov 19, 2012 outline.1
View full slide show




More Quiz Questions Parallel Programming MPI Non-blocking, synchronous, asynchronous message passing routines ITCS 4/5145 Parallel Programming, UNC-Charlotte, B. Wilkinson, 2013, QuizQuestions2b.ppt Sept 23, 2013
View full slide show




More Quiz Questions Parallel Programming MPI Collective routines ITCS 4/5145 Parallel Programming, UNC-Charlotte, B. Wilkinson, 2013, QuizQuestions2b.ppt Sept 23, 2013
View full slide show




Quiz Questions Parallel Programming MPI ITCS 4/5145 Parallel Programming, UNC-Charlotte, B. Wilkinson, 2013, QuizQuestions2a.ppt Sept 19, 2013
View full slide show




Potential for parallel computers/parallel programming Before we embark on using a parallel computer, we need to establish whether we can obtain increased execution speed with an application and what the constraints are. ITCS 4/5145 Parallel Programming UNC-Charlotte, B. Wilkinson, 2013. slides1a-2 July 9, 2013 1a-2.1
View full slide show




Common Barriers and Possible Solutions Traffic Jams at Sorting Stations Students eat meals in location(s) other than cafeteria ▪ Locate Sorting Stations back-to-back so that students can access sorting bins from two sides. ▪ Identify central locations for Sorting Stations. ▪ Agree on dismissal strategies to prevent traffic jam. ▪ Eliminate as many trash barrels in area as possible. If possible, locate trash barrels only in Sorting Stations. ▪ For example: Announce that tables will be dismissed soon. Give students time to prepare items on their trays for sorting (removing packaging and opening milk cartons). ▪ Enlist students to create message to enroll community to support sorting and help Staff with bin transport. ▪ For example: Dismiss students one table at a time. ▪ Incentive and Reward Program and student support/leadership even more important in this scenario. ▪ Multiple Stations needed.
View full slide show




why study sorting? Sorting is a classic subject in computer science. There are three reasons for studying sorting algorithms. – First, sorting algorithms illustrate many creative approaches to problem solving and these approaches can be applied to solve other problems. – Second, sorting algorithms are good for practicing fundamental programming techniques using selection statements, loops, methods, and arrays. – Third, sorting algorithms are excellent examples to demonstrate algorithm performance. Liang, Introduction to Java Programming, Seventh Edition, (c) 2009 Pearson Education, Inc. All rights reserved. 0136012671 3
View full slide show




Quiz Questions Parallel Programming Parallel Computing Potential ITCS 4/5145 Parallel Programming, UNC-Charlotte, B. Wilkinson, 2014, QuizQuestions1a-2.ppt Jan 13, 2014
View full slide show




Quiz Questions Seeds pattern programming framework ITCS 4/5145 Parallel Programming, UNC-Charlotte, B. Wilkinson, 2013, QuizQuestionsSeeds.ppt Aug 29, 2013
View full slide show




When you finish a section 1. Repeat steps given for all the listed sections for a quiz. 2. Do the homework problems in iLrn. 3. Repeat for all sections for each quiz. 4. You will have two chances for each quiz. The first is a practice quiz. If you are not happy with the results of the practice quiz, watch the videos, do more problems or get help. When you feel ready, take the online quiz. (The first quiz can be taken as often as you like)
View full slide show




Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0; // indicate that no one took the quiz quiz1 |= 1 << 7; // indicate that student #7 took the quiz quiz1 |= 1 << 4; // indicate that student #4 took the quiz quiz1 &= ~(1 << 7); // Oops! Student #7 didn’t take the quiz. Turn it off. int quiz2 = 0; // let’s give another quiz! … // indicate students that took quiz 2 // How can we determine if student #4 took both?
View full slide show




Problem 3 Say class sizes are limited to 32 students. Therefore, I can use the bits in an int to indicate whether or not students took a particular quiz: int quiz1 = 0; // indicate that no one took the quiz quiz1 |= 1 << 7; // indicate that student #7 took the quiz quiz1 |= 1 << 4; // indicate that student #4 took the quiz quiz1 &= ~(1 << 7); // Oops! Student #7 didn’t take the quiz. Turn it off. int quiz2 = 0; // let’s give another quiz! … // indicate students that took quiz 2 // determine if student #4 took both final int s7 = 1<<7; if ( (quiz1&s7) != 0 && (quiz2&s7) != 0 ) { … //student 7 took both }
View full slide show




More Quiz Questions Parallel Programming MPI Collective routines ITCS 4/5145 Parallel Programming, UNC-Charlotte, B. Wilkinson QuizQuestions2b.ppt February 5, 2016
View full slide show




Potential for parallel computers/parallel programming Before we embark on using a parallel computer, we need to establish whether we can obtain increased execution speed with an application and what the constraints are. ITCS 4/5145 Parallel Programming UNC-Charlotte, B. Wilkinson. slides1a-2 July 29, 2014 1
View full slide show