By Topic

Computer Software and Applications Conference, 1991. COMPSAC '91., Proceedings of the Fifteenth Annual International

Date 11-13 Sept. 1991

Filter Results

Displaying Results 1 - 25 of 119
  • Proceedings of the Fifteenth Annual International Computer Software and Applications Conference (Cat. No.91CH3023-9)

    Publication Year: 1991
    Request permission for commercial reuse | PDF file iconPDF (603 KB)
    Freely Available from IEEE
  • Conditional transactions: a model of computation for active databases

    Publication Year: 1991, Page(s):36 - 41
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    A transaction model for active databases is introduced. Concurrent execution of rules needs to be carefully managed to ensure consistent semantics. It is shown that serializability is not always sufficient for correctness. A new criterion, conditional conflict serializability (CCS) is developed and shown to ensure the desired correctness. A graph-based scheduler for it is presented. Practical sche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending the E-R concepts to capture natural language semantics for database access

    Publication Year: 1991, Page(s):30 - 35
    Cited by:  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Entity-relationship (E-R) concepts are extended to capture natural language semantics and develop a logical form to represent natural language queries. The logical form can be efficiently transformed into relational algebra for query execution. The whole process provides a clear and natural framework for processing natural language queries to retrieve data from database systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiler techniques to extract parallelism within a nested loop

    Publication Year: 1991, Page(s):24 - 29
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    By analyzing the dependences between instances, the authors propose a new compiler technique called cycle breaking for parallelizing nested loops. For a single dependence cycle, it extracts more parallelism than two similar techniques. Several versions of cycle braking are presented to extract parallelism within a nested loop by linearizing its multidimensional iteration space. It is observed that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Skewed partition-theory and practice [parallel programming]

    Publication Year: 1991, Page(s):18 - 23
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    A study is made of strategies for partitioning nested loop programs on distributed-memory multicomputers. A technique called skewed partition is studied. For certain applications the skewed partition will reduce the amount of synchronization and provide a greater control over the granularity than the commonly used block partition method. To illustrate the idea, two examples, one of image distance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool for the static optimization of concurrent programs

    Publication Year: 1991, Page(s):10 - 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    A programming tool, called parallelizer, for the static optimization of concurrent programs is considered. The tool partitions the alternative command lists of a nondeterministic iterative command into distinct elements that are concurrently executed. To improve the program's performance, the tool determines a decomposition where the granularity of the resulting processes is close to optimal for t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A deadlock detection and resolution algorithm for sequential transaction processing with multiple lock modes

    Publication Year: 1991, Page(s):70 - 77
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    An algorithm for deadlock detection and resolution in sequential transaction processing is presented. Two-phase locking is assumed for ensuring serializability, the lock requests obey the granularity locking protocol, and each granule may be locked in one of the following lock modes: IS, IX, S, SIX and X. For each object, lock requests are honored according to a first-come-first-served basis excep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An experience of software reuse activities

    Publication Year: 1991, Page(s):8 - 9
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    An experimental software reuse project was performed over a period of four years. The target of reuse was program code modules stored in a common library. The author first outlines the project, presents and analyzes the results, and then discusses the managerial and technological issues of software reuse View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information caching in the execution of logic programs

    Publication Year: 1991, Page(s):288 - 293
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    A model is proposed that integrates information caching into inference procedure. In addition to success results, failure information is also cached in this model to facilitate back-tracking. A logic system based on this model was implemented. Results of running a set of representative logic programs on the system are reported View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software productivity and quality measurements

    Publication Year: 1991, Page(s):244 - 254
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    This paper covers the following topics: software productivity and quality measurements; an approach to data-gathering to raise software productivity and quality; software quality measurement-Project Muse results; MIS software development (customer satisfaction through quality improvement); and an approach to software quality and productivity measurements for AT&T operations systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal data migration policies in distributed databases

    Publication Year: 1991, Page(s):645 - 650
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    A description is given of how to determine the optimal migration policy for data items in a distributed database. A migration policy determines whether remote execution or migration is used when a remote request on a data item is initiated. A migration policy is modeled using a discrete Markov chain. The states in the Markov chain encode the history of previous requests and determine the probabili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient techniques for deadlock resolution in distributed systems

    Publication Year: 1991, Page(s):64 - 69
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    Resolving a deadlock in a computer system involves choosing processes to terminate or roll back so that the deadlock is eliminated. It is widely known that the problem of finding the minimum number of processes to abort is NP-complete. Two polynomial-time heuristics to resolve deadlocks, the edge cycle method and a method based on enumerating the cycles in the wait-for-graph, are discussed. Simula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of reliable broadcast protocol for selectively partially ordering PDUs

    Publication Year: 1991, Page(s):673 - 679
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    A discussion is presented of the design of the SPO (service for selectively partially ordering PDUs) protocol which provides reliable selective broadcast services. In the SPO service, each PDU (protocol data unit) is not destined to all the entities, but only to the destinations. The SPO protocol guarantees the partial ordering of received PDUs which are destined to the entity on the MC service. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software reuse trends in the United States

    Publication Year: 1991, Page(s):6 - 7
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    A discussion is presented of three definite trends in the practice of software reuse in the United States: (1) a trend in the software industry to institutionalize the practice of reuse, (2) a trend towards integrating reuse in the software development process, and (3) a trend to standardize methods for domain analysis. It is shown that if these trends continue and succeed in their goals, then the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault analysis based on fault reporting in JSP software development

    Publication Year: 1991, Page(s):591 - 596
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    A fault analysis procedure is proposed for software development using JSP (Jackson structured programming). In the procedure, it is assumed that developers submit a fault report, which includes information (such as fault type, cause of fault and product) on actual fault correction activities. The procedure can identify the step in the JSP process at which fault might be introduced. Fault data are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling recursive Prolog programs with list structure into procedural languages

    Publication Year: 1991, Page(s):281 - 287
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    An algorithm is presented for transforming a mutual recursive program in Prolog, which contains the list data structure as a term of the predicate, into an iterative program using a while loop in a procedural language like PASCAL. The purpose of this study is a part of the long-range project to use general logic programming as a software specification tool. The PASCAL program generated by the algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A formal approach to the semantic specification of data flow diagrams

    Publication Year: 1991, Page(s):237 - 242
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    Dataflow diagrams (DFDs) are modeled as networks of concurrent processes. With the use of the temporal logic language XYZ/E, the formal basis of the semantic specification of DFD can be ensured, and the system properties such as safety and liveness can be easily characterized. A verification methodology is proposed which is based on the formal semantics of DFD. The implementation of the tools whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compound document processing system

    Publication Year: 1991, Page(s):640 - 644
    Cited by:  Papers (1)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    The compound document processing system (CDPS) is a multimedia information system that provides integrated facilities for storage and retrieval of text, pictures and document images. It is based on the probabilistic retrieval model which involves ranking the retrieved records in descending order of their similarity to the user's query. Facilities provided by the system include extracting informati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tasking deadlock detector for Ada programs

    Publication Year: 1991, Page(s):56 - 63
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    A tasking deadlock detector for Ada programs is presented. The software tool works by monitoring the tasking behavior of a target program and operating a task-wait-for graph for the program. It can detect all types of tasking deadlocks in a class of Ada programs. The authors describe the principle of detecting tasking deadlocks dynamically, present their implementation of the tool, and give a real... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant parallel matrix multiplication with one iteration fault detection latency

    Publication Year: 1991, Page(s):665 - 672
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    A new algorithm, the ID algorithm, is presented which minimizes the fault-detection latency. In the ID algorithm, a fault is detected as soon as the fault occurs instead of at problem termination. For n 2 processors, the fault-latency time of the ID algorithm is 1/n of that of the checksum algorithm with a run-time penalty of O(n log2 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semiparallel execution of compiled Lisp programs

    Publication Year: 1991, Page(s):719 - 724
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    This paper deals with Lips programs whose forms are more general than previous programs. Extended parallel pipeline execution is explained for the whole of a compiled Lisp program. The extended parallel pipeline execution includes fully parallel/semiparallel execution by using one-dimensional processor arrays (ODPAs). The tradeoff between the scale of the ODPA and the execution time of the compile... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SUIT: software user interface design tool

    Publication Year: 1991, Page(s):196 - 203
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    SUIT, a software user interface design tool, is a visualization and prototyping tool that facilitates collaboration between programmers and usability personnel by offering multiple views of a user interface design. The authors describe the roles of different views on prototypes in user interface design and then explain how SUIT generates multiple views with a node-flow model of object-based and ev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to reusable software through prototyping and set-oriented languages

    Publication Year: 1991, Page(s):4 - 5
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    A brief discussion is presented of software prototyping. The author argues that prototypes may serve as reusable components due to the high-level nature of a prototype which eases the understanding and retrieving of programs. This general approach is illustrated by a discussion addressing the set-oriented languages SETL and TangramL View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nested report generation for object-oriented databases

    Publication Year: 1991, Page(s):319 - 326
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    A presentation format generation strategy for composite reports is proposed for object-oriented databases. The reports can have nested formats (in extended non-first-normal-form). The problem of presentation view generation over object-oriented conceptual/external view is discussed. The presentation format should vary at run time, depending on repeating groups and data arrangement. A new format co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A software reliability growth model for test-effort management

    Publication Year: 1991, Page(s):585 - 590
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    A software reliability growth model incorporating the amount of test effort expenditures during the software testing phase is described. The time-dependent behavior of test-effort expenditures is described by a Weibull curve due to the flexibility. Assuming that the error detection rate to the amount of test-effort spent during the testing phase is proportional to the current error content, the mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.