The Great Symbian

Anything under the sun goes here!

NOTE: IF IMAGE IS BLURRED, DOUBLE CLICK TO VIEW IMAGE



This step-by-step guide demonstrates how to install Windows Vista.


The best way to install Windows Vista is to do a clean install. It is not difficult to perform a clean installation. Before you perform the installation I recommend that you check Windows Vista System Requirments list to ensure that your hardware is supported by Vista. If you dont have Windows Vista drivers for all your hardware, it is a good idea to download all the drivers from the hardware manufacturers website and save all the necessary drivers on a CD-R before you start the installation.


Windows Vista DVD is bootable. In order to boot from the DVD you need to set the boot sequence. Look for the boot sequence under your BIOS setup and make sure that the first boot device is set to CD-ROM/DVD-ROM.


Step 1 - Place Windows Vista DVD in your dvd-rom drive and start your PC. Windows Vista will start to boot up and you will get the following progress bar.


Windows Vista pic1 - Click to enlarge


Step 2 - The next screen allows you to setup your language, time and currency format, keyboard or input method. Choose your required settings and click next to continue.


Windows Vista pic2 - Click to enlarge


Step 3 - The next screen allows you to install or repair Windows Vista. Since we are doing a fresh install we will click on "install now".


Windows Vista pic3 - Click to enlarge


Step 4 - You can now type the product key that came with your Windows vista.


Windows Vista pic4 - Click to enlarge


Step 5 - If you do not enter the product key you can still proceed with the installation in which case Windows will ask you which version of Vista you have purchased. Windows Vista Home Basic, Home Premium, Ultimate, Business etc. Select the version you have purchased and click next.


Please note, although you can select any version of Windows and proceed to next stage. It is not good idea to select a different version to the one you have purchased becuase you will not be able to activate Windows at a later stage. Windows Vista can detect which version you have purchased once you enter your product key.


Windows Vista pic5 - Click to enlarge


Step 6 - Tick "I accept the licence terms" and press next.


Windows Vista pic6 - Click to enlarge


Next - How to install Windows Vista Page 2









Step 7 - Choose the type of installation you want to perform. You will notice that upgrade option is disabled as we have booted from the DVD-R. Therefore we can only select Custom (advanced) option which basicly installs a clean copy of Windows from scratch.


Windows Vista pic7 - Click to enlarge



Step 8 - Choose where you would like to install Windows Vista. If you have a new upartitioned hard drive you would get your hard drive listed as shown on the image below. If have have an old hard drive with data or other partitions it will show up as logical drives. You can select the drive options (advaced) to format, delete, or create new partions. Because I am using a single new hard drive i will select next to continue. Windows will create a partition and format it using NTFS files system.


Windows Vista pic8 - Click to enlarge


Step 9 - Windows starts the installation process and starts copying all the necessary files to your hard drive as shown on the image below. It will go through various stages of the setup and will reboot your system few times. When your PC reboots it attempts to boot from CD as its the first boot device. Do not press any key during the boot prompt so Windows Vista will continue with the installation by booting from your hard drive.


Windows Vista pic9 - Click to enlarge



Step 10 - After installation copy process is complete you are presented with the Setup Windows dialogue box as show below. At this stage you need to choose a user name, password and a picture for your user account. The account you create here is the Administrator account which is the main account for your Windows Vista that has all the privilages. Click next continue.


Windows Vista pic10 - Click to enlarge



Step 11 - Now you need to choose your computer name and desktop background. Click next to continue.


Windows Vista pic11 - Click to enlarge



Step 12 - Choose wether your want to Help protect Windows automatically. Select "Use recommened settings" to continue.


Windows Vista pic12 - Click to enlarge



Step 13 - Review your time and date settings. Select your time zone, correct the date and time and click next to continue.


Windows Vista pic13 - Click to enlarge


Next screen presents you to select your computers current location. You can choose between home, work, public location. Choose home to continue. You will finally get a "Thank you" screen which confirms the end of the interactive installation process. This is not the end of the setup process. There are still many after installation configuration to be done. Click next to continue.



Next - How to install Windows Vista Page 3







Step 14 - Windows now runs a benchmark type of application which checks the performance of your system. You will see a status bar at bottom which shows the progress. Once the process is complete you will be presented with the logon screen.


Windows Vista pic14 - Click to enlarge



Step 15 - Finally you have the logon screen. Just type your password and press enter or click on the arrow to logon to Windows Vista for the first time.


Windows Vista pic15 - Click to enlarge



Step 16 - Soon as you logon you will be presented with welcome centre. You can use the welcome centre to configure, customise, and update Windows vista.


Windows Vista pic16 - Click to enlarge



Step 17 - Finally you need to check if all your hardware has been detected correctly. You can do so by checking your device manager. To access device manager click Start menu -> Control panel -> System -> Device manager. You will see all your hardware listed as shown below. You need to check if you have any yellow exclamtion marks next to the name of the device similar to "USB 10/100 LAN" on image below. This indicates the driver has not been installed for this device.


At this stage you need to install Windows Vista drivers by double clicking on "USB 10/100 LAN" or your device. The properties dialog box will appear. Click on Reinstall Driver. Then you can choose wether you want to install the driver from the internet (if available) or install manually from a CD or other media


Once you have removed all the yellow exclamtion marks from the device manager your Windows Vista configuration would be fully complete.


Windows Vista pic17 - Click to enlarge


Return to Home Page

1. Example of Resource Allocation Graph


Explanation:

