Browsing Theses and Dissertations by Subject "Linear time invariant systems"

Now showing items 1-2 of 2

Task allocation in parallel and distributed computer system

Mina, Jean G. (Notre Dame University-Louaize, 1998-07)

The allocation problem is known to be NP-Hard in the most general case where both the number of modules and the number of processors is arbitrary, and it is also Np-Complete in some of the restricted cases. Also, the general scheduling problem, where no restrictions are imposed on the interconnection structure between modules, on the modules processing time and on the number of parallel processors, is NP-Hard in the strong sense. Even under some restrictions, the scheduling problem is NP-Hard. In some other restricted cases, it is known to be NP-Complete. In this thesis, we first review fifty ...
A test-bed for linear time, constant space differencing algorithms

Mouawad, Pauline (Notre Dame University-Louaize, 2004)

This thesis is motivated by the latest work related to differential compression algorithms as it appears in the work of Ajtai, et al. - 2002. In particular, we pay special attention to delta encoding algorithms that achieve got compression in linear time and constant space. This is important because previous work in this area uses either quadratic time and constant space or linear time and linear space, which is unacceptable for large inputs. In delta encoding, the algorithm reads two different copies of the same file as input, termed the reference copy and the version copy. The output of the ...

Now showing items 1-2 of 2

Search DSpace