Home > Articles > Programming > General Programming/Other Languages

How Hardware Will Shape Languages

Until about a decade ago, programming languages led hardware design, with new features being added to chips to make it easier to implement existing language features. More recently, the trend has started to reverse. David Chisnall looks at the challenges that new processor designs pose to language designers.
Like this article? We recommend

Like this article? We recommend

Over the last decade, we've seen a subtle change in how mainstream processors are designed. Earlier chips were created for specific languages. The Berkeley RISC, for example, was designed to run C code, which contained a lot more structure than typical assembly programs of the era. Lisp machines, obviously, were designed for Lisp.

Additions to the instruction sets were usually made to make implementing certain language features easier. CALL instructions simplified implementing procedural languages. Floating-point operations made it trivial to support the floating-point data types that most languages included.

This was quite an easy way to use up transistors early on. More recent chips have started moving in a slightly different direction, providing features for specific algorithms rather than for specific languages. Vector units were among the first extensions to be created in this way. They were added specifically to make it easier to run certain multimedia applications.

For the first time since the 1980s, compiler writers were no longer the main target market for new instruction set additions; instead, library authors were targeted. You can see a concrete example with SSE. Modern x86 compilers use the SSE instruction set rather than the x87 coprocessor for floating-point operations, because the SSE is easier to target. With SSE, you can (usually) run an operation on four 32-bit or two 64-bit values for about the same cost as running it for one floating-point operand.

Unfortunately, typical compiled code only gets one-quarter to one-half the theoretical maximum floating-point throughput of the CPU. Various autovectorization techniques attempt to group operations so that they can be run in parallel, but this is quite difficult, and compilers aren't very good at it. Making efficient use of these units requires some programmer effort. You can't just take an arbitrary C program and run all of the floating-point operations on a vector unit, but you can extend C to allow vector types.

It's not unusual for a modern computer to contain a coprocessor with a higher transistor count than the main CPU has. The name of this coprocessor, the graphics processing unit (GPU), is a significant clue that it was designed for running specific algorithms, rather than for specific languages.

Indeed, several languages have been designed specifically to run on these coprocessors—Cg, GLSL, HLSL, and so on. In some ways, this situation represents a step backward in computing. The promise of high-level languages was that they would allow you to ignore the details of the underlying architecture. Unfortunately, this promise wasn't entirely fulfilled. Languages like C, which barely qualifies as "high-level" these days, expose too much detail about certain types of architecture, while others hide the system so well that even simple things become expensive.

The Language Barrier

When I first learned it, C was regarded as a high-level language because it was portable. In contrast, PL/M, the language that I learned before C, was a low-level language because it exposed CPU-specific features such as memory segmentation directly to the programmer. These days, C is more commonly regarded as a low-level language.

What does this semantic difference really mean? In rough terms, in a low-level language, the language constructs map simply to instruction sequences. An optimizing C compiler will reorder instructions, perform substitutions, and so on, but the basic language features can each be implemented in just a few instructions on a typical architecture. C only supports operations on primitive types, which typically translate to a single instruction, possibly bracketed by a load and a store. Flow control in C is implemented trivially in terms of jump and call instructions.

This is why C is generally considered to be fast—not because anything about the language makes it especially efficient. Quite the reverse, in fact. For example, if a language doesn't give the programmer control over memory layout, it gives the compiler a lot more opportunities to make use of vector instructions, which requires a lot of cleverness on the part of the compiler. C, in contrast, runs quickly with a stupid compiler.

You can see this principle demonstrated in the case of the Portable C Compiler. In spite of performing very few optimizations, it still produces code that's reasonably fast. It's slower than the output from a better C compiler, but still a lot better than a naïve implementation of a language like Smalltalk or Haskell.

Speed isn't always the result, however. If you take a typical C program and compile it for a modern GPU, you'll see some problems. A modern CPU is designed around branch-heavy programs. Typical profiling tests show that most code written in C-like languages branches every seven instructions, on average. A lot of effort is spent on making branch prediction work well in these processors. If you can't predict the target of a branch, then you have to wait for all of the instructions in the pipeline to finish before you can run it.

By contrast, GPUs don't bother with branch prediction. They expect to run code that has a branch only once in every few hundred instructions. Instead, they use transistors to implement things like trigonometric operations as single instructions. They also expect to run the same program fragment on large amounts of data. In a typical 3D program, they run the same vertex shader on every point in a scene, the same pixel shader on every textured pixel, and so on. NVIDIA's current architecture runs threads in groups of four, purely in parallel when they're executing the same instructions at the same time, but with a big performance penalty if they get out of sync (for instance, if two different threads take different branches). Finally, they run a lot of these thread groups in parallel.

C isn't a low-level language on such an architecture. It doesn't contain vector types, it doesn't expose any of the more complex operations that are available, and it doesn't include any support for concurrency. In this case, C is considered a high-level language because it presents an abstract model that doesn't closely match the underlying hardware.

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020