sindhuja
Junior Member level 1
Hi gurus,
Here , I need solution for the follwing conditions. Algorithm need to generate non-blocking solution for the given connection command like
" A-map-->D/C or B--map-->C/D " that performs Time-Space-Time switching.
A C
==> <==
Time time
X
space switch
B D
==> <==
time time
. Now algorithm has to compute non-blocking for this connection command.
Is there any existing matrix soltuion for this situation inorder to reduce computing complexity. If so pls kindly give the details etc.,
thanks
sindhu.
Here , I need solution for the follwing conditions. Algorithm need to generate non-blocking solution for the given connection command like
" A-map-->D/C or B--map-->C/D " that performs Time-Space-Time switching.
A C
==> <==
Time time
X
space switch
B D
==> <==
time time
. Now algorithm has to compute non-blocking for this connection command.
Is there any existing matrix soltuion for this situation inorder to reduce computing complexity. If so pls kindly give the details etc.,
thanks
sindhu.