日本浪人是什么意思| 6月7日什么星座| 什么山峻岭| 五味杂粮什么意思| 吴用的绰号是什么| 高血压吃什么降的快| 尿检蛋白质弱阳性是什么意思| 牛头马面是什么生肖| 低密度结节是什么意思| 智人是什么意思| 为什么萤火虫会发光| 咳嗽有黄痰吃什么消炎药| 桑葚不能和什么一起吃| 郑中基为什么叫太子基| 前戏是什么意思| ambush是什么牌子| 长水泡是什么原因| 时刻是什么意思| 吃蝎子有什么好处| 什么假什么威| 月经量少吃什么好| 食道好像有东西堵着是什么原因| 刀客是什么意思| 检查肺部挂什么科室| 1887年属什么生肖| 结局he是什么意思| 心率低40多吃什么药| 面线是什么| 雪花粉是什么面粉| 无名指戴戒指什么意思| 什么是牙齿根管治疗| 遗精吃什么药| 乳腺导管扩张是什么意思| 白莲子和红莲子有什么区别| 流鼻涕咳嗽吃什么药| 阳痿早泄吃什么药好| 感冒咳嗽一直不好是什么原因| 做梦梦到自己拉屎是什么意思| 济公属什么生肖| 羊肉不能和什么食物一起吃| 感冒是什么原因引起的| 脖子粗大是什么病的症状| 农垦局是什么性质单位| 面包虫吃什么| 耳心痒是什么原因| 十月初三是什么星座| 沐什么意思| 川芎治什么病最好| 弯弯的月儿像什么| 病入膏肓是什么意思| 甲减要多吃什么食物好| 黑色阔腿裤搭配什么上衣好看| 柯南什么时候完结| 喝什么水减肥最快| 专升本有什么专业| 高血压1级是什么意思| 临床医学是什么| 夹层是什么意思| 嗜睡是什么意思| 毛囊炎挂什么科| 船舷是什么意思| 抓鱼的鸟叫什么| 梦见老公出轨了是什么征兆| 6月21号是什么日子| 抗性糊精是什么| 用什么补肾最好| 江郎才尽是什么意思| 易烊千玺原名叫什么| 日加立念什么| 红和绿混合是什么颜色| 氮是什么| hpc是什么意思| 一月15号是什么星座| 小孩出虚汗是什么原因| 为什么生理期不能做| 生肖龙和什么生肖最配| 才华横溢是什么生肖| 乡和镇有什么区别| 身体缺酶会得什么病| 达克宁栓治疗什么妇科病| 咽口水喉咙痛吃什么药| 无名指是什么经络| 西洋参跟花旗参有什么区别| 左胸上方隐痛什么原因| 一什么森林| 水漂是什么意思| 什么牌子皮带结实耐用| 遗精是什么原因| 世界上最大的湖是什么湖| 揉肚子有什么好处| 老睡不着觉是什么原因| 陈丽华是慈禧什么人| 小周天是什么意思| 什么交加| rococo是什么牌子| 梦见老公出轨预示什么| 玟字五行属什么| 肛门里面痒是什么情况| 思源名字的寓意是什么| 诸葛亮是个什么样的人| 咨客是做什么的| 68年猴五行属什么| 脚底长水泡是什么原因| 测怀孕什么时候最准| 肠胃不好经常拉肚子吃什么药| aoa是什么意思| 低压高吃什么中成药| 结核杆菌dna检测是检查什么| 向日葵什么时候采摘| 口舌生疮吃什么药最见效| 吃什么去湿气最快| 长痘痘是什么原因| 胆囊胆固醇结晶是什么| 跛子是什么意思| 什么时候期末考试| 哪是什么意思| 咳嗽应该挂什么科| congee是什么意思| 前列腺增大有什么危害| 思源名字的寓意是什么| 高血糖吃什么食物好| 盐酸达泊西汀片是什么药| 肾火旺有什么症状| 11月11是什么星座| 树脂材料是什么| t是什么| 什么药治痔疮最快| 窦性心律不齐有什么危害| 愿闻其详什么意思| 85年属什么的| 为什么多喝水反而胖了| 巨蟹后面的星座是什么| 尿频尿急小腹胀痛吃什么药| 什么的公鸡| 谦虚的什么| 生化全套主要检查什么| 常吃南瓜有什么好处和坏处| 巴黎世家是什么| 晚上7点到9点是什么时辰| 马来西亚主食吃什么| 在什么什么前面| 下巴下面是什么部位| 母亲节是什么时候| 报喜鸟属于什么档次| 乏力是什么原因| 血小板低吃什么食物补得快| 湿疹涂什么| 慕字五行属什么| 山楂什么季节成熟| 情人的定义是什么| 尿常规检查挂什么科| 血糖高饮食需要注意什么| 维生素e和维生素c一起吃有什么效果| 心阴不足吃什么中成药| 所费不赀是什么意思| 为什么要学数学| 77年的蛇是什么命| 口臭为什么| 迷你巴拉巴拉和巴拉巴拉什么关系| 孕妇上火什么降火最快| 世界上最大的沙漠是什么沙漠| 小学什么时候期末考试| 龙珠是什么| 晋是什么意思| 凉皮用什么做的| 封心锁爱什么意思| 淀粉酶是什么| conch是什么牌子| 吃什么可以补黄体酮| 日丙念什么| 梦到鬼是什么意思| s1隐裂是什么意思| 714什么星座| 阿司匹林什么时候吃最好| 姜黄是什么东西| 清对什么| 禁的部首是什么| 夜尿次数多是什么原因| 为什么女人阴唇会变大| poa是什么意思| 猪脚煲汤放什么材料好| 白羊座上升星座是什么| 黄茶是什么茶| 卷饼里面配什么菜好吃| 酌情是什么意思| 白砂糖和冰糖有什么区别| 肾积水吃什么药| 翠玉是什么玉| 海纳百川什么意思| ibs是什么单位| cream什么意思| 盆腔炎是什么| 热感冒吃什么食物好| 男性硬不起来什么原因| 莲子心和什么搭配泡水喝最好| 蝗虫吃什么| 梦到老公出轨是什么意思| 内秀是什么性格的人| 冷冻和冷藏有什么区别| 慌张是什么意思| 马与什么属相相克相冲| yolo是什么| 滴虫性阴炎有什么症状表现| 二月份出生的是什么星座| 拉肚子吃什么食物比较好| 慢性萎缩性胃炎c2是什么意思| 过早是什么意思| 女人总犯困是什么原因| 什么茶叶能减肥刮油脂肪| 黑色素痣看什么科| 松鼠的尾巴有什么作用| 竹节虫吃什么| 什么扑鼻| 脂蛋白高是什么意思| 不羁放纵是什么意思| apm是什么牌子| 脚底发麻是什么原因| 既视感什么意思| peek是什么材质| 关节外科主要看什么| 独角仙吃什么食物| 查输卵管是否堵塞要做什么检查| 什么东西抗衰老最好| pe和pb是什么意思| 脑供血不足有什么危害| 什么是低钾血症| 孕反一般什么时候开始| 梦见经血是什么预兆| o型血吃什么瘦的最快| 广州白云区有什么好玩的地方| mrsa是什么细菌| 百香果有什么功效| 坐飞机要带什么证件| 莳字五行属什么| 发芽土豆含有什么毒素| 毒枭是什么意思| 积阴德是什么意思| 竹勿念什么| 呼吸道感染用什么药| 孕妇上火什么降火最快| 就让我爱你把你捧在手心里是什么歌| 包皮开裂擦什么药膏| 肾构错瘤要注意什么| 手脚心出汗是什么原因| 车挂件挂什么保平安好| 什么叫阳痿| 促排是什么意思| h皮带是什么牌子| 鸡腿为什么这么便宜| 九月二十号是什么星座| 职业年金是什么意思| 支原体感染是什么引起的| 胃酸是什么颜色的| 保健是什么意思| 拟物是什么意思| 食管炎吃什么药| 1962年属什么| 何必是什么意思| 一什么头巾| 怀孕吃核桃对宝宝有什么好处| 姓彭的女孩子取什么名字好| 白细胞低什么原因| 乌龟浮水是什么原因| 数字3五行属什么| 百度Jump to content

