Thursday, December 29, 2011
Alpinestars Shirts
1 comments Posted by Saurav at 2:02 PM
Friday, November 25, 2011
VmWare
0 comments Posted by Saurav at 3:21 AM
Tuesday, September 27, 2011
London Olympics
As all we very well know about the last Olympics and its grand success that was held in China. In 2012 olympics are going to be held in London. People from all over the world had already started planning their leaves so that they can come to London and enjoy the grand Olympics here. Bookings had been already started in all the major hotels for these Olympics. If you are also planning for the London Olympics and want to be a part of it , then you have to also start planning for it. If you are worried about the accommodation and the food facilities at that time, then there are lot of places available in London that provides you ideal accommodation facility and self catering service.
Holiday Rentals is one of the place where you can find best London apartments on rental at a very affordable price. In addition to this they also provide you self catering facility where you can cook whatever you want,as per your taste. You have no need to depend on others like in major hotels where you are forced to have whatever is available at these hotels. Now a days these rental apartments are commonly known as Olympic Park Rentals as they are directly or indirectly linked to London Olympics.
0 comments Posted by Saurav at 6:51 AM
Labels: Reviews
Saturday, August 27, 2011
Deadlock in Operating Systems
For example, a system may have two printers. These two printers may be defined to be in the same resource class if no one cares which printer prints which output.
However, if one printer is on the ninth floor and the other is in the basement, then people on the ninth floor may not see both printers as equivalent, and separate resource classes may need to be defined for each printer.A process must request a resource before using it and must release the resource after using it. A process may request as many resources as it requires to carry out its designated task. Obviously, the number of resources requested may not exceed the total number of resources available in the system. In other words, a process cannot request three printers if the system has only two.
0 comments Posted by Saurav at 4:40 AM
Labels: Deadlock, Operating Systems
Friday, August 12, 2011
Class Path Vs Build Path
This topic is liitle bit off to the operating system concepts but still I want to share it ;)
The classpath is the classic way to tell the Java compiler and the Java runtime where to find compiled classes. It is typically a sequence of JAR file names and directory names. The classpath used by the compiler and the runtime system don't have to be the same, but they typically "should be*, especially for a small project.
Buildpath is not classic Java terminology. It is the term for the richer way that a typical IDE specifies the relationship between the "modules" or "projects" that make up an application. The IDE uses this to figure out the classpath and sourcepath for compiling the Java code, and the classpath for running it. The IDE also uses the build path to figure out how to package up your code and its dependencies as (for example) a WAR file.
For example, an Eclipse build path for a project includes the other projects that it depends on, and lists any additional library JARs that the project contains / relies on. It also lists the packages in the current project that downstream projects can depend on.
(If you are using Maven for your project, the IDE buildpath mechanism is secondary to the dependencies declared in the POM files. For example, using Eclipse with the m2eclipse, the buildpath is synthesized from the POM files.)
0 comments Posted by Saurav at 8:29 AM
Labels: Java
Wednesday, August 3, 2011
Virtual Machines
), an operating system can create the illusion that a process has its own processor with its own (virtual) memory.
Normally, a process has additional features, such as system calls and a file system, that are not provided by the bare hardware. The virtual-machine approach does not provide any such additional functionality but rather provides an interface that is identical to the underlying bare hardware. Each process is provided with a (virtual) copy of the underlying computer. There are several reasons for creating a virtual machine, all of which are fundamentally related to being able to share the same hardware yet run several different execution environments (that is, different operating systems) concurrently.
0 comments Posted by Saurav at 9:21 AM
Labels: Virtual Machines
Friday, July 29, 2011
Paging
Paging is another memory management technique which widely uses virtual memory concept. When paging is used, the processor divides the linear address space into fixed-size pages (of 4KBytes, 2 MBytes, or 4 MBytes in length) that can be mapped into physical memory and/or disk storage. When a program (or task) references a logical address in memory, the processor translates the address into a linear address and then uses its paging mechanism to translate the linear address into a corresponding physical address.
Some physical memory is reserved for the operating system itself, and for its data structures. This is called wired memory, because it is not subject to paging. The rest of physical memory is managed via the paging mechanism, and is called the page pool. Whenever a virtual memory page that is not in physical memory is referenced, a page is allocated from the page pool’s free list and mapped to the required virtual memory address. Pages are returned to the free list when the memory has been unmapped or freed. Pages can be reclaimed from the free list if they are referenced again before the physical memory page has been reused.
0 comments Posted by Saurav at 10:15 AM
Labels: Paging
Tuesday, July 26, 2011
Round Robin Scheduling
Round robin is the scheduling term which is being used for the purpose of algorithms which is mainly used for the purpose of operating systems. This system had mainly been used in order to handle out the processes which are incurred in the operating system which means that the time that is being taken for the opening of the program and then as a result the user is being shown with the process chart which is being drawn. The entire process is being done in equal portions where each and every item is being taken into account.
On the other hand a process schedule had been defined for the round robin scheduling system. This form is adopted in that case when the jobs or certain other tasks are to be performed. The round robin schedule is one of the easiest and simplest forms of doing the work and hence it can be carried out and implemented easily. The data is also being used in the round robin scheduling which means that in such a situation the user have to bear the data packet scheduling process. It had been found out that first come first serve basis is one of the alternative which can be used in the form of the round robin scheduling. This is one of that forms of scheduling which can be applied to other forms of scheduling as well and at time it is also used for the purpose of handling the problems too.
It is also used in the computation of the computer networks which is found to be quite helpful in the data packet scheduling process. The entire process of round robin scheduling generates about minimum and maximum of the results and it is referred to as the min-max fairness which means that each and everything is to be carried out on equal basis
0 comments Posted by Saurav at 5:31 AM
Labels: Scheduler, Scheduling Algo
Saturday, July 23, 2011
All about Semaphores
Types:
Counting semaphores are used when you might have multiple devices (like 3 printers or multiple memory buffers).
Binary semaphores are used to gain exclusive access to a single resource (like the serial port, a non-reentrant library routine, or a hard disk drive). A counting semaphore that has a maximum value of 1 is equivalent to a binary semaphore (because the semaphore's value can only be 0 or 1.
Mutex semaphores are optimized for use in controlling mutually exclusive access to a resource. There are several implementations of this type of semaphore.
Implementation:
Semaphores can be implemented with a queue and an integer counter. You maintain the set of consumers in the queue, and when a consumer releases the semaphore, you retrieve the next entry in the queue and "wake" them to allow them to enter the critical section. When a consumer requests the semaphore, you simply push them onto the queue. If no one is in the critical section, you go ahead and grant the requester the right to enter the critical section.
0 comments Posted by Saurav at 4:06 AM
Labels: Interaction with Operating System, Operating Systems, Semaphores
Thursday, July 21, 2011
Real Time Operating System
RTOS system captures the real time events and brings out the results which may slightly differ from the reality. It’s processing and computation totally depends on the way it is programmed. RTOS can be judged as how quickly it performs the operation and how accurate the results are. Most important factors which increase the working of this system are low interrupt latency and a low thread switching latency.
The real time operating system is designed keeping in mind every aspect in mind of real life. This operating system is designed on two basic principles. First design pattern is that it should focus on event-driven programming so that tasks can process depending upon their scheduling priorities. Second design refers to time sharing feature so to process tasks on the basis of clock interrupts.
In RTOS allocation of memory is the most critical task. Two elements are of significant importance in case of memory allocation. First one is speed and second is the fragmentation of free region during the memory allocation process.
1 comments Posted by Saurav at 4:59 AM
Labels: Interaction with Operating System, Operating Systems, Real Time OS
Tuesday, July 19, 2011
Golf terms
The above site explains you all the details about the game. They are one of the largest German golf shops with a full range of all brand names. You can also visit Golfkurse it will be useful for you.
The idea behind it is that you answer a few questions about golf rules and then play a few holes of golf with your instructor. As long as you do not kill too many people whilst playing then you get your 54 handicap... Seriously.. 54 handicap. Basically a 54 handicap means you cannot actually play golf at all and should not really be allowed on a half-decent golf course... But everybody must start somewhere I suppose.....
0 comments Posted by Saurav at 12:05 PM
Monday, July 18, 2011
Demand Paging
A typical life cycle of a process is as follows:
1. When a process is initiated, the operating system must at least load one page in real memory. It is the page containing the execution part of the process.
2. Execution of the process commences and proceeds through subsequent instructions beyond the starting point.
3. This execution continues as long as memory references generated by this page are also within same page. The virtual address created may reference a page that is not in real memory. This is called a page fault. It generates an interrupt that asks for the referenced page to be loaded. This is called demanding page.
4. The operating system will try to load the referenced page into a free real memory frame. When this is achieved the execution can continue.
5. Finally when the process terminates, the operating system releases all the pages belonging to the process. The pages become available to other processes.
In general, the operating system accommodates the new page by removing a currently loaded page that is not in use. This is called page replacement. It is important to remove a page that will not be accessed in a short time. It will reduce the number of page faults in the system.
0 comments Posted by Saurav at 12:38 PM
Labels: Paging
Thursday, July 14, 2011
Ideal Place for Golf Club House
As in my previous posts i already discussed about the golf,rules,its history and etc.
Yesterday I was visiting some golf club house locations and in those the one that i really found interesting is Whisper Rock Golf Course Homes.They provides you such a wonderful location in Scottsdale area that is ideal for any golf course home.
The whisper rock golf club scottsdale attempts to demonstrate that a conventional commercial building system can be transfigured into a design solution that recalls a traditional lineage, that of the traditions of the game of golf, while simultaneously transcending traditional responses by commenting on the present. When the owner and originator of the golf facilities first asked us to take part in the design competition for the club I was hesitant, not being a golfer or knowing much about golf. His response was simply “its not just about golf, its about people and space!” As the finished clubhouse comes alive each day with activity and the passing of time, I am reminded that no matter the building type, scope, or size, in the words of Rudolf Schindler, “the perception of architecture is not in the eyes, but in the living.”
If you have any doubt or queries regarding buying or selling the club house in the space you can always contact to Holm Group that will help you in exploring more.
0 comments Posted by Saurav at 10:11 PM
Labels: Reviews
Multiprocessor thread scheduling strategies
Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.
Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.
Dynamic scheduling: The number of thread in a program can be altered during the course of execution.
0 comments Posted by Saurav at 10:06 AM
Labels: Technical Terms, Threads
Wednesday, July 13, 2011
Short,Medium and Long term scheduler
For more details , please visit here and here.
Medium term scheduling is part of the swapping function. This relates to processes that are in a blocked or suspended state. They are swapped out of real-memory until they are ready to execute. The swapping-in decision is based on memory-management criteria.
Short term scheduler, also know as a dispatcher executes most frequently, and makes the finest-grained decision of which process should execute next. This scheduler is invoked whenever an event occurs. It may lead to interruption of one process by preemption.
For more details , please visit here and here.
0 comments Posted by Saurav at 6:16 AM
Labels: Scheduler
Tuesday, July 12, 2011
OS-9
OS-9 is modular, allowing new devices to be added to the system simply by writing new device drivers, or if a similar device already exists, by simply creating a new device descriptor. All I/O devices can be treated as files, which unifies the I/O system. In addition, the kernel and all user programs are ROMable. Thus, OS-9 can run on any supported hardware platform from simple diskless embedded control systems to large multiuser minicomputers.
Originally developed for the 6809 microprocessor, OS-9 was a joint effort between Microware and Motorola. The original version of OS-9 (OS-9 Level I) was capable of addressing 64 kilobytes of memory. OS-9 Level II took advantage of dynamic address translation hardware, and allowed a mapped address space of one megabyte on most systems, and up to two megabytes on others, most notably the Tandy Color Computer 3.
In the 1980's, Microware ported OS-9 to the 68000 family of microprocessors, creating OS-9/68000, which is used in a variety of industrial and commercial arenas, including Philips' CD-i and most recently, set-top boxes for interactive television.
0 comments Posted by Saurav at 2:27 AM
Labels: Operating Systems, OS-9
Monday, July 11, 2011
Error in Loading Operating System
What causes this error?
You can expect to see the Error Loading Operating System error when there is an issue with the way the BIOS and the Windows XP operating system are communicating with each other. Most commonly, the BIOS has an issue where it does not support or has no way to correctly manage the capacity of the hard drive that Windows XP was installed to.
How can I resolve this error?
The Error Loading Operating System problem can be solved in a variety of different ways. However, it is important that you have some knowledge of computers before you proceed with any of the suggested solutions to this error message. Not knowing exactly what you are doing, or failing to follow the directions you see on your screen could result in the corruption or destruction of your computer. Changing or flashing your BIOS can have detrimental effects on your computer and should only be performed if you are completely sure you know what you are getting into.
Your first step to resolve the Error Loading Operating System issue should be to update your computer’s BIOS. Check your computer’s manual for information on how to do this or call the company which constructed your computer. Alternatively, if you built your computer yourself, consult the manual which came with your motherboard.
Once you are sure that your BIOS has been upgraded to its most recent version, determine which type of BIOS you are using. Each BIOS is somewhat different, and newer versions of popular BIOSes tend to change the locations of different functions and features, so consult your computer vendor, your motherboard manual, or a tech support forum for the most up to date information on how to make sure that your hard drives are interfacing properly with your BIOS.
5 comments Posted by Saurav at 6:51 AM
Labels: Error, Operating Systems