Distributed Resource Scheduling in Grid Computing Using Fuzzy Approach
|
|
- Asher Corey Crawford
- 5 years ago
- Views:
Transcription
1 Dstrbuted Resource Schedulng n Grd Computng Usng Fuzzy Approach Shahram Amn, Mohammad Ahmad Computer Engneerng Department Islamc Azad Unversty branch Mahallat, Iran Islamc Azad Unversty branch khomen, Iran Abstract Schedulng s a fundamental ssue n achevng hgh performance n multclusters and computatonal grds. In ths paper, we nvestgate the schedulng problem usng the proposed scheduler uses a dstrbuted approach wth the capablty of consderng the local clusters advantages for executng the jobs. On the other hand, the dstrbuted scheduler explots the capabltes of fuzzy logc to qualtatvely deal wth dfferent parameters avalable n the schedulng decson. Smulaton results show the effectveness of the algorthm n terms of job completon tme. Keywords: Fuzzy theory, Grd computng, Job schedulng, Dstrbuted schedulng 1. Introducton A grd computng nfrastructure s a collecton of resources connected by a network, n whch, by means of approprate software, resource dscovery and sharng s made possble [1]. One way to create a platform for grd computng s to nterconnect exstng separate clusters. These clusters may be located wthn a sngle organzaton or across dfferent admnstratve organzatons [2]. Schedulng s an mportant ssue n grd computng, and parallel jobs consttute a typcal workload n the schedulng scenaro. Parallel jobs can be classfed nto two categores: Rgd and moldable [2]. Rgd parallel jobs run on a user specfed number of resources, whle moldable jobs can run on dfferent number of computatonal resources. In ths paper we consder rgd parallel jobs. One class of applcatons that typcally run on a grd superstructure s the class of sngleprogram-multple-data (SPMD) applcatons, also known as data-parallel applcatons. Data-parallel applcatons are parttoned nto tasks whch perform computatons on separate peces of a data set. The tasks work together to process the entre data set, and are collectvely called a job. The data-parallel program model s often used to solve scentfc computng problems. These jobs may run for many hours or days, and can consume a large amount of system resources. The job may perform a large amount of computaton, communcaton between tasks, or both [1]. One category of rgd jobs that we have nvestgated s data parallel applcatons. A grd scheduler uses the nformaton of grd system and jobs to produce an assgnment of tasks to machnes for the gven grd job. The general problem of mappng tasks to machnes has been shown to be NP-complete [3]. The schedulng of parallel jobs has been extensvely studed n a sngle cluster envronment [5, 6]. Several heurstc algorthms have been developed to schedule tasks to machnes on heterogeneous computng systems. Eleven such schedulng algorthms have been evaluated n [4]. These algorthms are developed for heterogeneous computng systems. Some heurstc schedulng algorthms for grd envronments are developed n [7, 8, 9]. They deal wth tasks and machnes n terms of assgnng tasks to machnes, and have the defcency of not beng scalable, when appled to a large scale grd. For attanng scalablty, we use a dstrbuted approach, n a way that the arrval job can be submtted to any of the clusters. Afterward a 2 layer (global and local) schedulng scheme s deployed, whch ts frst stage s responsble for assgnng the job to an approprate cluster. Ths stage s called global schedulng, whch n fact schedules the job at the grd-level. Afterward the cluster s scheduler submts the job to the scheduler of the selected cluster, whch n turn starts the schedulng of job s tasks n ts local nodes upon recevng the job. The local scheduler (cluster- ISSN: ISBN:
2 level scheduler) uses the frst-n frst-out polcy for schedulng. In ths study we focus on dstrbuted global schedulng (schedulng at the grd-level), whch deals wth jobs and clusters, and assgns each job to a cluster. For ths, we consder the computatonal needs (.e. the number of computatonal resources on whch the job s requested to be run), and communcaton requrements (the amount of communcaton between job s tasks) of the job. We beleve that job s communcaton rato s an mportant parameter n schedulng. Exstng schedulers, presently, gnore ssues such as network load and the communcaton requrements of the applcaton. In a typcal scenaro, f an ncomng job requres a fxed number of computatonal resources and the same number of machnes s avalable n a cluster, the job s submtted to that cluster, even f the load on the cluster network precludes the completon of the job by an acceptable tme. The work presented n ths paper, addresses the need to buld a fuzzy system that augments the schedulng capabltes by ncorporatng ssues such as cluster s network load and job s communcaton requrements. The specfc queston beng addressed n ths paper s whch of the clusters should be allocated to an ncomng job. Ths queston requres a process of prortzaton of the avalable clusters. For ths, fuzzy logc was used n the form of a controller that contans rules whch match the resource specfcaton requrements of the jobs to the avalable resources of the clusters. The objectve s to nclude cluster s network load as a cluster resource, and job s communcaton requrements as a resource specfcaton n the prortzaton process. Usng fuzzy logc, t s possble to reason about these parameters n a qualtatve manner, and at the same tme to mprove the schedulng decsons. The Rest of the paper s organzed as follows. In secton 2, we descrbe the schedulng model, n whch the assumptons about the grd and ncomng jobs are expressed. In secton 3, the proposed global schedulng algorthm s presented. In secton 4, we evaluate the global scheduler through smulaton, and secton 5 concludes the paper. 2. The schedulng model and assumptons The assumed multcluster conssts of m clusters C1, C2,,C m, and each cluster s composed of a number of homogenous computatonal resources, and a scheduler. The schedulng s done n two levels: global and local. The arrval job could be submtted to the scheduler of any of the clusters. The cluster whch the job s submtted to s called local cluster, and the others are called remote. The scheduler of the local cluster should decde where the arrval job s gong to be run. It may choose the local or one of the remote clusters for executng the job. Ths decson s done through global schedulng, whch s the man subject of ths paper. If the selected cluster s one of the remote ones, the local scheduler submts the whole job to the scheduler of that cluster. After ths stage, the scheduler of the cluster whch fnally receves the job s responsble for schedulng the parallel job wthn ts local nodes. Ths stage of the schedulng process s called local schedulng, whch has prevously been the subject of some papers [5,6]. Fgure 1 shows an overall schema of the multcluster under nvestgaton. Parallel jobs consdered n ths paper are rgd. The job model s bult from user-provded applcaton characterstcs that do not requre extensve job proflng. They are The number of parttoned tasks. The rato of communcaton to executon. The rato of communcaton to executon gves a method of weghng the relatve mportance of communcaton rates and computatonal pow er for the job, wthout requrng extensve applcaton proflng. In summary, a parallel job, denoted by J, s dentfed by a 3-tuple (A, N, R ), where A s J s arrval tme, N s the number of computatonal resources on whch J requested to be run, R s the rato of communcaton to executon. ISSN: ISBN:
3 Fgure 1: The multcluster superstructure 3. schedulng After a user submts a job to one of the clusters, the global schedulng process s started by the scheduler of that cluster. The goal s to fnd a sutable cluster for assgnng the job to t. The global schedulng conssts of two stages: In the frst stage, all of the clusters are consdered equally, and a prorty s assgned to each of them. Afterwards the cluster wth the hghest prorty s selected as a canddate for assgnng the Job. When the ultmate cluster for assgnng the job s a remote cluster, a requrement of permsson s arsen, because one or more than one job may have been scheduled to that cluster by ts local scheduler or other schedulers durng the nterval between choosng that cluster for schedulng and submttng the job. Hence before submttng a job to a remote cluster, the local scheduler should send a permsson message to that cluster, and upon recevng the ok response, t submts the job. In reverse, f the response s No, the local scheduler repeats the global schedulng process after updatng the state nformaton of other clusters. 3.1 The proposed global schedulng algorthm For the characterzaton of the state of the cluster, we consder two parameters: the avalable number of CPUs and the cluster s network load. What s meant by cluster s network load s the level of communcaton presently traffckng through the cluster, whch s a rato between zero and one. When a job arrves, the scheduler s trggered to assgn the job to a cluster. For ths, t consders all the clusters and assgns two weghts (whch are numbers between zero and one) to each cluster. The frst weght (w), also called cluster w eght for number of machnes, determnes a matchng degree between the number of avalable low load CPUs n the cluster, and the number of tasks of the job. The second weght (w2), also called cluster weght for network load, consders job s communcaton requrements, and cluster s network load. We have performed many smulaton tests to adjust the coeffcent of these weghts n aggregatng prorty equaton. The fnal formula obtaned for calculatng prorty of a cluster wth respect to the newly arrves job s gven below Prorty = 0.7 W W2 After computng the prorty of all the clusters, the scheduler assgns the job to the cluster wth the maxmum prorty Cluster s weght for number of machnes Load of cluster s nodes s a dynamc attrbute, and s computed by averagng the currently reported loads (CPU usage) of the node. The scheduler parttons the nodes of a cluster nto low-load, medum-load, and hgh-load nodes. A node whch ts load s less than 0.3 s low-load; a node wth load between 0.3 and 0.6 s medumload; and a node wth load hgher than 0.6 s a th hgh-load node. For the cluster, L, M, H show the number of low-load, medum-load and hgh-load nodes, respectvely. The followng pseudo code shows the algorthm for computng the cluster s weght for number of machnes (W1). f (L> numoftask) { L numoftask w1 1 L f w1 0.5 w1 0.5; } else f ( L M numoftask ) { numoftask L w numoftask 3 3 ISSN: ISBN:
4 f w1 0.2 w1 0.2; } else f ( L M H numoftask { w 1 numoftask ( L M ) 0.2 numoftask f w1 0 w1 0; } 3 Here, numoftask determnes the number of parttoned tasks of the job Cluster s weght for network load One of the man features of ths work s consderng jobs communcaton requrements and clusters network load. When a job has a hgh communcaton rato, t must be scheduled to a cluster wth low network load. For ths, we use fuzzy logc to assgn a weght to the cluster, whch determnes sutablty of executng the job on the cluster. Ths assgnment consders communcaton requrements of the job and network load of the cluster. The fuzzy rule based system has two nput parameters: Jobs communcaton rato, and avalable bandwdth of the cluster (as a rato between zero and one), and one output: cluster s weght for network load (W2 ). When job s communcaton rato s close to one, t means that, the job requres hgh communcaton, so a small weght (close to zero) should be assgned to a cluster wth a lttle (close to zero) avalable bandwdth, and a hgh weght (close to one) should be assgned to a cluster wth hgh ( close to one) avalable bandwdth. Fgures 2 through 4 show examples of the fuzzy membershp functons for these two nputs, and for the output beng the weght assgned to network load of the cluster. Table I summarzes the rules that map the nputs to the output. We have used product nference engne, sngleton fuzzfre, and center average defuzzfre. rato Fgure 2: Fuzzy membershp functons of ommuncaton to executon rato Fgure 3: Fuzzy membershp functons of avalable BW Fgure 4: Fuzzy membershp functons of cluster weght ISSN: ISBN:
5 Table I. Fuzzy rules for mappng nputs to the output both Fgures 6 and 7, we conclude that the proposed fuzzy algorthm s better than the best-ft algorthm n reducng parallel completon tme. The proposed algorthm uses the job s communcaton requrements, and cluster s network load to take schedulng decsons more effcently, and as a result, t mproves job s completon tme. 4. Smulaton results We have developed a smulator n Matlab to evaluate the performance of the proposed schedulng algorthm. The smulated multcluster conssts of several clusters, each of whch composed of 1 to 100 nodes. Interarrval tme of jobs s consdered to satsfy a Posson process wth the parameter λ seconds. Each job s submtted wth three attrbutes: arrval tme, number of tasks, and communcaton to executon rato. Each job has a random number of tasks between 1 and 50, and a random communcaton to executon rato between 0 and 0.7. The scheduler does not need to predct the job s executon tme. We compare our schedulng algorthm wth a dstrbuted best-ft polcy, whch gnores the communcaton requrements of the jobs, and avalable bandwdth of the clusters. The best-ft schedulng algorthm assgns the submtted job to a cluster whose number of dle nodes s greater than the number of tasks of the job, and whose number of dle nodes s the least. There are two schedulng scenaros n the smulaton. Scenaro I: 5 clusters, 15 jobs, λ=12. Scenaro II: 30 clusters, 50 jobs, λ=16. For each scenaro systems are automatcally generated Fgure 6 shows parallel jobs completon tme for scenaro I. Small rectangles and parallelograms show completon tme of jobs n the best-ft and the proposed algorthm, respectvely. In Fgure 7 parallel jobs completon tme are shown for scenaro II. In both fgures, horzontal axs shows the arrval tme of jobs, and vertcal axs represents the completon tme of the submtted jobs. The completon tme of a job s computed as the nterval between job s arrval tme and job s completon tme. As can be seen n Fgure 6: Smulaton for parallel jobs completon tme (Scenaro I) Fgure 7: Smulaton for parallel jobs completon tme (Scenaro II) ISSN: ISBN:
6 5. Concluson Job schedulng s very complcated n computatonal grds. Parallel jobs are a set of mportant applcatons that usually consttute the workflow of a grd. In ths paper, we present a dstrbuted schedulng algorthm for schedulng parallel jobs n a computatonal grd. The schedulng s done n two layers: global and local. We focus our work to global schedulng, whch s responsble for allocatng the submtted job to a cluster. The global scheduler assgns a prorty, based on two matchng degrees, to each cluster for a submtted job. It then allocates the cluster wth hghest prorty to the job. Frst matchng degree (w 1 ) expresses the sutablty of executng the job on the cluster n terms of the number of tasks of the job, and the number of avalable nodes n the cluster. The other (w 2 ) expresses the sutablty n terms of cluster s avalable bandwdth, and job s communcaton requrements. For computng w 2, we use a fuzzy rule based system to consder dfferent parameters n a qualtatve manner. The smulaton results show the mprovement of the proposed algorthm over a dstrbuted best-ft polcy whch gnores communcaton requrements of the jobs and network traffc of the clusters. [5] B. G. Lawson and E. Smrn, Multple-queue Backfllng Schedulng wth Prortes and Reservatons for Parallel Systems, Proceedngs of the Eghth Job Schedulng Strateges for Parallel Processng, [6] E. Shmuel and D. G. Fetelson, Backfllng wth look ahead to optmze the performance of parallel job schedulng, n Job Schedulng Strateges for Parallel Processng, D. G. Fetelson, L.Rudolph, and U. Schwegelshohn (Eds.), pp , Sprnger-Verlag, [7] H. Yan, et, al, An Improved Ant Algorthm for Job Schedulng n Grd Computng, Proceedngs of the Fourth Internatonal Conference on Machne Learnng and Cybernetcs, Guangzhou, August [8] Y. Hu, et. Al, An Algorthm for Job Schedulng n Computatonal Grd Based on Tme-Balancng Strategy, Proceedngs of the Fourth Internatonal Conference on Machne Learnng and Cybernetcs, Guangzhou, August [9] Lang-Teh Lee Chn-Hsan Lang Hung-Yuan Chang, An Adaptve Task Schedulng System for Grd Computng, Proceedngs of the Sxth IEEE Internatonal Conf erence on Computer and Informaton Technology, References [1] Mchael Walker, A Framework for Effectve Schedulng of Data-Parallel Applcatons n Grd Systems, Master thess, Unversty of Vrgna, [2] Lgang He, Stephen A. Jarvs, Danel P. Spooner, Xnuo Chen and Graham R. Nudd, Dynamc Schedulng of Parallel Jobs wth QoS Demands n Multclusters and Grds, Proceedngs of the Ffth IEEE/ACM Internatonal Workshop on Grd Computng, 2004 [3] HU Rong, HU Zhgang, A Schedulng Algorthm Amed at Tme and Cost for Meta-tasks n Grd Computng Usng Fuzzy Applcablty, Proceedngs of the Eghth Internatonal Conference on Hgh-Performance Computng n Asa-Pacfc Regon, IEEE [4] Tracy D Braun, Howard Jay Segel et al, A comparson of eleven statc heurstcs for mappng a class of ndependent tasks onto heterogeneous dstrbuted computng system, Journal of Parallel and Dstrbuted computng, 2001, 6, pp ISSN: ISBN:
Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationHybrid Job Scheduling Mechanism Using a Backfill-based Multi-queue Strategy in Distributed Grid Computing
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.12 No.9, September 2012 39 Hybrd Job Schedulng Mechansm Usng a Backfll-based Mult-queue Strategy n Dstrbuted Grd Computng Ken Park
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationA Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems
Proceedngs of the Internatonal Conference on Parallel and Dstrbuted Processng Technques and Applcatons, PDPTA 2008, Las Vegas, Nevada, USA, July 14-17, 2008, 2 Volumes. CSREA Press 2008, ISBN 1-60132-084-1
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationReal-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
Real-tme Fault-tolerant Schedulng Algorthm for Dstrbuted Computng Systems Yun Lng, Y Ouyang College of Computer Scence and Informaton Engneerng Zheang Gongshang Unversty Postal code: 310018 P.R.CHINA {ylng,
More information(1) The control processes are too complex to analyze by conventional quantitative techniques.
Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationDynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons
More informationResearch Article Adaptive Cost-Based Task Scheduling in Cloud Environment
Scentfc Programmng Volume 2016, Artcle ID 8239239, 9 pages http://dx.do.org/10.1155/2016/8239239 Research Artcle Adaptve Cost-Based Task Schedulng n Cloud Envronment Mohammed A. S. Mosleh, 1 G. Radhaman,
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationEfficient Content Distribution in Wireless P2P Networks
Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationChapter 1. Introduction
Chapter 1 Introducton 1.1 Parallel Processng There s a contnual demand for greater computatonal speed from a computer system than s currently possble (.e. sequental systems). Areas need great computatonal
More informationA Frame Packing Mechanism Using PDO Communication Service within CANopen
28 A Frame Packng Mechansm Usng PDO Communcaton Servce wthn CANopen Mnkoo Kang and Kejn Park Dvson of Industral & Informaton Systems Engneerng, Ajou Unversty, Suwon, Gyeongg-do, South Korea Summary The
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationThe Data Warehouse in a Distributed Utility Environment
The Data Warehouse n a Dstrbuted Utlty Envronment Charles A. Mllgan Dstngushed Engneer, Sun Mcrosystems Charles.mllgan@sun.com Abstract Utlty provsonng, Grd resource management, nstant copy kosks, and
More informationDecision Strategies for Rating Objects in Knowledge-Shared Research Networks
Decson Strateges for Ratng Objects n Knowledge-Shared Research etwors ALEXADRA GRACHAROVA *, HAS-JOACHM ER **, HASSA OUR ELD ** OM SUUROE ***, HARR ARAKSE *** * nsttute of Control and System Research,
More informationFibre-Optic AWG-based Real-Time Networks
Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se
More informationQueueing Network-based Optimisation Techniques for Workload Allocation in Clusters of Computers *
Queueng Network-based Optmsaton Technques for Workload Allocaton n Clusters of Computers * Lgang He, Stephen A. Jarvs, Davd Bacgalupo, Danel P. Spooner, Xnuo Chen and Graham R. Nudd Department of Computer
More informationPerformance Study of Parallel Programming on Cloud Computing Environments Using MapReduce
Performance Study of Parallel Programmng on Cloud Computng Envronments Usng MapReduce Wen-Chung Shh, Shan-Shyong Tseng Department of Informaton Scence and Applcatons Asa Unversty Tachung, 41354, Tawan
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationConcurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More informationOptimized Resource Scheduling Using Classification and Regression Tree and Modified Bacterial Foraging Optimization Algorithm
World Engneerng & Appled Scences Journal 7 (1): 10-17, 2016 ISSN 2079-2204 IDOSI Publcatons, 2016 DOI: 10.5829/dos.weasj.2016.7.1.22540 Optmzed Resource Schedulng Usng Classfcaton and Regresson Tree and
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationA GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING
A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING M. Nkravan and M. H. Kashan Department of Electrcal Computer Islamc Azad Unversty, Shahrar Shahreqods
More informationQoS-aware composite scheduling using fuzzy proactive and reactive controllers
Khan et al. EURASIP Journal on Wreless Communcatons and Networkng 2014, 2014:138 http://jwcn.euraspjournals.com/content/2014/1/138 RESEARCH Open Access QoS-aware composte schedulng usng fuzzy proactve
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationSelf-tuning Histograms: Building Histograms Without Looking at Data
Self-tunng Hstograms: Buldng Hstograms Wthout Lookng at Data Ashraf Aboulnaga Computer Scences Department Unversty of Wsconsn - Madson ashraf@cs.wsc.edu Surajt Chaudhur Mcrosoft Research surajtc@mcrosoft.com
More informationBurst Round Robin as a Proportional-Share Scheduling Algorithm
Burst Round Robn as a Proportonal-Share Schedulng Algorthm Tarek Helmy * Abdelkader Dekdouk ** * College of Computer Scence & Engneerng, Kng Fahd Unversty of Petroleum and Mnerals, Dhahran 31261, Saud
More informationMotivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to:
4.1 4.2 Motvaton EE 457 Unt 4 Computer System Performance An ndvdual user wants to: Mnmze sngle program executon tme A datacenter owner wants to: Maxmze number of Mnmze ( ) http://e-tellgentnternetmarketng.com/webste/frustrated-computer-user-2/
More informationEvaluation of Parallel Processing Systems through Queuing Model
ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationPriority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks
Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,
More informationA Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks
A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract
More informationA HIERARCHICAL SIMULATION FRAMEWORK FOR APPLICATION DEVELOPMENT ON SYSTEM-ON-CHIP ARCHITECTURES. Vaibhav Mathur and Viktor K.
A HIERARCHICAL SIMULATION FRAMEWORK FOR APPLICATION DEVELOPMENT ON SYSTEM-ON-CHIP ARCHITECTURES Vabhav Mathur and Vktor K. Prasanna Department of EE-Systems Unversty of Southern Calforna Los Angeles, CA
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationA comparative study of scheduling algorithms for the multiple deadline-constrained workflows in heterogeneous computing systems with time windows
Proceda Computer Scence Volume 29, 2014, Pages 509 522 ICCS 2014 14th Internatonal Conference on Computatonal Scence A comparatve study of schedulng algorthms for the multple deadlne-constraned workflows
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationA Proximity-aware Load Balancing in Peer-to-Peer based Volunteer Computing Systems
A Promty-aware Load Balancng n Peer-to-Peer based Volunteer Computng ystems Toktam Ghafaran, Hossen Deldar, Bahman Javad 3, Rakumar Buyya Department of Computer Engneerng Ferdows Unversty of Mashhad, ran
More informationA fair buffer allocation scheme
A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationUse of Genetic Algorithms in Efficient Scheduling for Multi Service Classes
Use of Genetc Algorthms n Effcent Schedulng for Mult Servce Classes Shyamale Thlakawardana and Rahm Tafazoll Centre for Communcatons Systems Research (CCSR), Unversty of Surrey, Guldford, GU27XH, UK Abstract
More informationGA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks
Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationBehavioral Model Extraction of Search Engines Used in an Intelligent Meta Search Engine
Behavoral Model Extracton of Search Engnes Used n an Intellgent Meta Search Engne AVEH AVOUSI Computer Department, Azad Unversty, Garmsar Branch BEHZAD MOSHIRI Electrcal and Computer department, Faculty
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationTowards Autonomous Service Composition in A Grid Environment
Towards Autonomous Servce Composton n A Grd Envronment Wllam K. Cheung +, Jmng Lu +, Kevn H. Tsang +, Raymond K. Wong ++ Department of Computer Scence + Hong Kong Baptst Unversty Hong Kong {wllam,jmng,hhtsang}@comp.hkbu.edu.hk
More informationAdaptive Power-Aware Prefetch in Wireless Networks
Adaptve Power-Aware Prefetch n Wreless Networks Langzhong Yn, Student Member, IEEE, and Guohong Cao, Member, IEEE Abstract Most of the prefetch technques used n the current cache management schemes do
More informationWireless Sensor Network Localization Research
Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
More informationAn Investigation into Server Parameter Selection for Hierarchical Fixed Priority Pre-emptive Systems
An Investgaton nto Server Parameter Selecton for Herarchcal Fxed Prorty Pre-emptve Systems R.I. Davs and A. Burns Real-Tme Systems Research Group, Department of omputer Scence, Unversty of York, YO10 5DD,
More informationA QoS-aware Scheduling Scheme for Software-Defined Storage Oriented iscsi Target
A QoS-aware Schedulng Scheme for Software-Defned Storage Orented SCSI Target Xanghu Meng 1,2, Xuewen Zeng 1, Xao Chen 1, Xaozhou Ye 1,* 1 Natonal Network New Meda Engneerng Research Center, Insttute of
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationDesign and implementation of priority and timewindow based traffic scheduling and routingspectrum allocation mechanism in elastic optical networks
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Desgn and mplementaton of prorty and tmewndow based traffc schedulng and routngspectrum allocaton mechansm n elastc optcal networks To cte ths artcle:
More informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationParallel and Distributed Association Rule Mining - Dr. Giuseppe Di Fatta. San Vigilio,
Parallel and Dstrbuted Assocaton Rule Mnng - Dr. Guseppe D Fatta fatta@nf.un-konstanz.de San Vglo, 18-09-2004 1 Overvew Assocaton Rule Mnng (ARM) Apror algorthm Hgh Performance Parallel and Dstrbuted Computng
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationReliability and Performance Models for Grid Computing
Relablty and Performance Models for Grd Computng Yuan-Shun Da,2, Jack Dongarra,3,4 Department of Electrcal Engneerng and Computer Scence, Unversty of Tennessee, Knoxvlle 2 Department of Industral and Informaton
More informationAn Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems
S. J and D. Shn: An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems 2355 An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems Seunggu J and Dongkun Shn, Member,
More informationCapability-Aware Object Management based on Skip List in Large-Scale Heterogeneous P2P Networks
Takash Tommoto, Takuj Tachbana, Kenj Sugmoto Capablty-ware Object Management based on Skp Lst n Large-Scale Heterogeneous PP Networks TKSHI TOMIMOTO, TKUJI TCHIBN, KENJI SUGIMOTO Graduate School of Informaton
More informationFast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationAdaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
More informationA KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE
A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE 1 TAO LIU, 2 JI-JUN XU 1 College of Informaton Scence and Technology, Zhengzhou Normal Unversty, Chna 2 School of Mathematcs
More informationAn Approach to Optimized Resource Scheduling Algorithm for Open-source Cloud Systems
The Ffth Annual ChnaGrd Conference An Approach to Optmzed Resource Schedulng Algorthm for Open-source Cloud Systems Ha Zhong 1, 2, Kun Tao 1, Xueje Zhang 1, 2 1 School of Informaton Scence and Engneerng,
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationAn Online Delay Efficient Multi-Class Packet Scheduler for Heterogeneous M2M Uplink Traffic
An Onlne Delay Effcent Mult-Class Packet Scheduler for Heterogeneous M2M Uplnk Traffc Akshay Kumar, Ahmed Abdelhad and Charles Clancy Hume Center, Vrgna Tech Emal:{akshay2, aabdelhad, tcc}@vt.edu Abstract
More informationStudy on Fuzzy Models of Wind Turbine Power Curve
Proceedngs of the 006 IASME/WSEAS Internatonal Conference on Energy & Envronmental Systems, Chalkda, Greece, May 8-0, 006 (pp-7) Study on Fuzzy Models of Wnd Turbne Power Curve SHU-CHEN WANG PEI-HWA HUANG
More informationTHere are increasing interests and use of mobile ad hoc
1 Adaptve Schedulng n MIMO-based Heterogeneous Ad hoc Networks Shan Chu, Xn Wang Member, IEEE, and Yuanyuan Yang Fellow, IEEE. Abstract The demands for data rate and transmsson relablty constantly ncrease
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationAssembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
More information