Efficient Expressions For Completely And Partly Unsuccessful Batched Search Of Tree-Structured Files

In this correspondence, closed-form, nonrecurrent expressions for the cost of completely and partly unsuccessful batched searching are developed for complete j-ary tree files. These expressions are applied to both the replacement and nonreplacement models of the search queries. The expressions provide more efficient formulas than previously reported for calculating the cost of batched searching. The expressions can also be used to estimate the number of block accesses for hierarchical file structures. © 1990 IEE

Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-structured Files

In this correspondence, closed-form, nonrecurrent expressions for the cost of completely and partly unsuccessful batched searching are developed for complete j-ary tree files. These expressions are applied to both the replacement and nonreplacement models of the search queries. The expressions provide more efficient formulas than previously reported for calculating the cost of batched searching. The expressions can also be used to estimate the number of block accesses for hierarchial file structures

Scalable Applications on Heterogeneous System Architectures: A Systematic Performance Analysis Framework

The efficient parallel execution of scientific applications is a key challenge in high-performance computing (HPC). With growing parallelism and heterogeneity of compute resources as well as increasingly complex software, performance analysis has become an indispensable tool in the development and optimization of parallel programs. This thesis presents a framework for systematic performance analysis of scalable, heterogeneous applications. Based on event traces, it automatically detects the critical path and inefficiencies that result in waiting or idle time, e.g. due to load imbalances between parallel execution streams. As a prerequisite for the analysis of heterogeneous programs, this thesis specifies inefficiency patterns for computation offloading. Furthermore, an essential contribution was made to the development of tool interfaces for OpenACC and OpenMP, which enable a portable data acquisition and a subsequent analysis for programs with offload directives. At present, these interfaces are already part of the latest OpenACC and OpenMP API specification. The aforementioned work, existing preliminary work, and established analysis methods are combined into a generic analysis process, which can be applied across programming models. Based on the detection of wait or idle states, which can propagate over several levels of parallelism, the analysis identifies wasted computing resources and their root cause as well as the critical-path share for each program region. Thus, it determines the influence of program regions on the load balancing between execution streams and the program runtime. The analysis results include a summary of the detected inefficiency patterns and a program trace, enhanced with information about wait states, their cause, and the critical path. In addition, a ranking, based on the amount of waiting time a program region caused on the critical path, highlights program regions that are relevant for program optimization. The scalability of the proposed performance analysis and its implementation is demonstrated using High-Performance Linpack (HPL), while the analysis results are validated with synthetic programs. A scientific application that uses MPI, OpenMP, and CUDA simultaneously is investigated in order to show the applicability of the analysis

Towards a taxonomy of reusable CRM requirements for the Not for Profit sector

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Traditional (or commercial) CRM is a well-defined domain but there is currently no generally accepted definition of what constitutes CRM in the not for profit (NfP) sector. Not for profit organisations are organisations which exist for a social purpose, are independent of the State, and which re-invest all of their financial surpluses in the services they offer or in the organisation itself. This research aims to answer the question “What exactly is CRM as applied to the NfP sector, what are its boundaries and what functions should an NfP CRM information system perform?” Grounded Theory Method (GTM) within a Design Science framework was used to collect, analyse, categorise, generalise and structure data from a number of NfP organisations and NfP information systems suppliers. An NfP CRM model was constructed from this data in the form of three multi-level taxonomies. The main taxonomy relates to generic and reusable information system requirements both functional and non-functional. Within this taxonomy the high-level categorisations of commercial CRM, namely “Marketing, “Sales” and “Service”, are greatly extended to reflect the special needs of the NfP sector and in particular a much broader definition of “customer”. The two minor taxonomies relate to issues of CRM strategy and CRM systems architecture which need to be considered alongside the system requirements. In addition to and resulting from the taxonomies, an over-arching definition of NfP CRM was developed. NfP organisations now have a framework that will enable them to know what to expect of CRM systems and from which they can select requirements to build their own specification of information system needs. Using the requirements taxonomy for this task will make the process of requirements analysis and specification easier, quicker, cheaper and more complete than using traditional methods. The framework will also allow NfP system suppliers to know what NfP organisations expect of their systems and will assist them with the specification of new system features. The minor taxonomies will provide NfP organisations with a series of strategic issues and systems architecture options that should be considered when implementing a CRM system. This research also demonstrates how GTM can be utilised: as the development phase of Design Research, as a general method of domain analysis, and as a tool to develop a taxonomy of reusable information system requirements

Towards a taxonomy of reusable CRM requirements for the Not for Profit sector

Traditional (or commercial) CRM is a well-defined domain but there is currently no generally accepted definition of what constitutes CRM in the not for profit (NfP) sector. Not for profit organisations are organisations which exist for a social purpose, are independent of the State, and which re-invest all of their financial surpluses in the services they offer or in the organisation itself. This research aims to answer the question "What exactly is CRM as applied to the NfP sector, what are its boundaries and what functions should an NfP CRM information system perform?" Grounded Theory Method (GTM) within a Design Science framework was used to collect, analyse, categorise, generalise and structure data from a number of NfP organisations and NfP information systems suppliers. An NfP CRM model was constructed from this data in the form of three multi-level taxonomies. The main taxonomy relates to generic and reusable information system requirements both functional and non-functional. Within this taxonomy the high-level categorisations of commercial CRM, namely "Marketing, "Sales" and "Service", are greatly extended to reflect the special needs of the NfP sector and in particular a much broader definition of "customer". The two minor taxonomies relate to issues of CRM strategy and CRM systems architecture which need to be considered alongside the system requirements. In addition to and resulting from the taxonomies, an over-arching definition of NfP CRM was developed. NfP organisations now have a framework that will enable them to know what to expect of CRM systems and from which they can select requirements to build their own specification of information system needs. Using the requirements taxonomy for this task will make the process of requirements analysis and specification easier, quicker, cheaper and more complete than using traditional methods. The framework will also allow NfP system suppliers to know what NfP organisations expect of their systems and will assist them with the specification of new system features. The minor taxonomies will provide NfP organisations with a series of strategic issues and systems architecture options that should be considered when implementing a CRM system. This research also demonstrates how GTM can be utilised: as the development phase of Design Research, as a general method of domain analysis, and as a tool to develop a taxonomy of reusable information system requirements.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of Sandqvist’s B-eS for intuitionistic propositional logic (IPL), for which we propose an alternative treatment of conjunction that takes the form of the generalized elimination rule for the connective. The resulting semantics is shown to be sound and complete. This motivates our main contribution, a B-eS for IMLL , in which the definitions of the logical constants all take the form of their elimination rule and for which soundness and completeness are established

Numerical aerodynamic simulation facility feasibility study

There were three major issues examined in the feasibility study. First, the ability of the proposed system architecture to support the anticipated workload was evaluated. Second, the throughput of the computational engine (the flow model processor) was studied using real application programs. Third, the availability reliability, and maintainability of the system were modeled. The evaluations were based on the baseline systems. The results show that the implementation of the Numerical Aerodynamic Simulation Facility, in the form considered, would indeed be a feasible project with an acceptable level of risk. The technology required (both hardware and software) either already exists or, in the case of a few parts, is expected to be announced this year. Facets of the work described include the hardware configuration, software, user language, and fault tolerance