It is a well-known that data races in implicit threading applications, such as OpenMP programs, are the most notorious class of concurrency bugs, because they may lead to unpredictable results of the program. The main drawback of on-the-fly data race detection techniques is the heavy additional overheads for analyzing every memory operations and thread operations, such as load, store, fork, and...

The key to achieving universal network scalability is hierarchical organisation, where routing information is aggregated between levels in the hierarchy. This approach can considerably reduce the overheads due to storage, transfer and processing of routing information for large networks. Other benefits include increased security and ease of management of the network. Due to the high routing com...

In this paper, we present the Immediate Neighbourhood Temperature (INT) routing algorithm which balances thermal profiles across dynamically-throttled 3D NoCs by adaptively routing interconnect traffic based on runtime temperature monitoring. INT avoids the overheads of system-wide temperature monitoring by relying on the heat transfer characteristics of 3D integrated circuits which enable temp...

Voice over Internet Protocol (VoIP) is one of the most important technologies in the world of communication. Around 20 years of research on VoIP, some Quality of Service (QoS) problems of VoIP are still remaining. The newly emerging wireless mesh network has fundamental difficulties in supporting VoIP applications due to the MAC overheads introduced by huge amounts of small packets. Packet aggr...

PLASTIC [1] is a recently-proposed tool to help query optimizers significantly amortize optimization overheads through a technique of plan recycling. The tool groups similar queries into clusters and uses the optimizer-generated plan for the cluster representative to execute all future queries assigned to the cluster. An earlier demo [2] had presented a basic prototype implementation of PLASTIC...

Quality-of-service (QoS) routing satisfies application performance requirements and optimizes network resource usage but effective path-selection schemes require the distribution of link-state information, which can impose a significant burden on the bandwidth and processing resources in the network. We investigate the fundamental trade-off between network overheads and the quality of routing d...

We use simulations to study the comparative routing overheads of three ad-hoc routing protocols, namely AODV, DSDV and DSR. In contrast to earlier studies, we focus exclusively on the energy consumption and not on other metrics such as the number of routing packets. In particular, we study the ‘range effects’ of the three protocols, i.e., how changes to the transmission power and transmission r...

Linux currently plays an important role in high-end computing systems, but recent work has shown that Linux-related processing costs and variablity in network processing times can limit the scalability of HPC applications. Measuring and understanding these overheads is thus key for future use of Linux in large scale HPC systems. Unfortunately, currently available performance monitoring systems ...

This paper presents a new methodology for statically scheduling a cyclic dataow graph whose node computation times can be represented by random variables. A communication cost issue is also considered as another uncertain factor in which each node from the graph can produce di erent amount of data depending on the probability of its computation time. Since such communication costs rely on the a...