The design of COMPASS: an execution driven simulator for commercial applications running on shared memory multiprocessors

Web service composition is used as subprocess in the workflow system. If the workflow can provide high reliability and constituency through transaction process technology, the composition of Web service and workflow will be the main solution to solve problem of e-business. Traditional transaction model lacks support for long-running transaction in application of Web service. From the angel of the tier relation between Web service composition and separated Web service that is part of Web service composition, a transaction model based on precontract and semantics encapsulation is presented to improve the efficiency of Web service-based transaction process.

A transaction processing (TP) application is a program that performs an administrative function by accessing a shared database on behalf of an on-line user. A TP system is an integrated set of products that supports TP applications. These products include both hardware, such as processors, memories, disks and communications controllers, and software such as operating systems (Oss), database management systems (DBMSs), computer networks and TP monitors. Much of the integration of these products is provided by TP monitors which coordinate the flow of transaction request between terminals that issue requests and TP applications that can process them. Today, TP represents over 25 percent of the computer systems market and is one of the growing segments of the computer business. TP applications appear in most sectors of large-scale enterprises such as airline reservation, electronic banking, securities trading, inventory and production control, communications switching, videotex, sales management, military command and control and government services.

Every business or government agency needs to track information regarding their finances, their employees, and the items or assets they own and manage. Software applications that track this type of information are called enterprise resource planning (ERP) systems. Managing these assets in an integrated application allows an organization to have a consistent view across the entire enterprise. This enterprise-wide view allows ERP systems to go beyond the traditional transaction-based accounting systems maintained at the organization level and deliver fully integrated financial and human capital management based on industry-derived best practices across organizations. In response to the pressures of global competition, enterprises today are forging ahead with the mission of integrating information systems across corporate boundaries to unite customers, suppliers and any other business partners with which they interact. And in the mean time, with the development of the society, more and more people have to go many places because the job makes them and working at home also becomes more and more popular. Those people who are not at the place of their company also want to continue their work in other places even at home. The old style ERP system is in C/S model and cannot satisfy with the needs. So it is very necessary to upgrade the ERP system. This paper will go to figure out the application of the Web service in the upgrading of ERP system. In this paper, we focus on that how to upgrade or renew a C/S ERP system to an ERP system with B/S model and the application of Web service. We use the J2EE architecture and XML technology to provide Web service and upgrade/renew the former ERP system. UML tools play a very important role in the upgrading procedure. We use UML to analysis and design the B/S ERP system, which based on the C/S version. We use JSP to act as the view of the system because of its flexibility. In the Web service, the XML is necessary. So the XML technology is also used. In the end of the paper, we will figure out how these technologies to be used through a concrete example.

Ever-increasing memory footprint of applications and increasing mainstream popularity of shared memory parallel computing motivate us to explore memory compression potential in distributed shared memory (DSM) multiprocessors. This paper for the first time integrates on-the-fly cache block compression/decompression algorithms in the cache coherence protocols by leveraging the directory structure already present in these scalable machines. Our proposal is unique in the sense that instead of employing custom compression/decompression hardware, we use a simple on-die protocol processing core in dual-core nodes for running our directory-based coherence protocol suitably extended with compression/decompression algorithms. We design a low-overhead compression scheme based on frequent patterns and zero runs present in the evicted dirty L2 cache blocks. Our compression algorithm examines the first eight bytes of an evicted dirty L2 block arriving at the home memory controller and speculates which compression scheme to invoke for the rest of the block. Our customized algorithm for handling completely zero cache blocks helps hide a significant amount of memory access latency. Our simulation-based experiments on a 16-node DSM multiprocessor with seven scientific computing applications show that our best design achieves, on average, 16% to 73% storage saving per evicted dirty L2 cache block for four out of the seven applications at the expense of at most 15% increased parallel execution time.

OpenMP vs. MPI on a shared memory multiprocessor

Summary form only given. We describe the design and analysis of a scalable architecture suitable for large-scale DSMs (distributed shared memory) systems. The approach is based on an interconnect technology which combines optical components and a novel architecture design. In DSM systems, as the network size increases, network contention results in increasing the critical remote memory access latency, which significantly penalizes the performance of DSM systems. In our proposed architecture called RAPID (reconfigurable and scalable all-photonic interconnect for distributed-shared memory), we provide high connectivity by maximizing the channel availability for remote communication to reduce the remote memory access latency. RAPID also provides fast and efficient unicast, multicast and broadcast capabilities using a combination of aggressively designed wavelength, time and space-division multiplexing techniques. We evaluated RAPID based on network characteristics, power budget criteria and simulation using synthetic traffic workloads and compared it against other scalable electrical networks. We found that RAPID, not only outperforms other networks, but also, satisfies most of the requirements of shared memory multiprocessor design such as low latency, high bandwidth, high connectivity, and easy scalability.

