{"id":10,"date":"2014-05-14T00:04:00","date_gmt":"2014-05-14T04:04:00","guid":{"rendered":"https:\/\/mberlove.com\/blog\/?p=10"},"modified":"2014-10-08T11:25:10","modified_gmt":"2014-10-08T15:25:10","slug":"confirmed-computers-are-fast","status":"publish","type":"post","link":"https:\/\/mberlove.com\/blog\/confirmed-computers-are-fast\/","title":{"rendered":"Confirmed: &#8220;Computers are Fast&#8221; (!)"},"content":{"rendered":"<p>After reading <a href=\"http:\/\/jvns.ca\/blog\/2014\/05\/12\/computers-are-fast\/\">this post<\/a> by Julia Evans, which considers CPU speeds somewhat more deeply than its title implies (&#8220;Computers are Fast&#8221;), a fragment from a recent conversation with one of my computer science professors came to mind.<\/p>\n<p>Simply, and somewhat paraphrased: &#8220;almost all processes are rapidly becoming I\/O-bound.&#8221;<\/p>\n<p>Not so long ago, in OS Design class, one homework and several questions on exams tasked us to carefully identify whether a process would be I\/O-bound or CPU-bound based on its actions and properties. Would &#8220;I\/O-bound&#8221; have consistently been the correct answer?<br \/>Not according to the professor of that class, at least, since I remember a few answers to the contrary. And I&#8217;d be willing to wager that there remain enough computationally-intensive tasks that OSs must take CPU-bound costs into consideration when scheduling processes, at least in some areas of work.<br \/>But might gains in speed, parallelism, and optimization eventually sway the balance?<\/p>\n<p>My guess is yes &#8212; but only for personal-computing tasks. For example, I&#8217;ve never personally run a highly complex physics particle simulator on a time-slotted supercomputer, but I&#8217;d bet most of that isn&#8217;t too memory-heavy, especially compared to the insane number of calculations required (<a href=\"http:\/\/physics.aps.org\/story\/v19\/st10\">interesting note about reducing calculation cost<\/a>).<br \/>And imagine how that is for some higher-order function, like <a href=\"http:\/\/learncryptography.com\/prime-factorization\/\">prime factorization<\/a> (well, I guess it&#8217;s not officially known to be superpolynomial at this point). The time required to compute can be enormous, but space complexity doesn&#8217;t need to be too bad (they&#8217;re just integers, after all).<\/p>\n<p>I&#8217;m curious to see how things turn out over the next few years. It&#8217;s an exciting time to be computing! &#8212; and when isn&#8217;t it?<\/p>\n","protected":false},"excerpt":{"rendered":"<p>After reading this post by Julia Evans, which considers CPU speeds somewhat more deeply than its title implies (&#8220;Computers are Fast&#8221;), a fragment from a recent conversation with one of my computer science professors came to mind. Simply, and somewhat [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[58,59,60,61,62,63,64,65,66],"class_list":["post-10","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-computer-science","tag-computers-are-fast","tag-cpu-bound","tag-julia-evans","tag-operating-systems","tag-optimization","tag-os","tag-scheduling","tag-speed"],"_links":{"self":[{"href":"https:\/\/mberlove.com\/blog\/wp-json\/wp\/v2\/posts\/10","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mberlove.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/mberlove.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/mberlove.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mberlove.com\/blog\/wp-json\/wp\/v2\/comments?post=10"}],"version-history":[{"count":1,"href":"https:\/\/mberlove.com\/blog\/wp-json\/wp\/v2\/posts\/10\/revisions"}],"predecessor-version":[{"id":78,"href":"https:\/\/mberlove.com\/blog\/wp-json\/wp\/v2\/posts\/10\/revisions\/78"}],"wp:attachment":[{"href":"https:\/\/mberlove.com\/blog\/wp-json\/wp\/v2\/media?parent=10"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/mberlove.com\/blog\/wp-json\/wp\/v2\/categories?post=10"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/mberlove.com\/blog\/wp-json\/wp\/v2\/tags?post=10"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}