首艘国产航母曝光23日正式下水 相比辽宁舰提升巨大

From Wikipedia, the free encyclopedia
百度 历届内购会火爆场景:2016年【内购会】2016年【内购会】2017年【内购会】2017年【内购会】第十届国美内购会,时间历史性的从往届的一天延长至两天,3月31日-4月1日,只为消费者不会错过低价优质好货,可以收获一份2018年的开年惊喜。

A von Neumann architecture scheme

The von Neumann architecture—also known as the von Neumann model or Princeton architecture—is a computer architecture based on the First Draft of a Report on the EDVAC,[1] written by John von Neumann in 1945, describing designs discussed with John Mauchly and J. Presper Eckert at the University of Pennsylvania's Moore School of Electrical Engineering. The document describes a design architecture for an electronic digital computer made of "organs" that were later understood to have these components:[1]:?1–4?[2]

The attribution of the invention of the architecture to von Neumann is controversial, not least because Eckert and Mauchly had done a lot of the required design work and claim to have had the idea for stored programs long before discussing the ideas with von Neumann and Herman Goldstine.[3]

The term "von Neumann architecture" has evolved to refer to any stored-program computer in which an instruction fetch and a data operation cannot occur at the same time (since they share a common bus). This is referred to as the von Neumann bottleneck, which often limits the performance of the corresponding system.[4]

