DEPARTMENT INFORMATION


PROJECTS RESEARCH ACTIVITIES
    Parallel Processing. One of the most fundamental challenges computer science is facing with today is need for developing algorithms, programming tools, and applications to harness the vast computing power of parallel computers; moreover, a theoretical basis for this new technology has to be improved. Since it is expected that parallel computers will gain an ever increasing share of the market, these developments will have important commercial consequences. Our goals are to widen the knowledge of parallel computing area, particularly communications and mapping, and systems with faulty nodes. Besides, some important computationally intensive applications will be implemented in order to test our research results.
    Mapping and Communications in Parallel Systems: Assigning processes to processors, data distribution, and communication among the processors is fundamental for all applications running on parallel computers. Efficient execution of parallel programs on an existing parallel computer requires proper mapping of programs onto the underlying machine architecture which can either be general-purpose or special-purpose. A practical model of a parallel computer has at each of its nodes a fixed size buffer allowing only limited link contention during message routing. Broadcasting (one-to-all), multicasting (one-to-more) and gossiping (all-to-all) are communication problems arising in distributed memory multicomputers. The need for selective broadcasting arises in many important applications, yet there is still no appropriate mechanism for such broadcasting currently available in parallel computers. Study of fault tolerant communication algorithms is also a very important topic of parallel computing.
    Parallel Numerical and Non-numerical Applications: Parallel Numerical Linear Algebra is an important tool for solving computationally intensive problems arising in various scientific areas. Talking about the development of parallel algorithms, we have in mind the design of scaleable routines that can be included into existing libraries and run on various High Performance Computing platforms. Recently, parallel implementations have been directed by the development of scaleable and platform-independent libraries based on Basic Linear Algebra Subroutines (BLAS) and introduction of message-passing standard. This enables the design of parallel applications not only on supercomputers but also on clusters of workstations. Our main research interest is in the area of parallel algorithms for solving large sparse systems of linear equations with the emphasis on the system structure and use of updating techniques.

    Architectural Synthesis with Testability. There are still many unanswered questions related to high level architectural synthesis as specification, input/output, designer intervention, complex timing constraints, and the relation of synthesis to the overall design and fabrication process. More comparative work is needed to establish good quality-measures and good estimation algorithms for quality-measures that can quickly reduce the search through the design space. Since most algorithms make oversimplified assumptions regarding target architectures, more work is needed on algorithms for more realistic design models. There is a lack of standard component sets for high-level synthesis and algorithms for technology mapping between arbitrary component sets. Technology mapping should be extended to higher-level system components, which in turn will require proper formalization of component descriptions. The success of high-level synthesis depends on a good support framework, including databases, environments and graphical front-end, to sustain system design at higher levels. Initial results in high-level DFT that have been reported recently indicate that algorithms that focus on single design issues (i.e., bracking or reducing self-loops) are relatively simple. However, much more effort will be required for multi-criterion decision analysis of design controllability/observability and incorporating of self-testing structure. Our current research work deals with dynamic allocation and problem space partitioning.

    Automatic Test and Diagnosis. Our research on integrated system diagnosis deals with the design-for-testability and diagnosability at different system levels as well as at different phases of the file cycle of the designed product. Developed methodology for the model-based diagnosis with CLP(R) has been successfully applied in the case studies with multiple-hard, single-parametric fault situations in analog circuits. In collaboration with Laboratory TIMA, Grenoble, new approaches to system diagnosis based on fuzzy sets have been studied. FLAMES, a Fuzzy Logic ATMS and Model-based Expert System, developed by TIMA, has been used for diagnosing analog circiuts. A comparison study with the results obtained by SPICE and CLP(R) has been done.
    Some experimental case studies on the design-for-testability have been performed. As a part of prototype testing of VCTCXO units for Hipot Hybrid, a fast and non-destructive method for testing of crystal units within the whole specified temperature range has been developed. In the frame of the project "Design for testability of circuits produced in thick hybrid technology", oscillation-based test approach has been applied to active RC filters and specific test structures for some selected types of filter stages have been developed.
    In sequential system diagnosis, the traditional definition of the test sequencing problem has been generalized to cover symmetrical, asymmetrical and modular tests. The problem of obtaining the optimal test sequence for the generalized definition is a subject of current research. Data Models and Query Languages. In the field of databases we deal with the theoretical aspects of the database systems, and with the design and the implementation of the declarative languages for the manipulation of databases. Our theoretical studies include the design of the data model for the representation of data in the distributed database environment. The data model introduces the constructs for the definition of the database meta-level which can represent the information about the location, the capabilities and the of objects in a distributed database environment. The proposed database model is a part of the platform for the manipulation of distrubuted databases called DOK (abbr. Distributed Object Kernel). The prototype of DOK is currently under development at Royal Melbourne Institute of Technology, Australia. In the field of declarative languages for the manipulation of databases we continued our work on the algebra for objects QAL. In particular, we studied the operations provide the means to express queries which inquire about the meta level of the database and about the relationships between the meta-level and the data-level of a database. The classification of queries that manipulate database meta-level has been done. The initial work on the study of the expressive power of algebra QAL has been done by comparing the expressive power of QAL with the expressive power of declarative languages based on logic.

INTERNATIONAL COLLABORATION
    In the frame of COPERNICUS project entitled ``Rapid Prototyping of Object-Oriented Production Planning and Control Systems for Industrial SMEs'' we have started with the realization of the database environment for storing data in the small and medium industrial enterprises (SMEs).

    The project "Programming Environments, Algorithms, Applications, Compilers and Tools for Parallel Computation" is the result of the Central European Initiative. Our research within the project was focused on the compile-time mapping and run-time allocation of parallel programs.

    A bilateral project PROTEUS project "Test et diagnostic de systemes heterogenes" in collaboration with TIMA-INPG, Grenoble, France, deals with the application of fuzzy logic in testing and diagnosis of complex heterogeneous systems.


Page maintained by G.P..