I: General Issues.- Modeling Knowledge: Model-based Decision Support and Soft Computations.- Benefits of Decision Support Using Soft Computing.- Evolving Connectionist-based Decision Support Systems.- An Agent-based Soft Computing Society with Application Applications in Financial Investment Planning.- A Rough Sets/Neoral Networks Approach to Knowledge Discovery for the Development of Decision Support Systems.- II: Applications and Implementations.- Decision Support Systems in Healthcare: Emerging Trends and Success Factors.- A View of Public and Private Sectors for Taiwan's BOT Project Financing Using Fuzzy Multi-Criteria Methods.- Relational Structures for the Analysis of Decision Information in an Electronic Market.- A Fuzzy Evaluation Model: A Case for Intermodal Terminals in Europe.- Application of Kemeny's Median for Group Decision Support.- An Internet-based Group Decision and Consensus Reaching Support System.- Limpio: A DSS for the Urban Waste Collection Problem.- A Decision Support System for Air Quality Control Based on Soft Computing Methods.- Multicriteria Genetic Tuning for the Optimization and Control of HVAC Systems.- Intelligent Information Systems for Crime Analysis.- Application of Fuzzy Decision Trees to Reservoir Recognition.- Introducing SACRA: A Decision Support System for the Construction of Cattle Diets.- Prediction of Parthenium Weed Dispersal Using Fuzzy Logic on GIS Spatial Image.

Negative acknowledgments (NACKs) and subsequent retries, used to resolve races and to enforce a total order among shared memory accesses in distributed shared memory (DSM) multiprocessors, not only introduce extra network traffic and contention, but also increase node controller occupancy, especially at the home. We present possible protocol optimizations to minimize these retries and offer a thorough study of the performance effects of these messages on six scalable scientific applications running on 64-node systems and larger. To eliminate NACKs, we present a mechanism to queue pending requests at the main memory of the home node and augment it with a novel technique of combining pending read requests, thereby accelerating the parallel execution for 64 nodes by as much as 41 percent (a speedup of 1.41) compared to a modified version of the SGI Origin 2000 protocol. We further design and evaluate a protocol by combining this mechanism with a technique that we call write string forwarding, used in the AlphaServer GS320 and Piranha systems. We find that without careful design considerations, especially regarding atomic read-modify-write operations, this aggressive write forwarding can hurt performance. We identify and evaluate the necessary micro-architectural support to solve this problem. We compare the performance of these novel NACK-free protocols with a base bitvector protocol, a modified version of the SGI Origin 2000 protocol, and a NACK-free protocol that uses dirty sharing and write string forwarding as in the Piranha system. To understand the effects of network speed and topology the evaluation is carried out on three network configurations.

Shared-memory provides a uniform and attractive mechanism for communication. For efficiency, it is often implemented with a layer of interpretive hardware on top of a message-passing communications network. This interpretive layer is responsible for data location, data movement, and cache coherence. It uses patterns of communication that benefit common programming styles, but which are only heuristics. This suggests that certain styles of communication may benefit from direct access to the underlying communications substrate. The Alewife machine, a shared-memory multiprocessor being built at MIT, provides such an interface. The interface is an integral part of the shared memory implementation and affords direct, user-level access to the network queues, supports an efficient DMA mechanism, and includes fast trap handling for message reception. This paper discusses the design and implementation of the Alewife message-passing interface and addresses the issues and advantages of using such an interface to complement hardware-synthesized shared memory.

Electronic Commerce (EC) signifies a fundamental shift in how organizations operate, interact, and compete. Decision making is a common thread underlying all EC transactions, shaping all activities in a value chain/supply chain, and feeding off of EC information exchanges. Supporting this decision-making is an important aspect of EC. The overwhelming success of the Internet has opened uncharted opportunities for all organizations to use this technology as a basis for Web-oriented decision support systems(WODSSs). Here, we explore decision support applications that are emerging all along the EC frontier, focusing on those that are delivered across the WWW. This includes the positioning of decision support within the EC realm, a survey of decision support initiatives on the WWW, and the introduction of three taxonomies for guiding study and research: a Subject-Oriented Taxonomy for studying WODSSs used in EC in terms of the subjects about which they can provide knowledge; a Technique-Oriented Taxonomy by which a WODSS is viewed in terms of the knowledge-management technique employed to implement it; and a Coordination-Oriented Taxonomy which deals with the coordination of distributed components of a WODSS. In conclusion, we present some observations about avenues for future research and development of decision support applications in EC.

Although information and Internet technology developed rapidly, how to realize flexible integration of enterprise application, and how to realize coordination of the heterogeneous information system and automation of the business process, have been core issues that need to be further researched. Application of Web Services and WS-BPEL can solve this problem. By using Web Services, which is platform-independent and loosely coupled, business process can be adapted to rapidly changing environment. On the other hand, BPM combination of services for process planning and management can further improve business efficiency and lower development cost. In this paper, based on the web services and WS-BPEL, utilizing a typical commercial model, the web services of business process are developed, and the method of using WS-BPEL for process planning is explored. At the same time, web services orchestration is fulfilled through the WS-BPEL, commercial model of process automation instance is established. In the end, business process automation is implemented and tested accordingly.