The von Neumann architecture is simpler than the Harvard architecture (which has one dedicated set of address and data buses for reading and writing to memory and another set of address and data buses to fetch instructions).

A stored-program computer uses the same underlying mechanism to encode both program instructions and data as opposed to designs which use a mechanism such as discrete plugboard wiring or fixed control circuitry for instruction implementation. Stored-program computers were an advancement over the manually reconfigured or fixed function computers of the 1940s, such as the Colossus and the ENIAC. These were programmed by setting switches and inserting patch cables to route data and control signals between various functional units.

The vast majority of modern computers use the same hardware mechanism to encode and store both data and program instructions, but have caches between the CPU and memory, and, for the caches closest to the CPU, have separate caches for instructions and data, so that most instruction and data fetches use separate buses (split-cache architecture).

History

[edit]

The earliest computing machines had fixed programs. Some very simple computers still use this design, either for simplicity or training purposes. For example, a desk calculator (in principle) is a fixed program computer. It can do basic mathematics, but it cannot run a word processor or games. Changing the program of a fixed-program machine requires rewiring, restructuring, or redesigning the machine. The earliest computers were not so much "programmed" as "designed" for a particular task. "Reprogramming"—when possible at all—was a laborious process that started with flowcharts and paper notes, followed by detailed engineering designs, and then the often-arduous process of physically rewiring and rebuilding the machine. It could take three weeks to set up and debug a program on ENIAC.[5]

With the proposal of the stored-program computer, this changed. A stored-program computer includes, by design, an instruction set, and can store in memory a set of instructions (a program) that details the computation.

A stored-program design also allows for self-modifying code. One early motivation for such a facility was the need for a program to increment or otherwise modify the address portion of instructions, which operators had to do manually in early designs. This became less important when index registers and indirect addressing became usual features of machine architecture. Another use was to embed frequently used data in the instruction stream using immediate addressing.

When von Neumann described the automatic computing systems using different terminology than is typically described with the model. In the First Draft of a Report on the EDVAC,[1] the architecture was composed of "a high-speed memory M, a central arithmetic unit CA, an outside recording medium R, an input organ I, an output organ O, and a central control CC" [6]

Capabilities

[edit]

On a large scale, the ability to treat instructions as data is what makes assemblers, compilers, linkers, loaders, and other automated programming tools possible. It makes "programs that write programs" possible.[7] This has made a sophisticated self-hosting computing ecosystem flourish around von Neumann architecture machines.

Some high-level languages leverage the von Neumann architecture by providing an abstract, machine-independent way to manipulate executable code at runtime (e.g., LISP), or by using runtime information to tune just-in-time compilation (e.g. languages hosted on the Java virtual machine, or languages embedded in web browsers).

On a smaller scale, some repetitive operations such as BITBLT or pixel and vertex shaders can be accelerated on general purpose processors with just-in-time compilation techniques. This is one use of self-modifying code that has remained popular.

Development of the stored-program concept

[edit]

