11038275
Exploiting idle register classes for fast spill destination
On today's microprocessors, there often exist several different types of registers, e.g. general purpose registers and floating point registers. A given program may use one type of registers much more frequently than other types. This creates an opportunity to employ the infrequently used registers as spill destinations for the more frequently used register types. In this paper, we present a code optimization method named idle register exploitation (IRE) to exploit such opportunities. We developed a model, called the IRE model, or IREM, to determine the static performance gains of IRE versus spilling to the stack. On a microprocessor with fast data paths between different types of registers, we find that IRE method speeds up the execution of the SPECint benchmark suite from 1.7% to 10%. In contrast, on microprocessors with less efficient data transfer paths, the performance gain is limited. In some cases, performance may even suffer degradation. This result argues strongly for the adoption of fast data paths between different types of registers for the purpose of reducing register spills, which is important in view of the increased significance of memory bottlenecks on future microprocessors.
752937
In cloud, do MTC or HTC service providers benefit from the economies of scale?
Cloud computing, which is advocated as an economic platform for daily computing, has become a hot topic for both industrial and academic communities in the last couple of years. The basic idea behind cloud computing is that resource providers, which own the cloud platform, offer elastic resources to end users. In this paper, we intend to answer one key question to the success of cloud computing: in cloud, do many task computing (MTC) or high throughput computing (HTC) service providers, which offer the corresponding computing service to end users, benefit from the economies of scale? To the best of our knowledge, no previous work designs and implements the enabling system to consolidate MTC and HTC workloads on the cloud platform and no one answers the above question. Our research contributions are threefold: first, we propose an innovative usage model, called dynamic service provision (DSP) model, for MTC or HTC service providers. In the DSP model, the resource provider provides the service of creating and managing runtime environments for MTC or HTC service providers, and consolidates heterogeneous MTC or HTC workloads on the cloud platform; second, based on the DSP model, we design and implement Dawningcloud, which provides automatic management for heterogeneous workloads; third, a comprehensive evaluation of Dawningcloud has been performed in an emulatation experiment. We found that for typical workloads, in comparison with the previous two cloud solutions, Dawningcloud saves the resource consumption maximally by 46.4% (HTC) and 74.9% (MTC) for the service providers, and saves the total resource consumption maximally by 29.7% for the resource provider. At the same time, comparing with the traditional solution that provides MTC or HTC services with dedicated systems, Dawningcloud is more cost-effective. To this end, we conclude that for typical MTC and HTC workloads, on the cloud platform, MTC and HTC service providers and the resource service provider can benefit from the economies of scale.
17771606
Phoenix Cloud : Consolidating Heterogeneous Workloads of Large Organizations on Cloud Computing Platforms
The present invention relates to a process to aminate electrophilic aromatic compounds by vicarious nucleophilic substitution of hydrogen using quaternary hydrazinium salts. The use of trialkylhydrazinium halide, e.g., trimethylhydrazinium iodide, as well as hydroxylamine, alkoxylamines, and 4-amino-1,2,4-triazole to produce aminated aromatic structures, such as 1,3-diamino-2,4,6-trinitrobenzene (DATB), 1,3,5-triamino-2,4,6-trinitrobenzene (TATB) and 3,5-diamino-2,4,6-trinitrotoluene (DATNT), is described. DATB and TATB are useful insensitive high explosives. TATB is also used for the preparation of benzenehexamine, a starting material for the synthesis of novel materials (optical imaging devices, liquid crystals, ferromagnetic compounds).
14259461
Grid Unit: A Self-Managing Building Block for Grid System
Grid system software is inherently complex, hard to build and maintain. In this paper, we propose a self-managing building block: grid unit, which facilitates constructing grid system with higher availability and lower management overhead. We present an agent organization as autonomic management framework, and propose a self-recovering protocol to eliminate most of tough jobs from system administrator's routines. The system has been deployed on Dawning 4000A since 2004, the biggest node for China grid system. We have done extensive experiments to evaluate grid unit, and the collected log data shows the availability of a grid parallel process management service, built on the basis of grid unit, reaches 99.997%.
12523556
Design Patterns of Scalable Cluster System Software
The design pattern of cluster system software has an important influence on scalability of massive cluster system. The paper presents design patterns of scalable cluster system software, including scalable software topologies and optimized communication modes. These design patterns have been widely applied in Dawning series of supercomputers and some results of performance evaluation show their good scalability
2643198
Easy and reliable cluster management: the self-management experience of Fire Phoenix
High-Performance clusters are rapidly becoming an important computing platform for both scientific and business applications. To fulfil the new demands and challenges, cluster system software is inevitably complex. Even for experienced administrators, the management of a cluster system is an exhausting job. This paper introduces Fire Phoenix, a scalable and self-managing cluster system software that supports both scientific and commercial applications. With the self-configuring and self-healing features, much of the machine configuration and error recovery can be done automatically. Our design has been proven effective in the operations of the Dawning 4000A supercomputer, which is the biggest cluster system in China
14387828
Escape analysis for synchronization removal
In this paper we introduce our escape analysis framework for Java, which is a kind of flow-insensitive, inter-procedural, and context-sensitive data flow analysis. And we present an efficient static intra-procedural algorithm for inferring the set of types that can occur at runtime for each object. With intra-procedural type information, virtual method resolution, callee-stub inline, exception analysis, and thread allocation site analysis are implemented. Virtual method resolution and callee-stub inline effectively reduce the call graph and SCC (strongly connected components). In exception analysis, we present a more precise analysis algorithm, especially in the inter-procedural exception in SCC.Our escape analysis can be applied to the whole Java program and Java libraries to identify unnecessary synchronization in Java and remove them. We have developed an implementation on Intel's Open Runtime Platform. For our benchmarks, 7.3% to 99% (with an average of 54%) of synchronization operations are eliminated.
45075264
Multi-path GEM for Routing in Wireless Sensor Networks
Wireless sensor networks are expected to be used in many different applications such as disaster relief and environmental control. Efficient routing protocols need to be thoroughly studied before wireless sensor networks are widely deployed. GEM is an ingenious routing algorithm that is based on the idea of graph embedding. Using a well designed virtual coordinate system, GEM provides a remarkably simple route selection mechanism. However, GEM does not survive edge failures well. In this paper, we propose R-GEM and S-GEM that use the idea of GEM and improve its reliability performance significantly. Both of them outperform GEM in all of the experimental scenarios. Specifically, in the case that 2% of all edges in the network fail to transfer packets, when only disjoint pairs are taken into consideration, GEM leads to a path error rate of 10% while R-GEM and S-GEM only result in a path error rate of 2%.
29695672
Managing and Mining Multimedia Data, Animations and Annotations
Several advances have been made on managing multimedia data stores. We now have products for multimedia data management. This article provides an overview of managing multimedia databases and describes techniques for managing multimedia animations and annotations as well as mining multimedia data. 
 
 
Keywords: 
 
