Coordinated checkpointing is a well-known method to achieve fault tolerance in distributed systems. Longrunning parallel applications and high-availability applications are two potential users of checkpointing, although with different requirements. Parallel applications need low failure-free overheads, and high-availability applications require fast and bounded recoveries. In this paper, we des...

We present a pointer and array access checking technique that provides complete error coverage through a simple set of program transformations. Our technique, based on an extended safe pointer representation, has a number of novel aspects. Foremost, it is the rst technique that detects all spatial and temporal access errors. Its use is not limited by the expressiveness of the language; that is,...

We present a pointer and array access checking technique that provides complete error coverage through a simple set of program transformations. Our technique, based on an extended safe pointer representation, has a number of novel aspects. Foremost, it is the rst technique that detects all spatial and temporal access errors. Its use is not limited by the expressiveness of the language; that is,...

To conserve space and power as well as to harness high performance in embedded systems, high utilization of the hardware is required. This can be facilitated through dynamic adaptation of the silicon resources in reconfigurable systems in order to realize various customized kernels as execution proceeds. Fortunately, the encountered reconfiguration overheads can be estimated. Therefore, if the ...

Information appliances (IAs) are mass-produced, low-cost devices for specialized computation/communi-cation tasks. Examples include webTV, smart cellular phones, and web phones. Since low cost and low power-consumption are important requirements in the design of these devices, IAs use relatively slow/cheap CPUs (usually 20{40 MHz). Real-time audio and video communication over the Internet is an...

Anonymous communication is very important for many wireless sensor networks, because it can be used to hide the identity of important nodes, such as the base station and a source node. In sensor networks, anonymous communication includes several important aspects, such as source anonymity, communication-relationship anonymity, and base station anonymity. Existing sensor network anonymous scheme...

Classic loop unrolling allows to increase the performance of sequential loops by reducing the overheads of the non-computational parts of the loop. Unfortunately, when the loop contains parallelism inside most compilers will ignore it or perform a näıve transformation. We propose to extend the semantics of the loop unrolling transformation to cover loops that contain task parallelism. In these ...

We identify overheads associated with the current FTP protocol, which uses TCP for transport. We discuss why using TCP to avoid such overheads puts a burden on the application. Unlike TCP, SCTP allows transport layer multistreaming within a single association. We present two modifications to FTP, which use SCTP multistreaming in a “TCP-friendly” manner. Our modifications avoid the identified ov...

Reducing processor-memory speed gap is one of the major challenges computer architects face today. Efficient use of CPU registers reduces the number of memory accesses. However, registers do incur extra overhead of Load/Store, register allocation and saving of register context across procedure calls. Caches however do not have any such overheads and cache technology has matured to the extent th...

Analyzing the scalability behavior and the overheads of OpenMP applications is an important step in the development process of scientific software. Unfortunately, few tools are available that allow an exact quantification of OpenMP related overheads and scalability characteristics. We present a methodology in which we define four overhead categories that we can quantify exactly and describe a t...