Boolean Web-service automata (BWA) for distributed Web services are introduced as a parallel model for interaction and interoperability between applications. Boolean automata are a generalization of nondeterministic automata. The generality of BWA leads to high degree of parallelism and efficient composition among Web service applications. We also consider two formalisms - (1) deterministic Web-service automata (DWA), a model supporting Web service composition, (2) conversation Web-service automata (CWA), a conversation model supporting Web service interaction. DWA and CWA complement BWA in conjunction with the composition and conversation operations.

Mobile technology applications have proven more interesting and more capable with each passing year, and continue to be a technology with new surprises. In this paper, we present a software development for weather report which is motivated as a cell phone programme application for web service. Users can get the latest weather information without accessing to the specific weather website. In addition, weather information can be deployed on any cell phone with internet explorer. Web Services, MIDlet programming is the technology applied in this paper. Weather report is designed as a two-tier structure, web application server and client. Web services are generated and published on the web. On client side, user, on the MIDP platform, can interact with web services with the agreement on SOAP protocol. In this paper, how to deploy web services, and the differences and constraints of MIDlet programming are presented.

THE Internet, along with its related technologies, has created an interconnected world in which information flows easily and tasks are processed collaboratively. To make service-oriented applications more robust, Web services must be examined from a transactional perspective. By transactional, we mean first defining the actions that guide the execution of Web services when failures arise and then the states that permit claiming the success of this execution following the handling of these failures. A variety of transactional models are reported in the database community. Some of these models can be leveraged and enhanced in response to Web services characteristics while others are not suitable for Web services due to the dynamic nature of Web services, the long-running execution scenarios that Web services take part in, and the successful execution of Web services despite other peers’ failure. Today’s service-oriented applications require advanced transactional models that guarantee integrity and continuity of business processes despite the dynamic nature of the features of the environments hosting the execution of these applications. This special section sheds light on the latest advances in the fields of Web services and transactional models in order to better address advanced research on and experience with transactional Web services. Four papers out of 19 submissions were selected for inclusion in this special section. Each submission was subject to a double-review process by at least three peer reviewers. In the first paper, entitled “Event-Based Design and Runtime Verification of Composite Service Transactional Behavior,” Gaaloul et al. propose an event-driven approach to validate the transactional behavior of Web services taking part in compositions. A composition life cycle consists of four phases, namely, design, execution, monitoring, and reengineering. The verification of this behavior throughout this life cycle is done either at design time to validate recovery mechanisms’ consistency or after runtime to detect execution deviations and repair design errors, and, therefore, formally ensure the execution reliability of Web services. In addition, this verification is based on the Event Calculus formalism, which offers a sound definition for this reliability. In the second paper, entitled “FACTS: A Framework for Fault-Tolerant Composition of Transactional Web Services,” Liu et al. note that delivering reliable compositions over unreliable Web services is challenging. To address this challenge, Liu et al. identify a set of high-level exception handling strategies and a new taxonomy of transactional Web services to devise a fault-tolerant mechanism that combines exception handling and transaction techniques. In addition, Liu et al. devise two modules, known as specification and verification, to assist service designers in constructing fault handling logic conveniently and correctly. This logic is automatically injected into WS-BPEL. In the third paper, entitled “Rule-Based Coordination of Distributed Web Service Transactions,” von Riegen et al. study the distributed transactional activity control problem in the context of service choreographies. In such a context, many participants are allowed to work together to achieve a global, common goal, and the initiator of a process is not always the one who is able to commit or cancel a transaction. Von Riegen et al. introduce a framework that allows autonomous coordination of dynamic processes. This framework extends WSBusinessActivity to strengthen the role of the coordinator. Predicate rules are developed to let participants cancel or complete a process and help the coordinators decide on the completion processes and the confirmation or cancellation of the participants’ works. In the fourth paper, entitled “TQoS: Transactional and QoS-Aware Selection Algorithm for Automatic Web Service Composition,” El Haddad et al. focus on the issues of selecting and composing Web services. A design-time selection algorithm is proposed in which transactional and QoS requirements are both integrated into the selection process. This algorithm is based on the notion of risk that indicates if execution outcomes can either be compensated for or not. Two risk levels of execution in a transactional system are considered: Risk 0, meaning that if the execution is successful, the obtained outcomes can be compensated for by the user, and Risk 1, meaning that the system does not guarantee successful execution, but if it achieves it, the outcomes cannot be compensated for by the user. We hope this special section inspires researchers to develop new transactional models that would guarantee service-oriented applications integrity and continuity. 30 IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 3, NO. 1, JANUARY-MARCH 2010

No abstract available.