<![CDATA[Java Programming Forums - The Java Community - Algorithms & Recursion]]> http://www.javaprogrammingforums.com/ en Sun, 19 May 2013 12:51:32 GMT vBulletin 60 http://www.javaprogrammingforums.com/images/misc/rss.png <![CDATA[Java Programming Forums - The Java Community - Algorithms & Recursion]]> http://www.javaprogrammingforums.com/ Earliest deadline cpu scheduling algorithm http://www.javaprogrammingforums.com/algorithms-recursion/29524-earliest-deadline-cpu-scheduling-algorithm.html Sat, 18 May 2013 10:34:12 GMT I can't figure out how to show the correct diagram for this earliest deadline first algorithm. So far here is my code:
Code :
import java.util.*;
 
 
    class deadlineprototype
    {
 
 
    public static void main(String args[])
    {
 
 
    Scanner sc = new Scanner(System.in);
 
 
    System.out.println("enter no. of processes : ");
    int n=sc.nextInt();
    int job[]=new int[n+1];
    int burst[]=new int[n+1];
    int newburst[]=new int[n+1];
    int arrival[]=new int[n+1];
    int deadline[]=new int[n+1];
    int wt[]=new int[n+1];
    int turn[]=new int[n+1];
    int tot_turn=0;
    int tot_wait=0;
    float avg_turn=0;
    float avg_wait=0;
    int j;
 
    for(int m=1;m<=n;m++)
        {
        arrival[m]=m;
        }
    for(int m=1;m<=n;m++)
        {
        job[m]=m;
        }
 
    for(int m=1;m<=n;m++)
        {
        System.out.println("enter arrival time, burst time and deadline of process "+(m)+"(0 for none):");
        arrival[m]=sc.nextInt();
        burst[m]=sc.nextInt();
        deadline[m]=sc.nextInt();
 
    if (deadline[m]==0){
        deadline[m]=1000;
    }
        }
 
 
 
    int temp;
    for(int i=1;i<n;i++)
        {
        for(j=1;j<n;j++)
            {
 
                if(deadline[i+1]<deadline[j])
                {
                temp=deadline[j+1];
                deadline[j+1]=deadline[j];
                deadline[j]=temp;
 
                temp=job[j+1];
                job[j+1]=job[j];
                job[j]=temp;
 
                temp=burst[j+1];
                burst[j+1]=burst[j];
                burst[j]=temp;
                }
        }
        }
    turn[1]=burst[1];    
 
    for(int i=2;i<=n;i++)
        {
        turn[i]=burst[i]+turn[i-1];
        wt[i]=turn[i]-burst[i];
        }
    for(int i=1;i<=n;i++)
        {
        tot_turn+=(wt[i]+burst[i])-arrival[i];
        avg_turn=(float)tot_turn/n;
        tot_wait+=wt[i]-arrival[i];
        avg_wait=(float)tot_wait/n;
        }
    System.out.println("----------Earliest Deadline Scheduling Diagram----------");
    for(int m=1;m<=n;m++)
        {
    if(deadline[m]==1000){
            deadline[m]=0;
            }
    if(wt[m]==0){
            System.out.println("0"+wt[m]+" _____"); 
    }
    else{
    System.out.println(wt[m]+" _____"); 
    }
            System.out.println("  |     |");
 
            System.out.println("  |job "+job[m]+"|");
 
            System.out.println("  |_____|");
                    try
                 {
                 //newburst[m]=(burst[m]*1000);
                 Thread.sleep(1000);  
                 }catch (InterruptedException ie)
                 {
                 System.out.println(ie.getMessage());
                 }
    }
    System.out.println((wt[wt.length-1]+burst[burst.length-1]));

If I input 2 processes this will be the output:
Code :
enter no. of processes : 
    2
    enter arrival time, burst time and deadline of process 1(0 for none):
    0 17 0
    enter arrival time, burst time and deadline of process 2(0 for none):
    0 13 10
    ----------Earliest Deadline Scheduling Diagram----------
    00 _____
      |     |
      |job 2|
      |_____|
    13 _____
      |     |
      |job 1|
      |_____|
    30

It shows the correct intended output. But for 3 processes like this then it will output:
Code :
enter no. of processes : 
    3
    enter arrival time, burst time and deadline of process 1(0 for none):
    0 17 0
    enter arrival time, burst time and deadline of process 2(0 for none):
    0 13 10
    enter arrival time, burst time and deadline of process 3(0 for none):
    25 14 20
    ----------Earliest Deadline Scheduling Diagram----------
    00 _____
      |     |
      |job 2|
      |_____|
    13 _____
      |     |
      |job 3|
      |_____|
    27 _____
      |     |
      |job 1|
      |_____|
    44
It shows an incorrect output, that job 1 should come after job 2 and instead of job 3. But then again if I input 5 process it will show correct output again:
Code :
enter no. of processes : 
    5
    enter arrival time, burst time and deadline of process 1(0 for none):
    0 17 0
    enter arrival time, burst time and deadline of process 2(0 for none):
    0 13 10
    enter arrival time, burst time and deadline of process 3(0 for none):
    25 14 20
    enter arrival time, burst time and deadline of process 4(0 for none):
    25 10 15
    enter arrival time, burst time and deadline of process 5(0 for none):
    30 5 0
    ----------Earliest Deadline Scheduling Diagram----------
    00 _____
      |     |
      |job 2|
      |_____|
    13 _____
      |     |
      |job 1|
      |_____|
    30 _____
      |     |
      |job 4|
      |_____|
    40 _____
      |     |
      |job 3|
      |_____|
    54 _____
      |     |
      |job 5|
      |_____|
    59
And now I wonder what codes is causing the program to show incorrect input. Please help with this problem thanks in advance! ]]> eraniichan http://www.javaprogrammingforums.com/algorithms-recursion/29524-earliest-deadline-cpu-scheduling-algorithm.html How to specify the number of processors to use in each round of execution in a multicore environment http://www.javaprogrammingforums.com/algorithms-recursion/29431-how-specify-number-processors-use-each-round-execution-multicore-environment.html Mon, 13 May 2013 15:03:35 GMT Hello, I already know how to use the runtime method to get the number of available processors but what I need is how to control the number of... Hello, I already know how to use the runtime method to get the number of available processors but what I need is how to control the number of processors to be used during each round of test or execution in a multicore environment.
Put differently, I want to experiment on one node of a multicore computer with 12processors, but I need to be able to specify at each round of the experiment (execution) how many processors should execute my threaded application. I need to be able to specify the use of 2 cpus, 4 cpus, 6 cpus,8 cpus, 10 cpus and 12 cpus.
Any suggestion will be welcome
Thanks ]]> atgoodprogram http://www.javaprogrammingforums.com/algorithms-recursion/29431-how-specify-number-processors-use-each-round-execution-multicore-environment.html Help With Diamond Square Terrain http://www.javaprogrammingforums.com/algorithms-recursion/29138-help-diamond-square-terrain.html Sat, 04 May 2013 10:16:58 GMT This code may be difficult to understand but basically I'm just trying to do the diamond square algorithm to make some terrain for a tile based game. I never found an example of this for a tiled game so I painstakingly converted someones midpoint displacement, that was for values between 1.0 & 0.0, to all positive numbers and whole number. I also fixed it for diamond square but im not sure if im doing that right. The 4 points of the diamond are actually 3 but i added the midpoint twice cause I didn't want to wrap. I feel like its not doing all the steps properly and in the pixel mode that i have as default atm shows diamond and square artifacts and even can be seen sometimes from the more zoomed in version too. One thing anyone would notice if they are familiar would be the fact a don't have a starting noise value and having it decrease after each completion (I am having trouble in this area too). For each step it is adding plus or minus 1. At the way bottom of the code is the keyboard handler and it set noise to 4 for now, clears the array, and makes new corner values after pressing spacebar. If someone can see if I did the diamond square wrong and have any tips for generating these numbers for a tile based game that would be awesome. The decimal places were making it difficult for me but I might go back and use em again but just times the height value by 10 or 100 to bump it up to something I may find more usable.

