..

జర్నల్ ఆఫ్ కంప్యూటర్ సైన్స్ & సిస్టమ్స్ బయాలజీ

మాన్యుస్క్రిప్ట్ సమర్పించండి arrow_forward arrow_forward ..

వాల్యూమ్ 4, సమస్య 4 (2011)

పరిశోధన వ్యాసం

Improving Scheduling Criteria of Preemptive Tasks Scheduled under Round Robin Algorithm using Changeable Time Quantum

Samih M. Mostafa, Safwat H. Hamad and S. Z. Rida

Problem statement: In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment. If time quantum is too small, it causes unnecessarily frequent context switch leading to more overheads resulting in less throughput. In this paper a method using changeable time quantum has been proposed that decides a value that is neither too large nor too small such that this value gives the beast scheduling criteria and every process has got reasonable response time and the throughput of the system is not decreased due to unnecessarily context switches.

పరిశోధన వ్యాసం

Towards an Exact Reconstruction of a Time-Invariant Model from Time Series Data

Michael A. Idowu and James Bown

Dynamic processes in biological systems may be profiled by measuring system properties over time. One way of representing such time series data is through weighted interaction networks, where the nodes in the network represent the measurables and the weighted edges represent interactions between any pair of nodes. Construction of these network models from time series data may involve seeking a robust data-consistent and time-invariant model to approximate and describe system dynamics. Many problems in mathematics, systems biology and physics can be recast into this form and may require finding the most consistent solution to a set of first order differential equations. This is especially challenging in cases where the number of data points is less than or equal to the number of measurables. We present a novel computational method for network reconstruction with limited time series data. To test our method, we use artificial time series data generated from known network models. We then attempt to reconstruct the original network from the time series data alone. We find good agreement between the original and predicted networks.

ఇండెక్స్ చేయబడింది

arrow_upward arrow_upward