Search

Background: College students show higher prevalence of mental health issues as compared to the general population. Unfortunately, this year, students all over the world have to face, added pressure due to COVID-19. This study aimed to estimate the effect of COVID-19 pandemic and lockdown on the mental health of Medical and Engineering Students. Subjects and methods: The study was carried out at different medical and engineering colleges in Bihar, Delhi and Maharashtra, and Tamil Nadu. 699 responses were collected and analyzed during the study period. Data was collected by email/ online platform through Google form via non- probability Sampling Technique. Mental health status was determined by using Corona virus anxiety screening (CAS), GHQ (General Health Questionnaire)-12, GAD (General Anxiety Disorder)-7 scale and PHQ (Patient Health Questionnaire)-9 scales.369 (53%) MBBS and 330 (47%) Engineering students participated in the study. Results: Maximum participants in both groups did not have anxiety related to COVID-19 (MBBS (96.8%) and Engineering (95.2%). About two-third participants secured above cut off score i.e., MBBS (62.3%) and Engineering (64.8%) in GHQ-12. Approximately comparable proportion in both groups were found to have severe anxiety and depression (16% vs 20%), when applied GAD-7 and PHQ-9. Uncertainty in the timing of the exams/ Academic delay was found to be the most worrying factor (MBBS, 41.19% vs Engineering 31.82%). Conclusions: About two-thirds of medical and engineering students psychologically equally affected by current pandemic in our study. A student wellness clinic is the need of hour in current scenario, which is supported by mental health experts (Psychiatrists, Clinical Psychologists) and residents on rotation basiswhere all psychological problem including Stress, Anxiety, Interpersonal crisis, Relationship issues and Personality problems of the students are dealt effectively in institute campus near to student residential area.

Interconnection networks enable fast data communication between components of a digital system. The selection of an appropriate interconnection network and its architecture plays an important role in the development process of the system. The selection of a bad network architecture may significantly delay the communication between components and decrease the overall system performance. There are various interconnection networks available. Most of them are blocking networks. Blocking means that even though a pair of source and target components may be free, a connection between them might still not be possible due to limited capabilities of the network. Moreover, routing algorithms of blocking networks have to avoid deadlocks and livelocks, which typically does only allow poor real-time guarantees for delivering a message. Nonblocking networks can always manage all requests that are coming from their input components and can therefore deliver all messages in guaranteed time, i.e, with strong real-time guarantees. However, only a few networks are nonblocking and easy to implement. The simplest one is the crossbar network which is a comparably simple circuit with also a simple routing algorithm. However, while its circuit depth of O(log(n)) is optimal, its size increases with O(n^2) and quickly becomes infeasible for large networks. Therefore, the construction of nonblocking networks with a quasipolynomial size O(nlog(n)^a) and polylogarithmic depth O(log(n)^b) turned out as a research problem. Benes [Clos53; Bene65] networks were the first non blocking networks having an optimal size of O(nlog(n)) and an optimal depth of O(log(n)), but their routing algorithms are quite complicated and require circuits of depth O(log(n)^2) [NaSa82]. Other nonblocking interconnection networks are derived from sorting networks. Essentially, there are merge-based (MBS) and radix-based (RBS) sorting networks. MBS and RBS networks can be both implemented in a pipelined fashion which leads to a big advantage for their circuit implementation. While these networks are nonblocking and can implement all n! permutations, they cannot directly handle partial permutations that frequently occur in practice since not every input component communicates at every point of time with an output component. For merge-based sorting networks, there is a well known general solution called the Batcher-Banyan network. However, for the larger class of radix-based sorting networks this does not work, and there is only one solution known for a particular permutation network. In this thesis, new nonblocking radix-based interconnection networks are presented. In particular, for a certain permutation network, three routing algorithms are developed and their circuit implementations are evaluated concerning their size, depth, and power consumption. A special extension of these networks allows them to route also partial permutations. Moreover, three general constructions to convert any binary sorter into a ternary split module were presented which is the key to construct a radix-based interconnection network that can cope with partial permutations. The thesis compares also chip designs of these networks with other radix-based sorting networks as well as with the Batcher-Banyan networks as competitors. As a result, it turns out that the proposed radix-based networks are superior and could form the basis of larger manycore architectures.

In general, sorting networks can be used as interconnection networks in that the inputs are simply sorted according to their target addresses. If the target addresses form a permutation of the addresses, this is obviously correct since the sorting algorithm routes each message to the output with the desired target address. However, if not all inputs need a connection to one of the outputs, partial permutations are obtained since then some input addresses are not mapped to any output address at all. In this case, sorting networks work no longer correctly as interconnection networks since the addresses larger than the missing addresses will be routed to the wrong outputs. For merge-based sorting networks, there is a well-known general solution called the Batcher-Banyan network. However, for the bigger class of radix-based sorting networks, there is only one solution known for a particular permutation network. In this paper, we present a general construction to transform any radix-based sorting network into one that can cope with partial permutations. While our solution roughly doubles the number of gates, it still maintains the depth of the circuit.