· The Resource Allocation Graph (RAG) above is composed of 3 processes and four resources.
· R1 or resource 1 is composed of only one instance
· R2 has 2 instances
· R3 has one instance
· R4 has 3 instances
· P1 requests instance of R1
· P2 is holding an instance of R1
· P2 requests instance of R3
· P3 holds an instance of R3
· There is no deadlock found




2. Example of Resource Allocation Graph


Explanation:

· The Resource Allocation Graph (RAG) above is composed of 3 processes and four resources.
· R1 or resource 1 is composed of only one instance
· R2 has 2 instances
· R3 has one instance
· R4 has 3 instances
· P1 requests instance of R1
· P2 is holding an instance of R1
· P2 requests instance of R3
· P3 holds an instance of R3
· P3 requests an instance of R1
· There is deadlock based of the RAG no. 2 because all of the instances of R2 are held by the P1 and P2, then P3 is requesting for instances of R2. R2 cannot give any instances to P3 that is why a deadlock occurred.




3. Example of Resource Allocation Graph



Explanation:

· The Resource Allocation Graph (RAG) above is composed of4 processes and 2 resources.
· R1 and R2 has composed of 2 instances
· P1 requests instance of R1
· P2 is holding an instance of R1
· P3 also holds an instance of R1
· P3 requests an instance of R2
· P4 holds an instance of R2
· P1 also holds an instance of R2
· There is no deadlock.

4. Example of Resource Allocation Graph


Explanation:

· The Resource Allocation Graph (RAG) above is composed of 2 processes and 2 resources.
· P1 holds an instance of R1
· P2 requests an instance of R1
· P1 and P2 may request an instance of R2


5. Example of Resource Allocation Graph


Explanation:

· The RAG above is compose of 2 resources and 2 processes
· P1 holds an instance of R1
· P2 is requesting an instance of R1
· P2 holds an instance of R2
· P1 may request an instance of R2

A set of vertices V and a set of edges E.

· V is partitioned into two types:
» P = {P1, P2, …, Pn}, the set consisting of all the processes in the system.
» R = {R1, R2, …, Rm}, the set consisting of all resource types in the system.
· Request Edge – directed edge P1 -> Rj
· Assignment Edge – directed edge Rj -> Pi


RESOURCE ALLOCATION GRAPH

· Process

· Resource Type With 4 Instances

· Pi request instance of Rj

· Pi holding an instance of Rj


How Would You Know If There's a Deadlock Based on the Resource Allocation Graph?
·If graph contains no cycles - no deadlock.
·If graph contains a cycle :
» if only one instance per resource type, then deadlock.
» if several instances per resource type, possibility of deadlock.





Recovery from Deadlock Recovery from Deadlock

„ Process Termination:
· Abort all deadlocked processes.
· Abort one process at a time until the deadlock cycle is eliminated.
· In which order should we choose to abort?
 - Priority of the process.
 - How long process has computed, and how much longer to completion.
 - Resources the process has used.
 - Resources process needs to complete.
 - How many processes will need to be terminated.
 - Is process interactive or batch?

„ Resource Preemption

· Selecting a victim – minimize cost.
· Rollback – return to some safe state, restart process for that state.
· Starvation – same process may always be picked as victim, include
number of rollback in cost factor.

Deadlock Detection: allow the system to enter a deadlock
state and then recover.
· Requires deadlock detection algorithm
· Technique for forcibly preempting resources and/or terminating tasks

„
1. ) ALLOW SYSTEM TO ENTER DEADLOCK STATE


2. ) DETECTION ALGORITHM
1. Let Work and Finish be vectors of length m and n, respectively
Initialize:
(a) Work = Available
(b) For i = 1,2, …, n, if Allocationi ≠ 0,then
Finish[i] = false;otherwise, Finish[i] = true.
2. Find an index i such that both:
(a) Finish[i] == false
(b) Requesti
≤ Work
If no such i exists, go to step 4.
3. Work = Work + Allocationi
Finish[i] = true
go to step 2.
4. If Finish[i] == false, for some i, 1 ≤ i ≤ n, then the system is in deadlock
state. Moreover, if Finish[i] == false, then Pi
is deadlocked.
Algorithm requires an order of O(m x n2) operations to detect whether
the system is in deadlocked state.

3.) RECOVERY SCHEME




Deadlock Prevention Deadlock Prevention


„ - Mutual Exclusion – not required for sharable resources; must hold for nonsharable
resources.

„ - Hold and Wait – must guarantee that whenever a process requests a resource, it
does not hold any other resources.

· Require process to request and be allocated all its resources before it begins
execution, or allow process to request resources only when the process has
none.
· Low resource utilization; starvation possible
„
- No Preemption –
· If a process that is holding some resources requests another resource that
cannot be immediately allocated to it, then all resources currently being held
are released.
· Preempted resources are added to the list of resources for which the process is
waiting.
· Process will be restarted only when it can regain its old resources, as well as
the new ones that it is requesting.

- „Circular Wait – impose a total ordering of all resource types, and require that each
process requests resources in an increasing order of enumeration.
Restrain the ways that request can be made.

Methods for Handling Deadlocks Methods for Handling Deadlocks

- „Deadlock Prevention: ensure that the system will never enter
a deadlock state – expensive operations
· Need to monitor all lock acquisitions
· Selectively deny those that might lead to deadlock

- „Deadlock Detection: allow the system to enter a deadlock
state and then recover.
· Requires deadlock detection algorithm
· Technique for forcibly preempting resources and/or terminating tasks
„
- Ignore the problem and pretend that deadlocks never occur
in the system
· Used by most operating systems, including UNIX

FEEDS

Add to Google Reader or Homepage

Click2Sell

Buy

How To Learn Photoshop in Just 2 Hrs

Chatbox

Click Here

About this blog