1231388
Evolutionary performance-oriented development of parallel programs by composition of components
This paper describes a method for evolutionary component-based development of families of parallel programs to attain performance goals on multiple execution environments for multiple family instances and an implementation of the method. It is based upon combining component-oriented development with integration of parallel/distributed execution and parallel/distributed simulation. Each component may have multiple representations at multiple levels of realization from analytical timing models to production code. Each component is encapsulated with an associative interface specifying its properties and behaviors which enables distinguishing among different implementations (or abstractions) of the same functional behavior which may have different performance behavior. Evolutionary development evolves a program from an abstract performance model to a complete program and may continue evolution during runtime. Performance can be estimated at any stage of realization. The implementation is a compiler which composes parallel/distributed programs from components encapsulated with associative interfaces and a runtime system which supports integrated execution/simulation of parallel programs composed from components at different levels of abstraction and program evolution at runtime by component replacement. Case studies in the application of the evolutionary development method including performance results are given.
14199306
A Case Study in Application Family Development by Automated Component Composition: h-p Adaptive Finite Element Codes
This paper reports a case study in automated composition of application families from components. The case study composes multiple instances of an h-p adaptive finite element code. An application family is represented as a structure of components. Each component is encapsulated with an interface giving a semantic specification of the properties and behavior of the component. Instances of the application family can be automatically assembled from a library of components by a compiler and the application instance can be optimized by component replacement during runtime through runtime component selection and binding. The case study demonstrates the benefits of the component composition approach to application family development and shows that execution efficiency is maintained or improved by the componentized development process.
1503799
Deza digraphs
We consider a directed version of Deza graphs. A digraph is said to be a Deza digraph if it is regular and the number of common out-neighbors of any two distinct vertices takes on at most two values. We introduce some constructions and develop some basic theory. In particular, constructions from Cayley digraphs, graph lexicograph products and graph directed products are described. Moreover, we characterize a family of normal Deza digraphs, and list all cyclic strictly Deza digraphs with at most six vertices. Finally, connections to weakly distance-regular digraphs are discussed, and all strictly Deza digraphs which are also weakly distance-regular digraphs with at most ten vertices are listed.
27133006
Binary partition based algorithms for mining association rules
Mining association rules is an important data mining problem. A fast binary partition-based algorithm (BPA) for mining association rules in large databases is presented in this paper. Basically, the framework of BPA is similar to that of the algorithm Apriori. In the first pass, all the frequent 1-item sets are divided into two disjoint parts. Accordingly, in each subsequent pass k, we partition the set of all the frequent k-item sets into three subsets. Any two different partitions are disjoint. If necessary, this partitioning procedure can be a recursive one. Therefore, we get a binary partition tree in the first pass and a corresponding ternary partition tree in each subsequent pass k. Due to such a partition, BPA can be very easily parallelized, assuming a shared-memory architecture.
30099215
Indexing and incremental updating condensed data cube
OLAP (online analytical processing) servers usually pre-compute data cubes to improve the response time of possible aggregate queries over cuboids with different grouping attributes. To reduce the huge size of a sparse data cube, the base single tuples (BSTs) are explored to condense cube tuples aggregated from the same set of source tuples into one tuple, whenever such condensing will not require further aggregate when the cube is used to answer queries. We propose the CuboidTree to index the BST condensed cube. Using both synthetic and real world data, we conducted experiments to demonstrate query processing and bulk incremental updating performance of the indexing scheme.
2486014
On vertex-transitive graphs of odd prime-power order
Marusic (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of order pk are Cayley graphs for each prime p and k = 1,2, or 3, and constructed a non-Cayley vertex-transitive graph of order pk and valency 2p + 2 for each prime p ≥ 5 and k ≥ 4. McKay and Praeger (J. Austral. Math. Soc. (A) 56 (1994) 53) gave an alternative construction of a non-Cayley vertex-transitive graph of order pk for each prime p ≥ 3 and k ≥ 4. In this paper it is proved that, for each positive integer k and each prime p ≥ 3, a vertex-transitive graph of order pk with valency less than 2p + 2 is a Cayley graph.
26757666
An infinite family of cubic one-regular graphs with unsolvable automorphism groups
A graph is one-regular if its automorphism group acts freely and transitively on the set of its arcs. In this paper, an infinite family of cubic one-regular graphs with unsolvable automorphism groups is constructed.