is linux kernel is priority preemptive kernel?if it is. where it is using round robin scheduling algorithm?when processes are scheduled for the processor process will be allocated as which sechudling alogorithm?
I want to change linux scheduling algorithm for some of my processes but when I click on processes in ksysguard and click renice project, all of the processes use normal level cpu scheduling. Why is it such a thing and there is no priority?
I have a timer thread, and when it expires, it sets a flag. The only problem is, if any higher priority thread comes in between, then the timer is not expired in real time.Thus i want to set a highest priority to my thread. Now, i know 2 algos, which can make my thread in real time are: SCHED_FIFO and SCHED_RR.
So, here are my queries: 1) Which scheduling algo is best suited for this purpose? 2) Is it guaranted to work in real time if i use that algo (you suggest in 1) and set the max_priority by getting the maximum settable priority for that particular algorithm using, int sched_get_priority_max(int policy);
i am new to ns2, i want to implement leach algorithm(MIT uAMPS) but i am unable to know how to install ns-2.1b5 version for it.but i successfully installed ns2.29 in fedora14.
otherwise please intimate what linux flavour will be suitable for ns-2.1b5
i want to do scheduling using /etc/crontab file instead of using crontab -e that is crontab command on the terminal.i am appending to the crontab file in the /etc directory but the scheduling is not happening
iam try to schedule my job in a file made in /etc/cron.d file as follows* * * * * tomcat6 /home/etika/Desktop/eka.sh /home/etika/Desktop/ea/etika.txt abc@gmail.comwhere eka.sh belongs to etika which is the root and etika.txt belong to tomcat6 this command is not running iam confused about the name of the owner written after the *'s please tell me whose name is written after the *'s(the schedule of the script) the owner of the script or the owner of the file which iam passing as an argument to the shell script
I have played around a little bit with CGROUPS and the fair group scheduler ( using kernel version 2.6.31). When you have CGROUPS in a flat structure, with only one layer from the root-cgroup, everything works as you might expect when setting the cpu.shares parameter, i.e. a fraction of the total. But when I experimented with having deeper levels of CGROUPs it did'nt make any sense sometimes. For example, I had one CGROUP with the maximum number of shares (260000 something) , and two childgroups with quite little shares, 5000. Then I created some cpuhogging processes ( while(1); ) and put most of them in childgroups and one in the parentgroup. The logical thing would be if the parentgroups single process took almost all CPU-time, as it had the maximum number of shares, but instead the processes in the childgroups got the most CPU-time.
I have tried to figure out how it works by looking at the source code, but I can't really understand it. How does the hierarchical structure of the cgroup-tree interact with the flat aspect of it, i.e. siblings? Or do I misunderstand the whole concept?
am newbie and i have problem to write a scheduling script in java, this script should do something in certain time interval... Could anybody help me, maybe give some example or source that maybe useful
I am proposing moving from the mainframe to Linux. Problem is that I am not aware of a scheduling product that is available to handle the production code. Currently using CA7. Is there anything out there that accomplishes the same thing? As you can tell, I am NEW to Linux!
I have a copy of the MD5 algorithm and I'm taking a look at the source. It's pretty interesting but there are a few things that I'm curious about and I was wondering if anyone a bit more intuitive than I could help me out.The function declarations in the MD5 files are a bit unfamiliar to me. There is a macro used called PROTO_LIST, which I'm still not sure as to what this thing is doing exactly, but it's littered everywhere throughout the source.The signature here isn't too unfamiliar to me with the exception of the position of the PROTO_LIST macro. So here is a function with an unnamed argument of type MD5_CTX*.To me, this resembles an initializer list found in C++ with constructors but I certainly don't think that is the case here. So my questions about this are (1) how is this legal code in C and (2) what functionality has the PROTO_LIST macro provided for the function?
there are 3 nodes..A,B and C. Node A wants to send information to Node B but it does so by sending it to Node C first which then sends to B. And similarly Node B sends to A. In this simultaneously C doesn't send to both A and B. This is the in built algorithm..but i want to change it to: A and B send their packets to C and C sends both these packets to A and B..by ORing... In the receiver side...node A can receive the wanted packet and also B. Where do i change the algorithm?
I've got a bit of an obscure question for you to test your brains a wee bit. I'm trying to implement a search program to find areas of high density in a binary string.
Where density is the number of 1's / number of digits with a maximum number of digits being the current number in a buffer (in this example 50). So for the example the density for the whole buffer is 15/50. But the density of Buffer[14..20]=[1110001]=4/7. So if looking for areas of density = 1/3 it would find the longest sequences of density over 1/3.So in the example. Buffer[4..9]=[100101]=3/6=1/2 which is above 1/3 but it is within the Buffer[4..48]=[100101000011100010000001000100100001001011001]=15/45=1/3
I have an algorithm guys called "Self Configurable Diagnosis Algorithm" but i don't have program for this.help me regarding that program and which type of Tcl script will be better suitable for that.
I have printer whhich work perfectly on ubuntu desktop I shared it into network and trying to print from Mac and I'm getting the following error: "SpliX Compression algorithm 0x0 does not exist" Printer - Samsung SCX-4200
I need to simulate dijsktra's algorithm using network animator of ns2. how to write a tcl script for my code. This tcl script runs the dijsktra code and simulates its running on network animator.
AStar works on the basis of straight lines, AFAIK. In my case, we have geocoordinates and I can get the straight line distance between the waypoints. But I am wondering how approximate will the route calculated on this basis be? The actual distance "by road", which actually matters can be different.
Example. Assuming A and B are on the same plane, and will be equidistant from the goal point, if we consider a straight line between A and the goal point and, B and the goal point. The distance "by road" between A and the goal point may be greater or lesser than B. But because the AStar works on the basis of straight lines, it will return both the routes as the shortest. If yes, then which algo should be considered , if we want the results on the basis of actual distance in Km/m?
i try to understand this algorithm but i cann't. [URL] I encounter problem understand the algorithm of fixed base windowing exponentiation algorithm ? What is fixed base in the first place ? How this algorithm works ?