The mathematician Alan Turing, who had been alerted to a problem of mathematical logic by the lectures of Max Newman at the University of Cambridge, wrote a paper in 1936 entitled On Computable Numbers, with an Application to the Entscheidungsproblem, which was published in the Proceedings of the London Mathematical Society.[8] In it he described a hypothetical machine he called a universal computing machine, now known as the "Universal Turing machine". The hypothetical machine had an infinite store (memory in today's terminology) that contained both instructions and data. John von Neumann became acquainted with Turing while he was a visiting professor at Cambridge in 1935, and also during Turing's PhD year at the Institute for Advanced Study in Princeton, New Jersey during 1936–1937. Whether he knew of Turing's paper of 1936 at that time is not clear.

In 1936, Konrad Zuse also anticipated, in two patent applications, that machine instructions could be stored in the same storage used for data.[9]

Independently, J. Presper Eckert and John Mauchly, who were developing the ENIAC at the Moore School of Electrical Engineering of the University of Pennsylvania, wrote about the stored-program concept in December 1943. [10][11] In planning a new machine, EDVAC, Eckert wrote in January 1944 that they would store data and programs in a new addressable memory device, a mercury metal delay-line memory. This was the first time the construction of a practical stored-program machine was proposed. At that time, he and Mauchly were not aware of Turing's work.

Von Neumann was involved in the Manhattan Project at the Los Alamos National Laboratory. It required huge amounts of calculation, and thus drew him to the ENIAC project, during the summer of 1944. There he joined the ongoing discussions on the design of this stored-program computer, the EDVAC. As part of that group, he wrote up a description titled First Draft of a Report on the EDVAC[1] based on the work of Eckert and Mauchly. It was unfinished when his colleague Herman Goldstine circulated it, and bore only von Neumann's name (to the consternation of Eckert and Mauchly).[12] The paper was read by dozens of von Neumann's colleagues in America and Europe, and influenced[vague] the next round of computer designs.

Jack Copeland considers that it is "historically inappropriate to refer to electronic stored-program digital computers as 'von Neumann machines'".[13] His Los Alamos colleague Stan Frankel said of von Neumann's regard for Turing's ideas[14]

I know that in or about 1943 or '44 von Neumann was well aware of the fundamental importance of Turing's paper of 1936.... Von Neumann introduced me to that paper and at his urging I studied it with care. Many people have acclaimed von Neumann as the "father of the computer" (in a modern sense of the term) but I am sure that he would never have made that mistake himself. He might well be called the midwife, perhaps, but he firmly emphasized to me, and to others I am sure, that the fundamental conception is owing to Turing—in so far as not anticipated by Babbage.... Both Turing and von Neumann, of course, also made substantial contributions to the "reduction to practice" of these concepts but I would not regard these as comparable in importance with the introduction and explication of the concept of a computer able to store in its memory its program of activities and of modifying that program in the course of these activities.

At the time that the "First Draft" report was circulated, Turing was producing a report entitled Proposed Electronic Calculator. It described in engineering and programming detail, his idea of a machine he called the Automatic Computing Engine (ACE).[15] He presented this to the executive committee of the British National Physical Laboratory on February 19, 1946. Although Turing knew from his wartime experience at Bletchley Park that what he proposed was feasible, the secrecy surrounding Colossus, that was subsequently maintained for several decades, prevented him from saying so. Various successful implementations of the ACE design were produced.

Both von Neumann's and Turing's papers described stored-program computers, but von Neumann's earlier paper achieved greater circulation and the computer architecture it outlined became known as the "von Neumann architecture". In the 1953 publication Faster than Thought: A Symposium on Digital Computing Machines (edited by B. V. Bowden), a section in the chapter on Computers in America reads as follows:[16]

The Machine of the Institute For Advanced Study, Princeton

In 1945, Professor J. von Neumann, who was then working at the Moore School of Engineering in Philadelphia, where the E.N.I.A.C. had been built, issued on behalf of a group of his co-workers, a report on the logical design of digital computers. The report contained a detailed proposal for the design of the machine that has since become known as the E.D.V.A.C. (electronic discrete variable automatic computer). This machine has only recently been completed in America, but the von Neumann report inspired the construction of the E.D.S.A.C. (electronic delay-storage automatic calculator) in Cambridge (see p. 130).

In 1947, Burks, Goldstine and von Neumann published another report that outlined the design of another type of machine (a parallel machine this time) that would be exceedingly fast, capable perhaps of 20,000 operations per second. They pointed out that the outstanding problem in constructing such a machine was the development of suitable memory with instantaneously accessible contents. At first they suggested using a special vacuum tube—called the "Selectron"—which the Princeton Laboratories of RCA had invented. These tubes were expensive and difficult to make, so von Neumann subsequently decided to build a machine based on the Williams memory. This machine—completed in June, 1952 in Princeton—has become popularly known as the Maniac. The design of this machine inspired at least half a dozen machines now being built in America, all known affectionately as "Johniacs".

In the same book, the first two paragraphs of a chapter on ACE read as follows:[17]

Automatic Computation at the National Physical Laboratory

One of the most modern digital computers which embodies developments and improvements in the technique of automatic electronic computing was recently demonstrated at the National Physical Laboratory, Teddington, where it has been designed and built by a small team of mathematicians and electronics research engineers on the staff of the Laboratory, assisted by a number of production engineers from the English Electric Company, Limited. The equipment so far erected at the Laboratory is only the pilot model of a much larger installation which will be known as the Automatic Computing Engine, but although comparatively small in bulk and containing only about 800 thermionic valves, as can be judged from Plates XII, XIII and XIV, it is an extremely rapid and versatile calculating machine.

The basic concepts and abstract principles of computation by a machine were formulated by Dr. A. M. Turing, F.R.S., in a paper1. read before the London Mathematical Society in 1936, but work on such machines in Britain was delayed by the war. In 1945, however, an examination of the problems was made at the National Physical Laboratory by Mr. J. R. Womersley, then superintendent of the Mathematics Division of the Laboratory. He was joined by Dr. Turing and a small staff of specialists, and, by 1947, the preliminary planning was sufficiently advanced to warrant the establishment of the special group already mentioned. In April, 1948, the latter became the Electronics Section of the Laboratory, under the charge of Mr. F. M. Colebrook.

Early von Neumann-architecture computers

[edit]

The First Draft described a design that was used by many universities and corporations to construct their computers.[18] Among these various computers, only ILLIAC and ORDVAC had compatible instruction sets.

Early stored-program computers

[edit]

The date information in the following chronology is difficult to put into proper order. Some dates are for first running a test program, some dates are the first time the computer was demonstrated or completed, and some dates are for the first delivery or installation.

  • The IBM SSEC had the ability to treat instructions as data, and was publicly demonstrated on January 27, 1948. This ability was claimed in a US patent.[21][22] However it was partially electromechanical, not fully electronic. In practice, instructions were read from paper tape due to its limited memory.[23]
  • The ARC2 developed by Andrew Booth and Kathleen Booth at Birkbeck, University of London officially came online on May 12, 1948.[19] It featured the first rotating drum storage device.[24][25]
  • The Manchester Baby was the first fully electronic computer to run a stored program. It ran a factoring program for 52 minutes on June 21, 1948, after running a simple division program and a program to show that two numbers were relatively prime.
  • The ENIAC was modified to run as a primitive read-only stored-program computer (using the Function Tables for program ROM) and was demonstrated as such on September 16, 1948, running a program by Adele Goldstine for von Neumann.
  • The BINAC ran some test programs in February, March, and April 1949, although was not completed until September 1949.
  • The Manchester Mark 1 developed from the Baby project. An intermediate version of the Mark 1 was available to run programs in April 1949, but was not completed until October 1949.
  • The EDSAC ran its first program on May 6, 1949.
  • The EDVAC was delivered in August 1949, but it had problems that kept it from being put into regular operation until 1951.
  • The CSIR Mk I ran its first program in November 1949.
  • The SEAC was demonstrated in April 1950.
  • The Pilot ACE ran its first program on May 10, 1950, and was demonstrated in December 1950.
  • The SWAC was completed in July 1950.
  • The Whirlwind was completed in December 1950 and was in actual use in April 1951.
  • The first ERA Atlas (later the commercial ERA 1101/UNIVAC 1101) was installed in December 1950.

Evolution

[edit]
Single system bus evolution of the architecture

Through the decades of the 1960s and 1970s computers generally became both smaller and faster, which led to evolutions in their architecture. For example, memory-mapped I/O lets input and output devices be treated the same as memory.[26] A single system bus could be used to provide a modular system with lower cost[clarification needed]. This is sometimes called a "streamlining" of the architecture.[27] In subsequent decades, simple microcontrollers would sometimes omit features of the model to lower cost and size. Larger computers added features for higher performance.

Design limitations

[edit]

von Neumann bottleneck

[edit]

The use of the same bus to fetch instructions and data leads to the von Neumann bottleneck, the limited throughput (data transfer rate) between the central processing unit (CPU) and memory compared to the amount of memory. Because the single bus can only access one of the two classes of memory at a time, throughput is lower than the rate at which the CPU can work. This seriously limits the effective processing speed when the CPU is required to perform minimal processing on large amounts of data. The CPU is continually forced to wait for needed data to move to or from memory. Since CPU speed and memory size have increased much faster than the throughput between them, the bottleneck has become more of a problem, a problem whose severity increases with every new generation of CPU.

The von Neumann bottleneck was described by John Backus in his 1977 ACM Turing Award lecture. According to Backus:

Surely there must be a less primitive way of making big changes in the store than by pushing vast numbers of words back and forth through the von Neumann bottleneck. Not only is this tube a literal bottleneck for the data traffic of a problem, but, more importantly, it is an intellectual bottleneck that has kept us tied to word-at-a-time thinking instead of encouraging us to think in terms of the larger conceptual units of the task at hand. Thus programming is basically planning and detailing the enormous traffic of words through the von Neumann bottleneck, and much of that traffic concerns not significant data itself, but where to find it.[28][29]

Mitigations

[edit]

There are several known methods for mitigating the Von Neumann performance bottleneck. For example, the following all can improve performance:[why?]

The problem can also be sidestepped somewhat by using parallel computing, using for example the non-uniform memory access (NUMA) architecture—this approach is commonly employed by supercomputers. It is less clear whether the intellectual bottleneck that Backus criticized has changed much since 1977. Backus's proposed solution has not had a major influence.[citation needed] Modern functional programming and object-oriented programming are much less geared towards "pushing vast numbers of words back and forth"[how?] than earlier languages like FORTRAN were, but internally, that is still what computers spend much of their time doing, even highly parallel supercomputers.[citation needed]

Self-modifying code

[edit]

Aside from the von Neumann bottleneck, program modifications can be quite harmful, either by accident or design.[citation needed] In some simple stored-program computer designs[which?], a malfunctioning program can damage itself, other programs, or the operating system, possibly leading to a computer crash. However, this problem also applies to conventional programs that lack bounds checking. Memory protection and various access controls generally safeguard against both accidental and malicious program changes.

See also

[edit]

References

[edit]
  1. ^ a b c d von Neumann, John (1945), First Draft of a Report on the EDVAC (PDF), archived from the original (PDF) on March 14, 2013, retrieved August 24, 2011
  2. ^ Ganesan 2009
  3. ^ Bergin, Thomas J. (2000), Fifty Years of Army Computing: From ENIAC to MSRC, U.S. Army Research Laboratory, p. 34, retrieved November 5, 2024
  4. ^ Markgraf, Joey D. (2007), The Von Neumann Bottleneck, archived from the original on December 12, 2013.
  5. ^ Copeland 2006, p. 104.
  6. ^ von Neumann, Jon (1966). Theory of Self-reproducing Automata. University of Illinois Press. p. 10. ISBN 978-0252727337.
  7. ^ MFTL (My Favorite Toy Language) entry Jargon File 4.4.7, retrieved July 11, 2008.
  8. ^ Turing, Alan M. (1936), "On Computable Numbers, with an Application to the Entscheidungsproblem", Proceedings of the London Mathematical Society, 2, vol. 42 (published 1937), pp. 230–265, doi:10.1112/plms/s2-42.1.230, S2CID 73712 and Turing, Alan M. (1938), "On Computable Numbers, with an Application to the Entscheidungsproblem. A correction", Proceedings of the London Mathematical Society, 2, vol. 43, no. 6 (published 1937), pp. 544–546, doi:10.1112/plms/s2-43.6.544.
  9. ^ Williams, F. C.; Kilburn, T. (September 25, 1948), "Electronic Digital Computers", Nature, 162 (4117): 487, Bibcode:1948Natur.162..487W, doi:10.1038/162487a0, S2CID 4110351.
  10. ^ Lukoff, Herman (1979). From Dits to Bits: A personal history of the electronic computer. Portland, Oregon: Robotics Press. ISBN 0-89661-002-0. LCCN 79-90567.
  11. ^ ENIAC project administrator Grist Brainerd's December 1943 progress report for the first period of the ENIAC's development implicitly proposed the stored program concept (while simultaneously rejecting its implementation in the ENIAC) by stating that "in order to have the simplest project and not to complicate matters", the ENIAC would be constructed without any "automatic regulation".
  12. ^ Copeland 2006, p. 113.
  13. ^ Copeland, Jack (2000), A Brief History of Computing: ENIAC and EDVAC, retrieved January 27, 2010.
  14. ^ Copeland, Jack (2000), A Brief History of Computing: ENIAC and EDVAC, retrieved January 27, 2010 (a work which cites Randell, Brian (1972), Meltzer, B.; Michie, D. (eds.), "On Alan Turing and the Origins of Digital Computers", Machine Intelligence, 7, Edinburgh: Edinburgh University Press: 10, ISBN 0-902383-26-4.
  15. ^ Copeland 2006, pp. 108–111.
  16. ^ Bowden 1953, pp. 176, 177.
  17. ^ Bowden 1953, p. 135.
  18. ^ "Electronic Computer Project". Institute for Advanced Study. September 11, 2009. Retrieved May 26, 2011.
  19. ^ a b Campbell-Kelly, Martin (April 1982). "The Development of Computer Programming in Britain (1945 to 1955)". IEEE Annals of the History of Computing. 4 (2): 121–139. doi:10.1109/MAHC.1982.10016. S2CID 14861159.
  20. ^ Robertson, James E. (1955), Illiac Design Techniques, report number UIUCDCS-R-1955–146, Digital Computer Laboratory, University of Illinois at Urbana-Champaign.
  21. ^ Selective Sequence Electronic Calculator (USPTO Web site).
  22. ^ Selective Sequence Electronic Calculator (Google Patents).
  23. ^ Grosch, Herbert R. J. (1991), Computer: Bit Slices From a Life, Third Millennium Books, ISBN 0-88733-085-1.
  24. ^ Lavington, Simon, ed. (2012). Alan Turing and his Contemporaries: Building the World's First Computers. London: British Computer Society. p. 61. ISBN 978-1906124908.
  25. ^ Johnson, Roger (April 2008). "School of Computer Science & Information Systems: A Short History" (PDF). Birkbeck College. University of London. Retrieved July 23, 2017.
  26. ^ Bell, C. Gordon; Cady, R.; McFarland, H.; O'Laughlin, J.; Noonan, R.; Wulf, W. (1970), "A New Architecture for Mini-Computers – The DEC PDP-11" (PDF), Spring Joint Computer Conference, pp. 657–675.
  27. ^ Null, Linda; Lobur, Julia (2010), The essentials of computer organization and architecture (3rd ed.), Jones & Bartlett Learning, pp. 36, 199–203, ISBN 978-1-4496-0006-8.
  28. ^ Backus, John W. (August 1978). "Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs". Communications of the ACM. 21 (8): 613–641. doi:10.1145/359576.359579. S2CID 16367522.
  29. ^ Dijkstra, Edsger W. "E. W. Dijkstra Archive: A review of the 1977 Turing Award Lecture". Retrieved July 11, 2008.

Further reading

[edit]
[edit]
什么地叹气 头孢不能和什么一起吃 剪头发叫什么手术 检查肝挂什么科 口腔溃疡可以吃什么
rpr是什么检查项目 蛟龙是什么意思 依托考昔片是什么药 儿童头晕挂什么科 深圳少年宫有什么好玩的
dbm是什么意思 巨蟹座前面是什么星座 中元节注意什么 胃在什么地方 上午十点到十一点是什么时辰
化疗期间吃什么最好 小腿发胀是什么原因 hmo是什么意思 pro是什么氨基酸 梦见很多蜘蛛是什么意思
脑梗吃什么hcv8jop3ns8r.cn 赤什么意思hcv9jop2ns2r.cn 为什么吃肉多反而瘦了zsyouku.com 宝宝大便有泡沫是什么原因hcv9jop1ns1r.cn 蝉什么时候出来hcv8jop1ns9r.cn
什么是湿热hcv8jop8ns1r.cn 老鼠屎长什么样hcv8jop7ns1r.cn 谅解什么意思hcv9jop3ns3r.cn 空心菜不能和什么一起吃hcv9jop2ns5r.cn 小孩反复发烧是什么原因引起的aiwuzhiyu.com
海洋里面有什么动物hcv9jop1ns5r.cn 佞臣什么意思hcv7jop6ns6r.cn 鸡眼和疣有什么区别hcv8jop2ns2r.cn 什么品牌奶粉最好hcv8jop6ns6r.cn phr是什么词性hcv9jop4ns6r.cn
五月二十六是什么星座hcv7jop7ns4r.cn 梦到吃饭是什么意思hcv8jop3ns0r.cn 八卦是什么生肖hcv9jop2ns1r.cn 货值是什么意思hcv8jop4ns4r.cn 生脉饮适合什么人群hcv9jop8ns2r.cn
百度