data mining; 
mulitimedia databases; 
animations; 
images; 
multimedia database; 
management system
16447326
An Approximate Method for Performance Evaluation of Asynchronous Pipeline Rings
Performance evaluation of asynchronous circuits is one of the most difficult parts in asynchronous circuit research. This Paper presents an approximate method by queuing network modeling for performance evaluation of asynchronous pipeline rings. The asynchronous pipeline rings are modeled by closed queuing networks with transfer blocking. An efficient approximation method is used to analyze the performance metrics, such as response time and throughput. These performance metrics can be used to derive the cycle time and latency of the asynchronous pipeline rings. Compared with theoretic results, the algorithm presented in this paper is efficient for performance evaluation of asynchronous pipeline rings.
5315254
Efficient and Secure Authentication Protocols for Mobile VoIP Communications
Mobile Voice over IP (Mobile VoIP) allows mobile users to continuously talk with each others while roaming across different networks. In such wireless application, it is vulnerable to information security. In this paper, we present two efficient and secure authentication protocols for mobile VoIP services. In our approaches, we first develop a secure authentication protocol for mobile IP registration procedure. And then, based on this authenticated process, we extend the similar concept to a SIP-based VoIP service, and thus propose the second simple and secure communication protocol. For verifying our contributions, we demonstrate our proposed protocols secure and efficient: (1) by conducting security analysis on the aspects of data integrity, confidentiality, and several common network attacks, such as replay, man-in-the-middle; and (2) by conducting simulations and showing comparison results with other existing protocols, in terms of the communication and computation overheads imposed on the mobile node. All results point out that our protocols are superior to others.