88 resultados para Science fair
em Indian Institute of Science - Bangalore - Índia
Resumo:
The correctness of a hard real-time system depends its ability to meet all its deadlines. Existing real-time systems use either a pure real-time scheduler or a real-time scheduler embedded as a real-time scheduling class in the scheduler of an operating system (OS). Existing implementations of schedulers in multicore systems that support real-time and non-real-time tasks, permit the execution of non-real-time tasks in all the cores with priorities lower than those of real-time tasks, but interrupts and softirqs associated with these non-real-time tasks can execute in any core with priorities higher than those of real-time tasks. As a result, the execution overhead of real-time tasks is quite large in these systems, which, in turn, affects their runtime. In order that the hard real-time tasks can be executed in such systems with minimal interference from other Linux tasks, we propose, in this paper, an integrated scheduler architecture, called SchedISA, which aims to considerably reduce the execution overhead of real-time tasks in these systems. In order to test the efficacy of the proposed scheduler, we implemented partitioned earliest deadline first (P-EDF) scheduling algorithm in SchedISA on Linux kernel, version 3.8, and conducted experiments on Intel core i7 processor with eight logical cores. We compared the execution overhead of real-time tasks in the above implementation of SchedISA with that in SCHED_DEADLINE's P-EDF implementation, which concurrently executes real-time and non-real-time tasks in Linux OS in all the cores. The experimental results show that the execution overhead of real-time tasks in the above implementation of SchedISA is considerably less than that in SCHED_DEADLINE. We believe that, with further refinement of SchedISA, the execution overhead of real-time tasks in SchedISA can be reduced to a predictable maximum, making it suitable for scheduling hard real-time tasks without affecting the CPU share of Linux tasks.
Resumo:
Phase relations in the system Ta-Rh-O were determined by analysis of quenched samples corresponding to thirteen compositions inside the ternary triangle after equilibration at 1273 K. All the Ta-Rh alloys were found to be in equilibrium with Ta2O5. Only one ternary oxide TaRhO4 was detected. Based on phase relations in the ternary system, a solid-state electrochemical cell, incorporating calcia-stabilized zirconia as the electrolyte, was designed to measure the standard Gibbs energy of formation (Delta G degrees, J mol(-1)) of TaRhO4 in the temperature range from 900 to 1300 K. For the reaction, 1/2 beta-Ta2O5 + 1/2 Rh2O3(ortho) -> TaRhO4 Delta G degrees = -42993 + 5.676T (+/- 85) The calculated decomposition temperatures of TaRhO4 are 1644 +/- 5K in pure O-2 and 1543 +/- 5K in air at a total pressure p(o) = 0.1 MPa. Thermodynamic properties of TaRhO4 at 298.15K have been evaluated from the results. The limited experimental thermodynamic data for Rh-rich alloys available in the literature are in fair accord with Miedema's model. The Gibbs energies of formation of the different phases in the binary system Ta-Rh were estimated based on these inputs, consistent with the binary phase diagram. Based on the thermodynamic information on the stability of various phases, an oxygen potential diagram for the system Ta-Rh-O at 1273K was constructed. Also presented are temperature-composition diagrams for the ternary system at constant oxygen partial pressures (po(2)/p(o) = 0.212 and 10(-6)) calculated form the basic data.
Resumo:
Abstract is not available.
Resumo:
In this paper the implementation and application of a microprocessor-based medium speed experimental local area network using a coaxial cable transmission medium are dealt with. A separate unidirectional control wire has been used in order to provide a collision-free and fair medium access arbitration. As an application of the network, the design of a packet voice communication system is discussed.
Resumo:
In this paper we consider the problem of computing an “optimal” popular matching. We assume that our input instance View the MathML source admits a popular matching and here we are asked to return not any popular matching but an optimal popular matching, where the definition of optimality is given as a part of the problem statement; for instance, optimality could be fairness in which case we are required to return a fair popular matching. We show an O(n2+m) algorithm for this problem, assuming that the preference lists are strict, where m is the number of edges in G and n is the number of applicants.
Resumo:
Frequencies of free vibration of rectangular plates of arbitrary thickness, with different support conditions, are calculated by using the Method of Initial Functions (MIF), proposed by Vlasov. Sixth and fourth order MIF theories are used for the solution. Numerical results are presented for three square plates for three thickness ratios. The support conditions considered are (i) three sides simply supported and one side clamped, (ii) two opposite sides simply supported and the other two sides clamped and (iii) all sides clamped. It is found that the results produced by the MIF method are in fair agreement with those obtained by using other methods. The classical theory gives overestimates of the frequencies and the departures from the MIF results increase for higher modes and larger thickness ratios.
Resumo:
Modern science, which was an indigenous product of Western culture, is now being practised in many non-Western countries. This paper discusses the peculiar social, cultural and intellectual problems which scientists of these non-Western countries face in adopting Western science in their situations, with special reference to India. It is pointed out that, in addition to money and communication, it is necessary to have a proper psychological gestalt to practise science satisfactorily. The author analyzes his experience as a physics student in India and in the United States to clarify the nature of this psychological gestalt, and to explain what makes it difficult for non-Western scientists to acquire it.
Resumo:
In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged. Formation of such procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions. Recent research in supply chain management has emphasized that such decisions need to take into account the fact that suppliers and buyers are intelligent and rational agents who act strategically. In this paper, we view the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a fair manner. We study the implications of using the Shapley value as a solution concept for forming such procurement networks. We also present a protocol, based on the extensive form game realization of the Shapley value, for forming these networks.
Resumo:
Next generation wireless systems employ Orthogonal frequency division multiplexing (OFDM) physical layer owing to the high data rate transmissions that are possible without increase in bandwidth. While TCP performance has been extensively studied for interaction with link layer ARQ, little attention has been given to the interaction of TCP with MAC layer. In this work, we explore cross-layer interactions in an OFDM based wireless system, specifically focusing on channel-aware resource allocation strategies at the MAC layer and its impact on TCP congestion control. Both efficiency and fairness oriented MAC resource allocation strategies were designed for evaluating the performance of TCP. The former schemes try to exploit the channel diversity to maximize the system throughput, while the latter schemes try to provide a fair resource allocation over sufficiently long time duration. From a TCP goodput standpoint, we show that the class of MAC algorithms that incorporate a fairness metric and consider the backlog outperform the channel diversity exploiting schemes.