Code :
package bttg;
 
import java.awt.*;
import java.awt.event.FocusEvent;
import java.awt.event.FocusListener;
import java.awt.event.KeyEvent;
import java.awt.event.KeyListener;
import java.awt.event.MouseEvent;
import java.awt.event.MouseListener;
import java.applet.*;
 
 
 
@SuppressWarnings("serial")
public class BTTG extends Applet implements KeyListener, MouseListener, FocusListener{
		short i = 0;
		int worldSize = 499; //99       <-------------------
		int[][] map = new int[worldSize+1][worldSize+1];	
		boolean focussed = false;
		short rand;
		double noise = 0;
 
 
	public void init()
	{
		addKeyListener(this);
 
	}
 
 
 
 
	public boolean squareStep(int x, int y, int x1, int y1) //Diamond and Square Steps
	{
 
		if(x1-x<2 && y1-y<2) return false;
		int sideMidX = (x+x1)/2;
		int sideMidY = (y+y1)/2;
 
 
		rand = (byte) (Math.random()*noise - (noise/2));  // These values are locked at the moment      random()*4 - (4/2); .... creates -1 to 1. 2 -1 wasn't working;  Try doing 6 - (6/2) for more bumpy terrain
		if(map[sideMidX][sideMidY] == 0) map[sideMidX][sideMidY] = Math.abs((map[x][y] + map[x][y1] + map[x1][y] + map[x1][y1])/4 + (int)rand);  // Diamond
 
 
		rand = (byte) (Math.random()*noise - (noise/2));
		if(map[x][sideMidY] == 0)  map[x][sideMidY] = Math.abs((map[x][y1] + map[x][y] + map[sideMidX][sideMidY] + (map[sideMidX][sideMidY])+rand)/4) + (int) rand);  // Left side Squares or other way around\/\/\/ 
// Having these at + 0 noise make really flat terrain which isnt bad  either
 
 
		rand = (byte) (Math.random()*noise - (noise/2));
		if(map[sideMidX][y] == 0)  map[sideMidX][y] = Math.abs((map[x1][y] + map[x][y] + map[sideMidX][sideMidY] + (map[sideMidX][sideMidY])+rand)/4) + (int) rand; // Top Side
 
 
		rand = (byte) (Math.random()*noise - (noise/2));
		if(map[sideMidX][y1] == 0)  map[sideMidX][y1] = Math.abs((map[x][y1] + map[x1][y1] + map[sideMidX][sideMidY] + (map[sideMidX][sideMidY])+rand)/4) + (int) rand; // Right Side
 
