Intellectual Property Rights

What is Intellectual Property?

According to Merriam Webster says "intellectual property: property (as an idea, invention, or process) that derives from the work of the mind or intellect: an application, right, or registration relating to this."

The intellectual property rights definition gives the creator or holder exclusive rights to the intellectual property for varying lengths of time, depending upon the type of intellectual property.

In the United States, Intellectual Property rights are overseen by the United States Patent and Trademark Office, and the United States Copyright Office.

Worldwide, the officiating body is the World Intellectual Property Organization, for all those countries participating.

Intellectual property is property of the mind, according to WIPO, World Intellectual Property Organization and they say:

Intellectual property is divided into two categories: Industrial property, which includes inventions (patents), trademarks, industrial designs, and geographic indications of source; and Copyright, which includes literary and artistic works such as novels, poems and plays, films, musical works, artistic works such as drawings, paintings, photographs and sculptures, and architectural designs. Rights related to copyright include those of performing artists in their performances, producers of phonograms in their recordings, and those of broadcasters in their radio and television programs.

Again quoting WIPO, "intellectual property shall include rights relating to:

• literary, artistic and scientific works,
• performances of performing artists, phonograms and broadcasts,
• inventions in all fields of human endeavor,
• scientific discoveries,
• industrial designs,
• trademarks, service marks and commercial names and designations,
• protection against unfair competition"

The four legally protected categories of IP are:

• Patents
  
  Inventions has to be registered with the government and these are called patents. A patent registration process can take more than one year, and if it is granted, the inventor gains the legal right to exclude anyone else from manufacturing or marketing it. Patents cover tangible and intangible things. Today it is prudent to register patents in foreign countries also. This will help prevent international competitors from infringing on patent in other countries. Patents have a definite life span. Once it is registered, the legal protection for a patent lasts for only 20 years. After which the patent becomes a public property.
• Trademarks
  
  A trademark is a name, phrase, sound or symbol used in association with services or products. It often connects a brand with a level of quality on which companies build a reputation. Trademark protection lasts for 10 years after registration and, like patents, can be renewed. But trademarks don't have to be registered. If a company creates a symbol or name it wishes to use exclusively, it can simply attach the TM symbol. This effectively marks the territory and gives the company room to prosecute if other companies attempt to use the same symbol for their own purposes.
• Copyrights
  
  Copyright laws protect written or artistic expressions fixed in a tangible medium - novels, poems, songs or movies. A copyright protects the expression of an idea, but not the idea itself. The owner of a copyrighted work has the right to reproduce it, to make derivative works from it (such as a movie based on a book), or to sell, perform or display the work to the public. You don't need to register your material to hold a copyright, but registration is a prerequisite if you decide to sue for copyright infringement. A copyright lasts for the life of the author plus another 50 years.
• Trade secrets
  
  A formula, pattern, device or compilation of data that grants the user an advantage over competitors is a trade secret. It is covered by state, rather than federal, law. To protect the secret, a business must prove that it adds value to the company - that it is, in fact, a secret - and that appropriate measures have been taken within the company to safeguard the secret, such as restricting knowledge to a select handful of executives. Coca-Cola, for example, has managed to keep its formula under wraps for more than 117 years.

Reference:

http://arunkottolli.blogspot.com/2006/10/types-of-intellectual-property.html

Give an example for each seven cases of deadlocks

Case 1: Deadlocks on File Request

- If jobs can request and hold files for duration of their execution, deadlock can occur.Any other programs that require F1 or F2 are put on hold as long as this situation continues. Deadlock remains until a programs is withdrawn or forcibly removed and its file is released.

example:

Case 2: Deadlocks in Database

-Deadlock can occur if 2 processes access & lock records in database.

Three different levels of locking entire database for duration of request
a subsection of the database individual record until process is completed.  

If don’t use locks, can lead to a race condition.

Example:

1. P1 accesses R1 and locks it

2. P2 accesses R2 and locks it.

3. P1 requests R2, which is locked by P2.

4. P2 requests R1, which is locked by P1.

Case 3: Deadlocks in Dedicated Device Allocation

-Deadlock can occur when there is a limited number of dedicated devices.

E.g., printers, plotters or tape drives.

Example:

P1 requests tape drive 1 and gets it.

P2 requests tape drive 2 and gets it.

P1 requests tape drive 2 but is blocked.

P2 requests tape drive 1 but is blocked.



Case 4. Deadlocks in Multiple Device Allocation

