222
REFERENCES
1.
Al-Mouhamed M.A. (1990), 'Lower bound on the number of processors
and time for scheduling precedence graphs with communication costs’,
IEHE Trans. Software Engineering, Vol. 16, pp. 1390-1401.
2.
Al-Mouhamed M.A. (1994), 'Performance Evaluation of scheduling
precedence - constrained computations on message-passing systems’, IEEE
Transactions on Parallel and Distributed Systems, Vol. 5, No. 12,
Dec. 1994, pp. 1317-1322.
3.
Anderson B.D.O. and Moore J.B. (1979), ‘Optimal filtering’, Prentice Hall,
Inc., Englewood Cliffs, New Jersey, USA.
4.
Andrews. A. (1981), ‘Parallel processing of the Kalman filter’ in Proc.
1981, Int. Conf.
on Parallel Processing, Columbus, Ohio, USA,
pp. 216-220.
5.
Atherton D.P., Gul E., Kountzeris. A. and Kharbouch. M.M. (1990),
‘Tracking multiple targets using parallel processing’ IEE Proceeding,
Vol. 137, Pt. D„ No. 4, July, pp. 225-234.
6.
Baheti R.S. (1986), ‘Efficient approximation of Kalman filter for target
tracking’, IEEE transactions on AES, Jan, Vol.22, No.l, pp.8-14.
7.
Baheti, R.S., O'Hallaron, D.R. and Itzkowitz H.R. (1990), ‘Mapping
extended Kalman filters onto linear arrays’, IEEE Transactions on
Automatic Control, Vol. 35, No. 12, Dec., pp. 1310-1319.
8.
Bar-Shalom. Y. and Birmiwal. K. (1982), ‘Variable dimension filter for
maneuvering target tracking’, IEEE Transactions on Aerospace Electronic
Systems-18, Sep, pp. 621-629.
9.
Bar-Shalom Y. and Fortmann T.E. (1988), ‘Tracking and data association’,
Academic press Inc., New York, USA.
10.
Bernstein. B, Rodeh. M, and Gertner .1, (1989), ‘On the complexity of
scheduling problem for parallel/pipelined machines’, IEEE Trans, on
Computers, Sep, Vol. 38, No. 9, pp. 1308-1313.
11.
Bierman, G„ (1977), ‘Factorization methods for discrete
estimation’, New York, Academic Press.
sequential
223
12.
Blackman, S.S. (1986), ‘Multiple Target
Applications’. Artech House Inc., Dedham, MA.
Tracking
with
Radar
13.
Blazewicz .J, Drabowski .M, and Weglerz .J, (1986), ‘Scheduling
multiprocessor tasks to minimize schedule length’, IEEE Trans, on
Computers, Vol.35, No.5, May, pp. 389-393.
14.
Blom H.A.P, and Bar-Shalom.Y, (1988), ‘The interacting multiple model
algorithm for systems with Markovian switching coefficient’, IEEE
Transactions on Automatic Control-33, pp. 780-783.
15.
Bogler P.L. (1987), ‘Tracking maneuvering targets using input estimation’,
IEEE Transactions on Aerospace Electronic System-23, May, No.3,
pp. 298-310.
16.
Bogler P.L. (1989), ‘Radar Principles with applications to tracking systems,
John Wiley & Sons, New York.
17.
Bokhari .S.H (1979), ‘Dual processor scheduling with dynamic reassignment’,
IEEE Trans, on Software Engg., July, Vol. 5, No. 4, pp. 326-334.
18.
Brown R.G. and Hwang P.Y.C., (1992), ‘Introduction to random signals and
applied Kalman filtering’, Second Edition, John Wiley & Sons Inc., USA.
19.
Bultan .T, and Aykanat .C, (1992), ‘A new mapping heuristic based on mean
field annealing’, J. Parallel and Distributed Computing, Vol. 16, pp. 292-305.
20.
Candy J.V., (1986), ‘Signal Processing- The Model Based Applications’,
McGraw Hill, New York, USA.
21.
Castella, F.R. and Dunnebacke, F.G. (1974), ‘Analytical Results for the
X-Y Kalman tracking filter’, IEEE Transactions on AES, Nov, pp. 891-895.
22.
Chaudhary, V. and J.K. Aggarwal (1993), ‘A generalized scheme for
mapping parallel algorithms’, IEEE Transactions on Parallel and Distributed
Systems, Vol. 4, No. 3, March, pp. 328-346.
23.
Chin L. (1994), 'Application of Neural Network in target tracking data fusion,
IEEE Transactions on Aerospace and Electronic Systems, Jan. Vol.30, No.l,
pp. 281-287.
24.
Chockalingam, T. and Arunkumar, S. (1992), ‘A randomized heuristics for the
mapping problem : The genetic approach’, Parallel Computing, No. 18,
pp. 1157-1165.
224
25.
Coffman .H.Ci, and Graham .R.L, (1972), ‘Optimal scheduling for two
processor systems’, Acta Informatica, VoL 1, pp. 200-213.
26.
Corradi, A., Leonard!, L. and Vigo. D. (1992), ‘Massively parallel
programming environments: How to map parallel objects on transputers’,
Transputers 92, M.Becker, et al„ Eds, IOS Press, pp. 125-141.
27.
Dasgupta. S, (1989), ‘Computer Architecture- A Modern Synthesis, Vol 2,
Advanced topics', John Wiley & Sons, New York, USA.
28.
Desai, U.B. and Das B. (1985), ‘Parallel Algorithm for Kalman Filtering’,
Proe. of the American Control Conference’, Boston, June 1985,
pp. 920-921.
29.
life .K, (1982), ‘Heuristic models of task assignment scheduling in distributed
systems', IEEE Computer magazine, June, pp. 50-56.
30.
EL-Mahy, M.K. and White B.A.,(1994), ‘An investigation into Kalman
filter target tracking algorithms and their real time parallel transputer
implementation’, Trans. Inst. Meas. Control (UK), Vol. 16, No.l, pp. 25-39.
31.
El-Rewini. H.E. and Lewis .T.G, (1990), ‘Scheduling parallel program tasks
onto arbitrary target machines’, J. Parallel and Distributed Computing, Vol. 9,
pp. 138-153.
32.
El-Rewini. H.E., Ali. H.H. and Lewis. T„ (1994), ‘Task Scheduling in
parallel and distributed systems, Prentice Hall, Inc., Englewood Cliffs, New
Jersey.
33.
El-Rewini. H.E., Ali. H.H. and Lewis. T„ (1995), ‘Task Scheduling in
multiprocessor systems’, IEEE Computer, Dec, pp. 27-37.
34.
Ercal .E, Ramanujam, J. and Sadayappan .P, (1990), ‘Task allocation onto a
hypercube by recursive mincut bipartitioning’, J. Parallel and Distributed
Ccomputing, Vol. 10, pp. 35-44.
35.
Garcia N. F., Thompson H.A., De Oliveira M.C.F., Jones C.M. and Fleming
P.J., (1990), ‘Implementation of a transputer-based flight controller’, IEE
Proceedings, May, Vol. 137, Pt.D, No. 3, pp. 130-136.
36.
Gaston, E.M.E. and Irwin, G.W., (1990), ‘Systolic Kalman filtering: an
overview’, IEE proceedings, July, Vol. 137, Pt.D, No. 4, pp. 235-244.
37.
Gen, M., and Cheng, R., (1997), ‘Genetic algorithms & Engineering
Design’, John Wiley & Sons, Inc., Newyork.
225
38.
Gcrasoulis. A., and Yang. T„ (1993), ‘On the granularity and clustering of
directed acyclic task graphs’, IEEE transactions on Parallel and Distributed
Systems, June, Vol. 4, No. 6, pp. 686-701.
39.
Goel, A., Pradeep Suryanarayanan and Rajaraman., V. (1996), ‘A new
heuristic for scheduling the tasks with communication delays on parallel
computers’, Computer Science and Informatics, Vol. 26, No. 3, Sept.,
pp. 20-28.
40.
Goldberg, D.E. (1989), ‘Genetic Algorithm in Search Optimization and
Machine Eearning', Addison-Wesley, Reading Mass.
41.
Gul. E. and Atherton, D.P. (1989), ‘A transputer implementation for
multiple target tracking’, Microprocessor and Microsystems, April,
pp. 188-194.
42.
Guu Jiin-An and Wei Che-Ho (1991), ‘Maneuvering target tracking using
IMM method at high measurement frequency’, IEEE Trans. AES, Vol.27,
No.3, May, pp. 514-519.
43.
Gylys .V.B, and J.A. Edwards .J.A, (1976), ‘Optimal partitioning of workload
for distributed system’, Proc. COMPCON-76, pp. 353-357.
44.
Ha Soonhai and Lee E.A. (1997), ‘Compile-time scheduling of dynamic
constructs in Dataflow program graphs’, IEEE Trans, on Computers,
Vol.46, No.7, July, pp. 768-778.
45.
Haykin. S,
New York.
46.
Hellstrom, B. and L. Kanal (1992), ‘Asymmetric mean-field neural
networks for multiprocessor scheduling’, Neural Networks, Vol. 5,
pp. 671-686.
47.
Hou, E.S.H., N.Ansari and H. Ren (1994), ‘A Genetic algorithm for
multiprocessor scheduling’, IEEE Transactions on Parallel and Distributed
Systems, Vol. 5, No. 2, Feb., pp. 113-120.
48.
Hu. T.C. (1961), ‘Parallel sequencing and assembly line problems’,
Operations Research, Nov/Dec, Vol. 9, No. 6, pp. 841-848.
49.
Hwang, Jin-Jang, Yuan-Chieh, Anger, F.D. and Chung-Yee Lee, (1989),
Scheduling Precedence graphs in systems with interprocessor
communication times’,
SIAM J. Computing, Vol. 18, No.2, April,
pp. 244-257.
(1985),
‘Modern Filters’, MacMillan Publishing Company,
226
50.
Hwang, K. and F.A. Briggs (1989), ‘Computer
Organisation’, McGraw Hill International Editions.
Architecture
and
51.
Hwang, Kai. (1993), ‘Advanced computer Architecture: Parallelism,
Scalability, Programmability’, McGraw-Hill, Inc., Newyork.
52.
Iiguni, Y., Sakai, H. and Tokumaru, H., (1990), ‘A parallel implementation
of tracking Kalman filter on a multiprocessor system’, Trans. Inst. Electron.
Inf. Commun. Eng., Japan, Jan, Vol. J73A, No. 1, pp. 1-6.
53.
INMOS (1989), ‘The transputer data book’, SGS-Thompson, Bristol, UK.
54.
Irwin. G.W. and Gaston, E.M.F., (1988), ‘Occam simulation of a systolic
architecture for parallel Kalman filtering’ in Fleming, P.J. (Ed.) ‘Parallel
Processing in Control’, Peter Peregrinus Ltd., pp. 214-232.
55.
Jover. J.M. and Kailath. T. (1986), ‘A parallel architecture for Kalman filter
measurement update and parameters estimation’, Automatica, 22(1),
pp. 43-57.
56.
Kadela, T.E. and Graham, J.H. (1985), ‘Parallel algorithm and architectures
for optimal state estimation’, IEEE Trans, on Computers, C-34 (11),
pp. 1061-1068.
57.
Kalman R.E. (1960), ‘A new approach to linear filtering and prediction
problems’, Trans. ASME, J. Basic Eng., Series 82D, March, pp. 35-45.
58.
Kasahara, H. and Narita, S., (1984), ‘Practical multiprocessor scheduling
algorithms for efficient parallel processing’, IEEE Transactions on
Computers, Vol. 33, No. 11, Nov., pp. 1023-1029.
59.
Kaufman .M.T, (1974), ‘An almost-optimal algorithm for the assembly line
scheduling problem’, IEEE Trans, on Computers, Nov, Vol. 23, No. 11,
pp. 1169-1174.
60.
Kee, R.J and Irwin, G.W., (1991), ‘Transputer implementation of tracking
Kalman filters’, International Conference on Control, Edinburgh, UK,
Vol.2. pp. 861-6.
61.
Kiaei, S. and Desai, U.B., (1986), ‘Independent data flow wavefront array
processors for recursive equations’, IEEE Press Book, VLSI Signal
Processing, pp. 152-164.
62.
Kleinrock .L. and Nilsson A. (1981), ‘On optimal scheduling algorithms for
time-shared systems’, J. ACM, July, Vol. 28, No. 3, pp. 477-486.
227
63.
Kohler W.H. (1975), 'A preliminary evaluation of the critical path method for
scheduling problem', IEEE Trans, on Computers, Dec, pp. 1235-1238.
64.
Konstantinides, K„ Kaneshiro, R.T. and Tani, J.R. (1990), Task allocation
and scheduling models for multiprocessor digital signal processing’, IEEE
Trans, on Acoustics Speech and Signal Processing, Dec, VoL 38, No. 12, pp.
2151-2161.
65.
Krishnan, C.N. (1993), ‘Computer Simulation studies of Track-While-Scan
Radars', Technical report, Part I, School of Instrumentation and Electronics,
M.I.T., Chennai - 44, India.
66.
Kruatrachue, B. and Lewis. T. (1988), ‘Grain size determination for parallel
processing, IEEE! software, Jan, Vol. 5, No. 10, pp. 23-31.
67.
Rung. S.Y. (1985),
pp. 4-22.
68.
Lee, E.K.B. and Haykin, S. (1993), ‘Parallel implementation of the
extended square-root covariance filter for tracking applications’, IEEE
Transactions on Parallel Distributed System, Vol. 4, No. 4, April,
pp. 446-457.
69.
Ma P.Y.R., I^e E.Y.S. and Tsuchiya J. (1882), ‘A task allocation model for
distributed computing systems’, IEEE Trans, on Computers, Jan, VoL C-31,
No.l. pp. 41-47.
70.
Manimaran and Siva Ram Murthy (1997), ‘Dynamic scheduling of
parallelizable tasks and resource reclaiming in real-time multiprocessor
systems, Proc. Fourth International Conference on High performance
computing, HiPC, Dec. 18-21, Bangalore, India, pp. 206-211.
71.
Markenscoff .P, and Liaw ,W. (1986), ‘Task allocation problems in distributed
computer systems’, Proc. IEEE Int. Conf. Parallel Processing, pp. 953-960.
72.
Mendel J.M. (1971), ‘Computational requirements of a discrete Kalman filter’,
IEEE Trans on Automatic Control-16, pp. 748-758.
73.
Muhlenbein .H, Gorges-Schleuter .M, and Kramer .O. (1987), ‘New solutions
to the mapping problem of a parallel systems: The evolution approach’,
Parallel Computing, Vol. 4, pp. 269-279.
74.
Ni., M.L., and Hwang., K. (1985), ‘Optimal load balancing in a
multiprocessor system with many job classes’, IEEE Transactions on
Software Engineering, Vol. SE-II, No 5, May 1985, pp. 491-496.
‘VLSI
Array Processors’, IEEE ASSP Mag., July,
228
75.
Nilson, N.J. (1990), ‘Principles of Artificial Intelligence, New Delhi,
Norosa Publications House.
76.
Pacini P.J. and Kosko. B. (1992), ‘Comparison of Fuzzy and Kalman Filter
target tracking Control System’, Neural Networks and Fuzzy systems - A
Dynamical systems approach to Machine Intelligence, Prentice Hall, N.J.,
pp. 379-406.
77.
Palis, M.A., Jing-Chiou Liou and David Wei, S.L., (1996), ‘Task clustering
and scheduling for distributed memory parallel architectures’, IEEE
Transactions on Parallel and Distributed Systems, Vol. 7, No. 1, Jan,
pp. 46-54.
78.
Papadourakis, G.M. and Taylor F.J. (1987), ‘Implementation of Kalman
filters using systolic arrays’, Proc. Int. Conf. Acoust. Speech and Signal
Processing, Dallas, TX 2, April, pp. 783-786.
79.
Parallel C (1991). User guide, 3L Ltd., UK.
80.
Pattipati, K.R., Kurien, T., Lee, R. and Luh P.B., (1990), ‘On mapping a
tracking algorithm onto parallel processors’, IEEE Transactions on
Aerospace and Electronic Systems, Vol. 26, No. 5, Sept., pp. 774-791.
81.
Peng .D.T. and Shin .K.G, (1993), ‘Optimal scheduling of co-operative tasks
in distributed system using an enumerative method’, IEEE Trans, on Software
Engg., March, Vol. 19, No.3, pp. 253-267.
82.
Periyakumar D.AL. and Siva Ram Murthy, C. (1996), ‘Optimal scheduling of
parallel tasks of tracking problem onto multiprocessors’, IEEE Trans, on AES,
April. Vol. 32, No. 2, pp. 722-731.
83.
Quinn M.J. (1994), ‘Parallel Computing-Theory and Practice’, Second
Edition, McGraw Hill Inc., New York.
84.
Rajaraman, V., (1990), ‘Elements of Parallel Computing’, Prentice-Hall of
India P. Ltd., NewDelhi-110001.
85.
Ramachandra K.V. (1984), ‘Position velocity and acceleration estimates
from noisy radar measurements’, IEE Proceeding Part-F Vol. 131, April,
pp. 167-168.
86.
Ramachandra K.V. and V.S. Srinivasan (1977), ‘Steady state results for the
X-Y-Z Kalman tracking filter’, IEEE Trans, on Aerospace and Electronic
Systems, Vol. AILS-13, July, pp. 419-423.
229
87.
Ramamoorthy C.V., Chandy, K.M. and Gonzalez, M.J. (1972), ‘Optimal
scheduling strategies in a multiprocessor system’, IEEE Trans Computers,
Eeb., Vol. C 21, No 2, pp. 137-146.
88.
Ramamritham K., Stankovic, J.A. and Perng-Eei Shiah (1990), ‘Efficient
scheduling algorithms for real-time multiprocessor systems’, IEEE Trans on
Parallel and Distributed Systems, April, Vol 1, No.2, pp. 184-194.
89.
Ramaswamy, S., Sapatnekar S. and Banerjee P. (1997), ‘A frame work for
exploiting task and data parallelism on distributed momory
multicomputers’, IEEE Trans in Parallel and Distributed System, Vol. 8,
No. 11, November, pp. 1098-1116.
90.
Rao D.K. and Dhawas, J.A., (1995), ‘Parallel implementation of radar
tracking extended Kalman filters on transputer networks’,
IEEE
Transactions on Aerospace and Electronics Systems, Vol. 31, No. 2, April,
pp. 857-862.
91.
Sarkar. V. (1989), ‘Partitioning and scheduling parallel programs for
execution on multiprocessors, Cambridge, Mass: MIT Press.
92.
Selvakumar, S. and Siva Ram Murthy, C., (1994), ‘Scheduling precedence
constrained task graphs with non-negligible inter-task communication onto
multiprocessors’, IEEE Transactions on Parallel and Distributed Systems,
Mar., Vol. 5, No. 3, pp. 328-336.
93.
Sih, G.C., and Lee, E.A, (1993), ‘A compile-time scheduling heuristic for
interconnection-constrained heterogeneous processor architectures’, IEEE
Trans, on Parallel and Distributed systems, Feb., Vol. 4, No. 2, pp. 175-187.
94.
Sill. G.C., and Lee, E.A., (1993a), ‘Declustering: A new multiprocessor
scheduling technique’, IEEE Trans, on Parallel and Distributed systems, June,
Vol. 4, No. 6, pp. 625-637.
95.
Singer, R. A., (1970), ‘Estimating Optimal Tracking Filter Performance
for Manned Maneuvering Targets’, IEEE Transactions on AES, No. 6,
pp. 473-483.
96.
Siva Ram Murthy, C„ Balasubramanya Murthy .K.N, and Sreenivas .A,
(1993), 'Scheduling of precedence-constrained parallel program tasks onto
multiprocessors’, Microprocessing and Microprogramming Journal, March,
Vo 1.36, No.2, pp. 93-104.
97.
Skolnik, M.L. (1980), ‘Introduction to Radar systems’, Me Graw Hill Inc.,
New York.
230
98.
Sorenson H.W. (Ed.) (1985), ‘Kalman filtering: Theory and applications’
IEEE Press Inc., NewYork.
99.
Srinivasa.,M., and Patnaik, L.M., (1994), ‘Genetic algorithms: Survey’,
IEEE Transactions on Computers, Vol. 27, No. 6, Eeb., pp. 17-26.
100.
Stankovic J.A. Ramamritham. K. and Cheng S. (1985), ‘Evaluation of a
flexible task scheduling algorithm for distributed hard real-time system’, IEEE
Trans on Computers Dec., Vol C-34, No. 12, pp. 1130-1143.
101.
Stone .H.S. (1997), ‘Multiprocessor scheduling with the aid of network flow
algorithms’, IEEE Trans, on Software Engg., Vol. 3, No. 1, pp. 85-93.
102.
Sung. T. and Hu. Y., (1987), ‘Parallel VLSI implementation of the Kalman
filter’, IEEE Transactions on Aerospace and Electronic Systems’, AES 23,
No 2, Mar, pp. 215-224.
103.
Tang, K.S., Man, K.F., Kwong, S. and He, Q. (1996), ‘Genetic Algorithms
and their applications’, IEEE Signal Processing Magazine, Nov., pp. 22-37.
104.
Towsley.D. (1986) 'Allocating programs containing branches and loops
within a multiple processor system’, IEEE Transactions on Software
Engineering, Oct., Vol. SE 12, No-10, pp. 1018-1024.
105.
Travassos, R.H., (1983), ‘Real-time implementation of systolic Kalman
filters’, Proc., SPIE Int. Soc. Opt. Eng., 431, pp. 97-104.
106.
Udaiavar, N. (1992). ‘A simple but flexible model for determining optimal
task allocation and configuration on a network of transputers’, Transputers
92. IOS Press, pp. 24-32.
107.
Ullman .J.D. (1975), ‘NP-complete scheduling problems’, J. Comput. Syst.
Sci., Vol. 10, pp. 384-393.
108.
Vairavan .K, and Demillio .R.A. (1976), ‘On the computational complexity of
a generalized scheduling problem’, IEEE Trans, on Computers, Nov, Vol. 25,
pp. 1067-1073.
109.
Wu. M.Y. and Gajski D.D. (1990), ‘Hypertool: A programming aid for
message-passing systems’, IEEE transactions on Parallel and Distributed
Systems, July Vol. 1, No 3, pp. 330-343.
110.
Yang T. and Eu C. (1997), ‘Heuristic algorithms for scheduling iterative
task computations on distributed memory machines’, IEEE Trans, on
Parallel and distributed systems, Vol.8, No. 6, June, pp. 608-622.
231
111.
Yang, T. and Gerasoulis, A. (1994), ‘Scheduling Parallel tasks on an
unbounded number of processors’, IEEE Transactions on Parallel and
Distributed Systems, Sept., Vol. 5, No. 9, pp. 951-967.
112.
Yeh, H.G., (1986), ‘Kalman filtering and systolic processes’, Proc. Int.
Conf. Acoust. Speech and Signal Process, 1986, pp. 2139-2142.
113.
Yeh, H.G., (1988), ‘Systolic implementation of Kalman filters’, IEEE
Trans., ASSP-36, (9), pp. 1514-1517.
114.
Zhao. W., Ramamritham. K. and Stankovic J.A. (1987), ‘Scheduling tasks
with resource requirements in hard real-time systems, IEEE Trans, on
Software Engineering, May, Vol. SE-13, No. 5, pp. 564-577.
115.
Zissman .M.A, and O'Leary .G.C, (1987), ‘A block diagram compiler for a
digital signal processing MIMD computer’, Proc. IEEE Int. Conf. ASSP
(Dallas, TX), pp. 1867-1870.