		rand = (byte) (Math.random()*noise - (noise/2));
		if(map[x1][sideMidY] == 0)  map[x1][sideMidY] = Math.abs((map[x1][y] + map[x1][y1] + map[sideMidX][sideMidY] + (map[sideMidX][sideMidY])+rand)/4) + (int) rand; 
 
 
		squareStep(x,y,sideMidX,sideMidY);	
		squareStep(sideMidX,y,x1,sideMidY);
		squareStep(x,sideMidY,sideMidX,y1);
		squareStep(sideMidX,sideMidY,x1,y1);
 
 
	    return true;
	}
 
 
 
 
	public void paint(Graphics g)
	{
 
 
	int x=0;
	int y=0;
 
	g.setColor(Color.BLACK);
	g.fillRect(0,0,1920,1080);
	Font mapFont = new Font ("Monospaced", Font.BOLD, 8); // Not used this is to check the numbers below change to 12 if you want to see values
	g.setFont(mapFont);
	int xMap = 0;
	int yMap = 0; // for numbers change this to 15
 
 
	while(y<worldSize+1)
	{   
		Color bum = new Color(map[x][y], map[x][y],map[x][y]); // makes white shaded array values(times each one by 5 if displaying array values)
		g.setColor(bum); // sets that color
		g.fillRect(xMap, yMap,1,1);   //change this g.draw("" + map[x][y] ,xMap, yMap); to change from pixels to numbers (dont forget to change the others too and also change mapSize to 99 at the top
		xMap += 1; // for numbers change this to 15
		x++;
 
		if(x == worldSize+1) 
		{		
			x=0;
			y++;
			xMap =0;
			yMap += 1; // for numbers change this to 15
		}
		}
	}
 
	public void keyPressed(KeyEvent evt) 
	{
		int key = evt.getKeyCode(); 
 
		if (key == KeyEvent.VK_SPACE)        //Space makes a new map
		{
			int x = 0,y = 0;
			noise = 4;
			while(y<worldSize+1)
			{   
				map[x][y] = 0;
				x++;
 
				if(x == worldSize+1)
				{		
					x=0;
					y++;
				}
 
			}
 
			rand = (short) ((Math.random()*(worldSize/2)));  // \/\/\/\/ These generate the starting corners
			map[0][0] = rand;
			rand = (short) ((Math.random()*(worldSize/2))); 
			map[worldSize][0] = rand;
			rand = (short) ((Math.random()*(worldSize/2)));
			map[0][worldSize] = rand;
			rand = (short) ((Math.random()*(worldSize/2)));
			map[worldSize][worldSize] = rand;
 
			 // rand = (short) ((Math.random()*(worldSize/2)));  // Take comments of to also place one midpoint seed
			// map[worldSize/2][worldSize/2] = rand;
 
 
			squareStep(0,0,worldSize,worldSize);
			repaint();
		}
	}
 
	public void keyReleased(KeyEvent evt) { }
	public void keyTyped(KeyEvent evt) { char ch = evt.getKeyChar();}
	public void mousePressed(MouseEvent evt) {requestFocus(); System.out.println("Mouse Works");}        
	public void focusLost(FocusEvent evt) {focussed = false;}
	public void focusGained(FocusEvent evt) {focussed = true; System.out.println("We Have Focus");}
	public void mouseEntered(MouseEvent evt) { }  
	public void mouseExited(MouseEvent evt) { }  
	public void mouseReleased(MouseEvent evt) { } 
	public void mouseClicked(MouseEvent evt) { }
 
 
}
]]> hobbles http://www.javaprogrammingforums.com/algorithms-recursion/29138-help-diamond-square-terrain.html RECURSION http://www.javaprogrammingforums.com/algorithms-recursion/28229-recursion.html Sat, 20 Apr 2013 08:24:41 GMT Could someone explain recursion to me please. I get that a function loops coz it is called several times but I can't get why and how! Frustration. ]]> kevthanewversi http://www.javaprogrammingforums.com/algorithms-recursion/28229-recursion.html