-Deadlocks can happen when several processes request, and hold on to, dedicated devices while other processes act in a similar manner.

Example:

Case 5: Deadlocks in Spooling

-Most systems have transformed dedicated devices such as a printer into a sharable device by installing a high-speed device, a disk, between it and the CPU. Disk accepts output from several users and acts as a temporary storage area for all output until printer is ready to accept it (spooling).

Example:

If printer needs all of a job's output before it will begin printing, but spooling system fills available disk space with only partially completed output, then a deadlock can occur.

Case 6: Deadlocks in Network

-a network that's congested or has filled a large percentage of it's I/O buffer space can become deadlocked if it doesn't have protocols to control the flow of messages through the network.

Example:

Case 7: Deadlocks in Disk Sharing

-Disks are designed to be shared, so it’s not uncommon for 2 processes access different areas of same disk. Without controls to regulate use of disk drive, competing processes could send conflicting commands and deadlock the system.

Example:

  

Give an example for each seven cases of deadlocks

Case 1: Deadlocks on File Request

Aiza S. Cabrera                                                                                               January 9, 2010

BSIT-3

I. Concept Questions

1. Name the five key concepts about an operating system that you think a user needs to know and understands.

Answer:

1.1 User Command Interface

This is the interface from which the user issues commands to the operating system. Also called the “shell” (container inside which the entire user interface is presented), this is the visible interface with which users interact. For most users, the User Interface is the operating system.

1.2 Device Manager

This component monitors all devices, channels, and control units. The Device Manager must select the most efficient method for allocation of a system’s devices, printers, terminals, disk drives, and other hardware. This is based on a pre-determined scheduling policy, and the Device Manager makes allocations, starts operations, and ultimately deallocates devices.

1.3 Processor Manager

This component is responsible for allocating the central processing unit (CPU). The status of each process must be tracked, and the Processor Manager handles matters such as process prioritization and multithreading. The tasks of the Processor Manager can be divided into two main categories: accepting or rejecting incoming jobs (handled by the Job Scheduler) and determining which process is given access to the CPU and for how long (handled by the Process Scheduler).

1.4 Memory Manager

This component controls main memory. It evaluates the validity of each memory request, and allocates memory space (as needed and available). For multi-user systems, the Memory Manager maintains a log of what memory resources are in use by which users. When items stored in main memory are no longer needed, the Memory Manager handles memory deallocation.

1.5 File Manager

This component tracks every file in the system. These files include data files, assemblers, compilers, and applications. The File Manager can use predetermined access policies to enforce restrictions on file access. It also handles all other file permissions. The File Manager allocates file resources by opening a particular file and deallocates resources by closing the file.

 

 

3. Explain the following:

            a. Internal Fragmentation. How does it occur?

Internal fragmentation occurs when storage is allocated without ever intending to use it. This space is wasted. While this seems foolish, it is often accepted in return for increased efficiency or simplicity. The term "internal" refers to the fact that the unusable storage is inside the allocated region but is not being used.

            b. External Fragmentation. How does it occur?

External fragmentation is the phenomenon in which free storage becomes divided into many small pieces over time. It is a weakness of certain storage allocation algorithms, occurring when an application allocates and deallocates ("frees") regions of storage of varying sizes, and the allocation algorithm responds by leaving the allocated and deallocated regions interspersed. The result is that although free storage is available, it is effectively unusable because it is divided into pieces that are too small to satisfy the demands of the application. The term "external" refers to the fact that the unusable storage is outside the allocated regions.

            c. Compaction. Why is it needed?

 

4. Cache Memory how it works?

Answer:

A CPU cache is a cache used by the central processing unit of a computer to reduce the average time to access memory. The cache is a smaller, faster memory which stores copies of the data from the most frequently used main memory locations. As long as most memory accesses are cached memory locations, the average latency of memory accesses will be closer to the cache latency than to the latency of main memory.

When the processor needs to read from or write to a location in main memory, it first checks whether a copy of that data is in the cache. If so, the processor immediately reads from or writes to the cache, which is much faster than reading from or writing to main memory.

5. Which is the fastest cache’s L1, L2, L3? Why?

Answer:

L1 cache is the fastest among the three because it has a capacity between 4 to 16 kilobytes and accessing speeds of 10 nanoseconds, while the L2 cache can reach sizes of 512 kilobytes and a speed of only 20 to 30 nanoseconds.

