Home > Articles > Software Development & Management

  • Print
  • + Share This
This chapter is from the book

3.6 I/O Performance Tips for Application Writers

3.6.1 The I/O Routines You Use Will Make a Difference

Let’s start this section with a simple question—do you travel to the supermarket and purchase two slices of bread each time you make a sandwich? Well, we certainly hope not. You probably buy a loaf of bread at a time and take two slices of bread from it each time you make a sandwich. The time and economics involved in travelling to the supermarket for individual items are not practical.

In an effort to duplicate this efficiency of getting several things with each trip to the more remote storage devices, buffered I/O mechanisms were developed. The most common is that found in the C programming language with the fread() and fwrite() subroutines.

This mechanism, described as buffered binary I/O to a stream file, works roughly as follows. A file is opened with the fopen() subroutine call instead of the open() system call. In the process of opening this file, fopen() also initializes data structures to maintain a buffer, allocated in the user’s address space (as opposed to the kernel’s address space). This buffer varies in size and the user can actually manipulate how this buffer is allocated and what its size will be. Subsequent to the fopen() call, transfers to and from the file are accomplished with calls to the subroutines fwrite() and fread(), respectively. These subroutines first check to see if the data being requested is already in the buffer. If it is, then the data is simply copied from the buffer into the destination specified by the procedure call. Thus, no system call is made and no transfer of data is made to or from the kernel’s address space (i.e., buffer cache). If the data is not already in the buffer, then the subroutines make the necessary system call to move blocks of data into and out of the buffer from the file.

Some implementations of these buffered binary I/O routines use relatively small buffers. As a result, these routines can be slower than system calls for large transfers. One way to improve this situation is to make use of the setvbuf() routine. This routine allows the user to specify another buffer that can be much larger in size. For example, to change the internal buffer used by buffered I/O, one might use the following C code:

work_buffer = (char *)malloc(65536); 
fp = fopen( workfile, "r+" ); 
if( fp == NULL ) { perror("fopen"); exit(-1); } 
setvbuf( fp, work_buffer, _IOFBF, (size_t)65536 ); 

This sequence assigns the 64 KB array work_buffer to the file pointer fp to be used for its buffering. The performance benefit of doing this will be shown below.

Using language-specific I/O routines such as the Fortran I/O statements (e.g., open(), read(), write(), etc.) can be extremely detrimental to performance. Implementations vary, but in many cases these routines are built on top of the buffered binary I/O mechanisms (fopen(), fread(), fwrite(), etc.) discussed above. Fortran provides for some additional functionality in these I/O routines, which leads to yet more overhead for doing the actual I/O transfers. Fortran read performance is typically worse than either using the system call interface or the buffered binary I/O mechanisms.

To illustrate this, a comparison of reading a file using the read() system call, fread(), fread() with a 64 KB transfer size, and Fortran I/O was made on a HP N-4000 server using HP-UX 11.0 operating system. The Fortran I/O was performed with an implied DO loop using the following calls:

OPEN( FILDES, FORM='UNFORMATTED', FILE='./tmp/temp.test' ); 

Note that the default buffer size for HP-UX’s buffered binary I/O is eight KB. The time to make transfers of various sizes is given in Table 3-5. The times shown are the milliseconds per transfer for using various I/O interfaces. A 100 MB file was read sequentially starting from the beginning of the file to produce these times. The file system buffer cache was configured to be roughly 500 MB in size so that the file would fit entirely in the buffer cache. So, the times reflect transfers from the buffer cache and not from magnetic disk.

Table 3-5. Average Time, in Microseconds, to Read Data From Files Using Three Common Interfaces as a Function of Transfer Size.

Transfer Size (bytes)

read system call


Fortran unformatted read









1 K




8 K




64 K




From the table, one can draw many conclusions. Note that the buffered binary I/O mechanism is very efficient for small (less than four KB) transfers. For transfers of eight KB or more, the binary I/O interface (fread) benefits from a larger I/O buffer; in this case, 64 KB was used. However, note that using a system call to perform the I/O is substantially faster than the other methods for transfers of eight KB or more. Under no circumstances is the Fortran I/O faster than any of the other interfaces.

One word of warning with regard to the use of large (more than 64 KB) transfer sizes and system calls. Some file systems are capable of being configured so that transfers exceeding a certain size will bypass the file system buffer cache. This is referred to as direct I/O or buffer cache bypass. The intent is to keep extremely large files from occupying the entire buffer cache and/or to reduce the load on the memory system by eliminating the additional copy from buffer cache memory to user memory. The downside to this approach is that the operating system cannot perform read-ahead. Hence, the user will not benefit from memory-to-memory copy speeds.

There’s actually another lesson in Table 3-5. If we divide the transfer sizes by the time, we can get bandwidth performance. Table 3-6 contains a variation of Table 3-5 modified to reflect bandwidth rather than the amount of time per transfer. Note that the read system call delivers roughly twice the performance of other common interfaces. Thus if an application can do its own buffering, that is, read in 64 KB of data at a time, then the benefits can be tremendous.

Table 3-6. Effective Bandwidth in MB/Second for Various I/O Interfaces as a Function of Transfer Size.

Transfer Size (bytes)

read system call


Fortran unformatted read









1 K




8 K




64 K




The poor performance of Fortran I/O is now clear. Note that the read system call using large transfers delivers the best bandwidth. So, if your application can do its own buffering and use system calls to transfer data between your buffer and files, then that could well be the best performance option.

3.6.2 Asynchronous I/O

The Portable Operating System Interface (POSIX) standard defines a set of interfaces that enables the programmer to perform I/O asynchronous to program execution. Basically, an asynchronous read or write is accomplished by creating or using an additional flow of control to perform the actual I/O while the user’s program continues to execute. This is illustrated for an asynchronous read in Figure 3-5 below. Note the use of the aio_suspend() routine to cause the calling program to suspend processing until the read completes.

03fig05.gifFigure 3-5. Asynchronous I/O enables processing to continue without waiting for file transfers to complete.

Asynchronous I/O provides the benefits of system call performance with parallelism. Details of the POSIX asynchronous I/O facility will be discussed in Chapter 8, and it should be considered for use in I/O intensive applications. There are some downsides to use of asynchronous I/O functions. Some implementations of asynchronous I/O actually create an additional flow of control in the operating system and then destroy it upon the function’s completion. This can add a tremendous amount of time to that required to actually transfer the data. SGI’s IRIX operating system provides the aio_sgi_init() function to alleviate this problem. The user can identify the number of asynchronous operations to be used by the program, allowing the operating system to more efficiently service those operations.

  • + Share This
  • 🔖 Save To Your Account

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