II. Memory Utilization Problem

1.      Given the following information:

Table 1A

Job Number	Memory Requested
J1	700KB
J2	500KB
J3	740KB
J4	850KB
J5	610KB

 

a. Use the best-fit algorithm to allocate the memory blocks to the five arriving jobs.

Memory Block	Memory size	Job number	Job size	Status	Internal Fragmentation
1132	700	J1	700KB	Busy	0
1003	720	J5	610KB	Busy	110
1114	800	J3	740KB	Busy	60
2310	750	-	-	Free
1755	610	J2	500KB	Busy	110

 

 

b.      Use the first-fit algorithm to allocate the memory blocks to the five arriving jobs.

Memory Block	Memory size	Job number	Job size	Status	Internal Fragmentation
1132	700	J1	700	Busy	0
1003	720	J2	500	Busy	220
1114	800	J3	740	Busy	60
2310	750	J5	610	Busy	140
1755	610	-	-	Free

 

c.       Use the next-fit algorithm to allocate the memory blocks to the five arriving jobs.

Memory Block	Memory size	Job number	Job size	Status	Internal Fragmentation
1132	700	-	-	Free
1003	720	J5	610	Busy	110
1114	800	J3	740	Busy	60
2310	750	J1	700	Busy	50
1755	610	J2	500	Busy

 

d.      Use the worst-fit algorithm to allocate the memory blocks to the five arriving jobs.

Memory Block	Memory size	Job number	Job size	Status	Internal Fragmentation
1132	700	-	-	Free
1003	720	J5	610	Busy	110
1114	800	J1	700	Busy	100
2310	750	J2	500	Busy	250
1755	610	-	-	Free

 

 

 

2.      Given the following information:

Table 2A

Job Number	Memory Requested
J1	30KB
J2	50KB
J3	30KB
J4	25KB
J5	35KB

 

Table 2B

ORIGINAL STATE OF MAIN MEMORY

100KB(P1)

25KB(P2)

25KB(P3)

50KB(P4)

30KB(P5)

 

 

 

 

 

 

a. Create a memory layout for the fixed partition after job entry based on the given information (Table 2A and Table B)

 

J1 30KB                                   

J2 50KB

J3 30KB

J4 25KB

J5 35KB

ORIGINAL STATE

100KB

25KB

25KB

50KB

30KB

 

 

 

 

 

 

 

Job After Entry

J1 30KB

J4 25KB

J2 50KB

J3 30KB

 

 

 

 

 

P1

 

P2

P3

 

P4

 

 

P5

 

 

 

b. Before Job 6 (30KB) and Job 7 (45KB) arrives, there are three jobs done already for processing which J2,J3,J4. Create an initial memory layout for the dynamic partition based on the given information (Table 2A)

 

 

J1 30KB                                   

J2 50KB

J3 30KB

J4 25KB

J5 35KB

ORIGINAL STATE

100KB

25KB

25KB

50KB

30KB

 

 

 

 

 

 

 

Job After Entry

J1 30KB

 

 

 

 

 

P1

 

P2

P3

 

P4

 

 

P5

 

J2,J3,J4 are already done

OS

J1 30KB

J7 45KB

J6 30KB

 

 

 

   P1

 

 

P2

P3

 

 

   P4

 

  P5
 

J6 and 7 arrives

 

 

3. Illustrate and find the page number with the displacement of a given program line:

Job1 is 1600 lines long

PS=200 and LNTBL=542.

Answer:

 

LNTBL divided by PS and the result is the Page Number and the remainder is the displacement

 

542 ÷ 200=2 the remainder is 142

Therefore the displacement is 142

                       

                       

                        ­­­

 

2. List three tangible (physical) resources of a computer system and explain how it works.

Answer:

2.1  IRQ

Short for Interrupt request, IRQ is a signal that has a direct line to the computer processor, allowing it to stop the processor momentarily and decide what to do next. Every IBM compatible computer has a maximum of 15 IRQs and are prioritized in the computer according to the importance of the device. See IRQ Listing for a list of IRQs,which may be available or are currently used.

2.2  I/O

Input Output (I/O) represents the locations in memory that are designated by use of various devices to exchange information amongst themselves and the rest of the PC. See IRQ Listing for a list of IRQs and I/O ranges.

2.3  DMA

DMA, or Direct Memory Access, are pathways provided by the hardware to allow the hardware direct access to the computer's memory. See DMA Listing for listing of DMA channels.