Execution of Romanov family did anyone survive Essay Example

Execution of Romanov family: did anyone survive? Essay President Boris Yeltsin â€Å"We must tell the truththe massacre has become one of the most shameful pages of our history[1].† The execution of the Romanovs is the most tarnished assassination in the modern days of history. The execution of this ruling family of Russia had stimulated myths and legends that still remained unanswered to the last few years. The last of the Romanov emperor, Tsar Nicholas II was one of the most wealthiest and powerful rulers of the world. He controlled Russia with an iron fist. Greg King, author of The Fate of The Romanovs explains: Until the revolution, the Tsar was considered the anointed of God. He controlled the government, was the supreme head of the Orthodox Church, he was worshipped as a demigod by most of his subjects and his word was considered law in every aspect of life[2]. The Romanovs controlled the Russia from 1613 to 1917. They had helped Russia grow into a might superpower and to expand its boundaries. Thesis: The research paper is to analyze the execution of the royal family of the Romanovs and to examine the facts about any survivors of the family that night. The paper will critically study the different views of the people, the leading facts and the different reports and finally conclude whether there were any survivors or not. Execution of the Romanovs: We will write a custom essay sample on Execution of Romanov family: did anyone survive? specifically for you for only $16.38 $13.9/page Order now We will write a custom essay sample on Execution of Romanov family: did anyone survive? specifically for you FOR ONLY $16.38 $13.9/page Hire Writer We will write a custom essay sample on Execution of Romanov family: did anyone survive? specifically for you FOR ONLY $16.38 $13.9/page Hire Writer The power of one of the strongest Tsar in Russia, Nicholas II, ended abruptly in March 1917 due to the escalating pressure of the World War I and the rising injustice in the last few years. Tsar Nicholas II had developed a bad reputation over the last few years. In 1905, his soldiers on his command killed many of the factory workers who were on a strike and were marching towards the capital. This enraged the people of Russia and they were ready to overthrow his monarchy. Soon, his rule was replaced by the Provincial Government which supported the continuation of the war. But persistent losses at the hands of the German forces increase the fears of the Russian people and hence destabilized the rule of the Provincial Government. At that very moment, the German sent Vladimir Lenin secretly into Russia to further destabilize it. This was realized on the night of the November 6-7 when Lenin along with some other forces took over the capital. This led to the brutal civil war because these Bolshevik forces had taken up the arms to overthrow the communist regime. Soon, the treaty followed between the communist regime and the Germans which marked the end of war for the Russians (The Execution of Tsar Nicholas II, 1918, 2005). This treaty was known as the Treaty of Brest-Litovsk signed on 3rd March 1918 (The Treaty of Brest-Litovsk: March 3rd, 1918, 2008). During this time of the political turmoil, the royal family of the Romanovs had been kept under house arrest near the capital initially. They were then moved behind the Ural Mountains and finally settled in a small town in Yekaterinburg in the spring of 1918. There were seven members of the royal family along with some of their attendants and were made to stay in a successful merchant’s house. In mid-July, when the white army, considered to be the liberators of the Nicholas and his family, had almost reached the town was the moment when the Bolshevik captors decided to execute all the Romanovs and seal their fate (The Execution of Tsar Nicholas II, 1918, 2005) During the evening hours of July 16, Commandant Yurovsky, the head of the execution squad, had ordered the lead guardian of the Royal family to collect all the weapons from the guards and were told not to respond to any gun fires. Hence, during the early hours of July 17, the Tsar along with his family and the servants were gathered in the cellar of the house. They were Tsar Nicholas, Queen Alexandra, Princess Olga, Princess Tatiana, Princess Maria, Princess Anastasia, Tsarevich Aleksey, and the attendants. In total there were eleven members assembled for which eleven gunmen came in. Each gunman was to shoot one member of the family. But when it was the time to shoot, all the gun men shot the Tsar and then the other members (Anastasia mystery, 2007). Vladimir Lenin took the responsibility of the executions because he believed that this would eliminate any resistance that remained of the pro-monarchy government. But at the same time, he denied the murder of the German-born Tsarina and her children in order to maintain the good relations with the Germans. He claimed that they were being kept alive and their location cannot be disclosed (Anastasia mystery, 2007). Over the years people believed that Romanovs were alive and refused to believe the execution held in Serbia. People even said that the Bolsheviks, guarding the last house of the royal family had let them escape in order to keep the better ties the German forces. Others believed that the Romanovs had been exiled to Poland but to keep this hidden and a secret, they had killed the attendants and spread this story. But with time, people realized that the Romanovs had actually been executed with only one or two survivors. Looking at these rumors and the large amount of the wealth left an inheritance; many impostors materialized pretending to be various family members in order to claim the huge wealth. The case of the execution of the Romanovs was turned into an international affair by the extended family of the Romanov and monarchists and they filed for an independent enquiry. Investigator Nicholas Sokolov was made the in charge of this enquiry. After a full research, he concluded that all the members of the royal family had been executed. He said that some of the members had been stabbed as well. He even proposed that Commandant Yurovsky had planned to hide the bodies of all the members in the mineshaft in the woods. The bodies were slashed into pieces, and then burnt until nothing remained of them. Now, these findings of the judicial investigator Nicholas Sokolov led to the establishment of some myths and legends of the fact that some of the members did survive the incident but was not included in the report due to the lack of evidence. At the same time, it raised questions as how so much flesh could have just completely burned up in a few hours? (Massie, 1996) Post execution Rumors: One of the rumors that gained the importance was that some of the guards who were of the same age as the Tsar’s daughters might have developed some relationships with them. Hence, these guards could have helped these girls to escape. Princess Anastasia, the seventeen year old daughter of the Tsar, received the most attention from the world. The people believed that she was the only one who had the energy and the will to escape from the Ipatiev’s house (Anastasia mystery, 2007). Hence, even after decades of her alleged death, books and movies still tell the stories of her wonderful escape. A young woman, Anna Anderson, had attempted to commit suicide by jumping off the bridge in Berlin in 1920 was rescued and admitted to the hospital. She could not remember her identity or anything about her until her room mate identified her as one of the Romanovs and identified her as Princess Tatiana. News spread fast around the world to all the friends of the family who rushed to see her. Some believed that she was Princess Anastasia as she was not tall enough to be Tatiana. Others believed that she was an imposter who was trying to inherit the property worth billions of dollars. Some evidence did suggest that she really was the missing princess. This is because she had a royal touch to her and that she has lots of information about the Romanov family as well as the Russian courts. There was also some strong physical evidence to assume that she really was the princess. But at the same time, some evidence did also point against her. On of the Anastasia’s teacher, Sidney Gibbs , rejected the fact that she bore any resemblance to the real princess and that she was an imposter. The opponents of the Romanov family also presented a report proving that this woman was a charlatan who worked in a Polish factory. Her real name was actually Franziska Schanzowska (Anastasia mystery, 2007). She was basically a Kahubian factory worker in Poland and now moved to Russia (Godl, 1998). The court reckoned the whole case as unsolvable. The court rejected to accept her as princess Anastasia but it also declared that the opponents had not provided the court with fool proof evidence that she was not the princess (Anastasia mystery, 2007). Another worthy claim to be the descendant of the royal family came in 1961. It was the time when a Polish Colonel Michael Goleniewski claimed that he was the only son of the royal family. His claim was never supported strongly due to the fact that the Tsarevich had an incurable disease. This disease was so serious that it would have not let the prince live more that his adult life. The name of this disease was haemophilia (Pobedinskaja, 2007).     Other stories also sprang up during the course of life but they were not taken seriously as well. Decades passed to the moment of execution of the Romanov family, but still people were dazzled and needed answers. In 1978, two historians, Avdonin and Ryabov, succeeded in finding the son of Commandant Yurovsky. He gave them a top secret document that gave detailed account of the execution from Yurovsky eyes. The document said that the commandant had not burnt the bodies as claimed by the judicial investigator Sokolov but had only been disposed off in the woods. It also said that due to the trouble with the car, they had not reached the exact location as planned but had disposed off the bodies in a shallow grave in the woods only. After analyzing the contents of the secret document, Avdonin and Ryabov went to the Siberian woods in 1979 in search of the concluding graves of the royal family. After immense search for several weeks, they were able to find the graves. But since it was a period of cold war and high tension, they were afraid to reveal their findings. Therefore, they decid ed to take the skulls with them and analyze them somewhere else with the help of some forensic expert. This attempt was not successful and one year later, they returned the relics to their graves (Anastasia mystery, 2007). After the breakup of Russia in 1991, when the tensions lessened around the globe, the historians decided to make their findings public. President Boris Yeltsin of Russia sent a team of experts to analyze these findings. All the bones were gathered and examined in nearby laboratory. The analysis revealed one of the most interesting pieces of information: skeletons of only nine people had been discovered. The skeleton of the Tsarevich and one of the princesses was missing. The experts further studied the skeletons and realized that it was the skeleton of Princess Maria that was missing and not Princess Anastasia as believed by majority of the people (Anastasia mystery, 2007). The discovery was a mammoth blow to the hopes of the people who believed that Anastasia had survived the execution. Soon, the validity of the analysis was questioned by some of the American scientists who used the method of calculating the age of the bones to infer who was missing. After much research, they concluded that it was the skeleton of Anastasia that was missing. This result again raised the hopes of the people that Anastasia was the one who had survived the execution. But soon, the emerging technology of DNA would clear all way all the existing doubts. The DNA analysis with samples from all the remaining extended family of the Romanovs including the Prince Philip revealed that the skeletons were surely of the royal family. And the other conclusion was that the imposter Anna Anderson was not the missing princess as the people believed (Anastasia mystery, 2007). The secret report of the Commandant Yurovsky which gave a detailed account of the execution of the royal family said that that two of the bodies of the family were buried separately. After years of search, in the summer of 2007, the experts were successful in finding two more skeletons just near the graves of the rest of the Romanovs. After the in-depth DNA analysis, it was concluded that the skeletons did belong to the Tsarevich and the Princess Maria. Hence, it was clear that the ill-fated family of the Tsar Nicholas II had not survived the night of the execution in Siberia (Chris Knight, 2008). A nook was written which stated with some proofs that the Romanovs were not executed and that they were exiled to some other country. The book ‘The Secret Plot to Save the Tsar’ by Shay McNeal says that the story of the execution was just a cover up to maintain the secrecy of the royal family. They were furtively taken to a different location from their lat hiding place. The author basically gave very strong arguments and sources that it is hard to disbelieve. He even suggested that there was a secret agreement between Lenin and the pro-monarchists with proof that ensured the safe escape of the Romanov royal family. But the author has dismissed the fact that the Bolsheviks were mercilessly killing all the monarchists’ supporters and therefore, they could not have risked the escape of one of the strong rulers. This is because he could have returned later and have given the rise of the communist block a heavy blow. The book had heavy blow to it when it stated that t he future of the Romanovs was not known and that there whereabouts after the exile of the royal family from the Siberia were not known. To the DNA analysis, the author has refused to accept them because he believes that these bones could have belonged to the extended Romanov family rather than the royal family. The author has suggested that the experts have worked hard to find the facts that only to prove the execution rather than find the facts to learn about the Romanov family (William, 2002). Conclusion: When the Tsar was abdicated from his throne in 1917, there were overall 53 Romanovs living in Russia. 18 were murdered including the royal family and 35 escaped to different parts of the world. The execution of the Romanovs was a devastating blow to the pages of history of the world. When the news of the execution spread around the globe, people at first refused to accept the fact that the royal family was massacred. They thought that they had been exiled to some other country in secrecy. With time, the people realized that they indeed were murdered but still hoped for any survivors. The execution was done in such silence that it had helped in creating myths and legends about the deaths of the royal family. For decades many questions remained unanswered. It is just recently, with the development of the DNA technology that the experts have been successful in answering these questions. The findings of the research are really controversial but do help to answer the question that the Rom anov royal family was entirely executed in 1918. There were no survivors.

Professionalism and Ethics

Professionalism and Ethics Introduction Professional ethics is a challenging field that demands professional concentration. Any profession demands organized and well developed career, enhanced by skills, knowledge and capacity to make sound decisions. This discussion explores professionalism and ethics attached to the field of engineering, with specific reface to mechanical engineering.Advertising We will write a custom essay sample on Professionalism and Ethics specifically for you for only $16.05 $11/page Learn More Personal conflict of interest In several occasions, humans are faced with a number of conflicts of interest or an ethical predicament in their day-to-day existence. The outcomes may lead to a precarious, partial and indiscriminating world owing to the un-examined existence. Thus, ethical dilemma should be resolved in order to make life worth living. The dilemma in moral thinking is contradicting. For instance, when thinking is left to the aforementioned reason, it leads to downright discrimination, unacquainted, incomplete, one-sided and prejudiced philosophy. The resolution to such dilemma requires effective review to apply personal ethics. Initially, finding resolutions to intricate complications through operational communication within an organization is more than essential. This assists in measuring and identifying the practical concerns, effects and suppositions brought out by the ethical dilemma. Moreover, testing the thought alongside ethics and pertinent criteria leads to well-reasoned resolutions and decisions. Operational analysis of the intellectual idea helps in evaluating and gathering the appropriate information. Ultimately, detailed and vibrant formulation of the raised up bottlenecks and vital demands helps in resolving the conflict of interest in life. At one time in my life, I faced one of the most testing moments at the work place. Having worked for my engineering company for seven months, I was included in a professional team ta sked with reviewing the worthiness of candidate contractors. With more than 20 applicants tabled before us, we had one week to go through each of them, determine their worthiness and either reject or accept them. In addition, we were expected to accept only four applications for the contract.Advertising Looking for essay on engineering? Let's see if we can help you! Get your first paper with 15% OFF Learn More By the end of the third day, we had already accepted five applicants based on merit. The idea was to drop one application and accept the remaining four. However, I realized that the applicant with the fourth highest points was a company whose CEO was a close relative of my wife and such, my own relative. I had no previous information about this issue. My wife requested me to influence the team so that her relative’s company would get the deal. I was in a dilemma because I did not know whether it was right for me to accept her request before infor ming my colleagues. I was also aware that my wife was set to benefit from the deal. After thinking for two days, I realized that it was unethical to act in a manner that suggests I was favoring my relative’s company. I made my mind and informed the other members of the team. The issue was discussed at length. Finally, a decision was reached to reject the application from my relative’s company and accept the fifth best applicant. Professionalism It is worth arguing that college professors are professionals. Indeed, they possess a number of critical attributes that render them professionals. The attributes owned by college professors are all integrated in the dimension of critical thinking. This entails thinking that is own-corrective, own-monitored, own-disciplined and own-directed. As professionals, they enjoy careful knowledge in what they practice as well as rigorous principles of brilliance. These professors seek to overcome the native socio-centrism and egocentrism through their skills in problem solving and actual communication (Harris, Pritchard and Rabins 121). In order to improve the scholarly traits, they habitually enforce the knowledgeable principles to the cognitive module. On the other hand, the professors apply the several elements and aspire to develop the lives of different individuals. The elements applied by the professors include suppositions, inferences, notions, and extrapolations. In addition, they apply effective information, opinion, enquiries and purpose to instill growth in persons of diverse professions. The above elements develop several intellectual traits that college professors put into effect as professionals. Such intellectual traits are bravery, honesty, sovereignty and self-effacement. As well, they enforce the application of other traits similar to fair-mindedness, understanding and persistence. The above dimensions apply to the critical attributes that brand college professors as professionals.Advertising We will write a custom essay sample on Professionalism and Ethics specifically for you for only $16.05 $11/page Learn More The difference between code of ethics and law Law and code of ethics may perhaps differ in a number of ways. In fact, law is something that one person has to do as it is obligatory. On the other hand, code of ethics denotes something that one ought to do. The code of ethics most likely applies to professionals, for instance, the police, lawyers, medics and engineers or personalities of limited factions. Nonetheless, law is applied in a similar manner to any person as it appears as a loose word hypothetically. The government or state is in control of setting up the law. The state or government that sets the law is the one that oversees its enforcement, given that it should be applied a similar manner to every individual. Rendering the primeval laws has a hostage to fortune in regards to the marginalized groups. In contrast, codes of conduct are enforced and only spread over to certain groups of professionals. In this case, the peers of a medic, an engineer, or a lawyer are the ones who impose and charge their fellows who breach the code of conduct. The contemporary world concentrates on the moral matters, given that ethics are not much different from these morals. Social Responsibility An organization is socially responsible for the things and operations it organizes. In the modern world, companies yield an overwhelming economic influence on society. In the eyes of the law, companies are legal entities, which means that they enjoy the rights and protections of an individual citizen. Thus, corporations can make moral or immoral decisions. The process of corporate moral decision is developed and determined through corporate internal decisions. Although this framework is composed of individuals, it operates like a system or machine. Companies are socially responsible for their actions. They must ensure that they work with in the legal, moral and social requirements. In the Lockheed example, it was expected that the individuals involved were financially endowed for the favors that were involved. The Tristar Jet Company was awarded the right to supply the Chinese travellers to Africa and America with visa to travel without restrictions. Lockheed is popular for guaranteeing the populace in which it operates and takes social responsibility to account for the challenges that the community faces.Advertising Looking for essay on engineering? Let's see if we can help you! Get your first paper with 15% OFF Learn More In looking for an attachment with Lockheed, it was difficult to settle an appointment with the human resources manager. Allegedly, shop stewards at the company demand bribes from prospective employees. Conclusion Work ethics is an influential field that demands the influence of the individual expert. Thus, it is the right of professionals to conduct their roles within the limits of their academic qualifications. It determines the way a professional handles the issues that are to be engaged with learners and the employees. Harris, Charles, Michael Pritchard and Michael Rabins. Engineering Ethics: Concepts Case. London: Cengage Learning, 2004. Print.

The Impact of the New Technology and Social Isolation Assignment

The Impact of the New Technology and Social Isolation - Assignment Example However, I disagree with this position because I believe that these technologies promote isolation among individuals, promote de-socialization among the youth and promote the development of cyber friends with little or no social ties and bonds. In this paper, I will explore some of the research literature available in providing evidence for the existing controversial debates surrounding the new technological developments and my position regarding their impacts. Promoters of the new technology argue that it has immense benefits to the growth and development of the society in terms of promoting socialization and human connectedness. Amichai-Hamburgera & Hayat (2011) explores the impact of the new technology on the social lives its users. Through an analysis of a representative sample of 22,002 internet users across 13 countries, they were able to analyze the social implication of the internet and its related information communication technologies. Their study indicates that the internet has a strong impact on the users and their relationships. The study established a positive correlation between the internet use and social interactions implying that the internet significantly enhances the social lives of its users. Another key benefit commonly cited by promoters of the new technology is that it promotes the cognitive development and socialization skills among the youth and adolescents. According to Shapiro(2013), the new technology, especiall y video gaming played in the cooperative multiplayer mode encourages children and youth to play in groups. He argues that through this interaction, children are able to develop strong bonds and teams with their partners both within and outside the gaming context thus leading to improved socialization and interaction. Although many argue that the advent of the new technology is beneficial to the society, I believe that it has serious negative impacts on the children, youth and adolescents in  terms of socialization and personal development. According to Fallahi(2011), the growth of the internet and its related information technologies have negative effects on the attitudes and behaviors of children and adolescents.  

Locating Resources Assignment Example | Topics and Well Written Essays - 250 words

Locating Resources - Assignment Example The site offers readings about the effects of alcohol to health, side-by-side with policies that would create a win-win solution for alcoholic drinks producers and the consumers. Most of the resources regarding alcohol use are published by medical experts. But there are also resources by policy-makers with regards to the use and distribution of alcohol and making feasible interventions in preventing its misuse. The International Center for Alcohol Policies or ICAP is a non-profit organization that is supported by major alcoholic beverage manufacturers such as Heineken, Carlsberg, and Anheuser-Busch, and aims to reunite scientific and medical data with the responsibilities of these vendors in promoting proper use of alcohol by the consumers (International Center for Alcohol Policies, 2012). Upon browsing the ICAP website, reading resources such as the effects of alcohol in the body, interventions for alcohol abuse, journal articles about the effects of alcohol, and other publications related to the use and distribution of alcohol in many locations. There are also tools for policy-makers in creating guidelines and other rulings regarding alcohol distribution a nd consumption that could create win-win solutions for both the alcoholic beverage producers and the consumers. Resources for brewers and manufacturers such as those that align with the World Health Organization’s policies are also present, especially since the brewers are also held accountable with the use of alcohol, apart from the consumers themselves. Lastly, articles that were authored by ICAP experts and published in other respected journals are also available. While the website of ICAP is an indispensable tool for all people interested in alcohol and its effects, its main target audiences are policy makers and manufacturers of alcoholic beverages, since they deal with the business and legal aspect of product distribution. These people must be

THE GLOBAL TOURISM INDUSTRY Term Paper Example | Topics and Well Written Essays - 2000 words

THE GLOBAL TOURISM INDUSTRY - Term Paper Example Not only has transportation advanced but also the capacity of many people to buy cars due to more compensated holiday and passive income. This increase in consumers’ income was apparently a positive development for tourism. Moreover, the invention of the Internet and other computer technologies made the booking system easier (Sharpley 2006). For instance, the global distribution systems (GCDs) were recognised in the 1980s as a computer reservation technology (Singh 2008). However, this advances in technology depressed the traditional operations of the travel and tourism industry as well as the importance of human travel agents. The benefits of these developments to the industry are hence relative to one’s point of view. A general differentiation is usually made between the different specialisations of tour operators: first is mass-market or mainstream, and second is specialist or niche. Mass-market or mainstream tour operators, such as My Travel, TUI UK, First Choice, etc., are those that create a substantial fraction of their revenue by selling a popular product such as the 4S product (sex, sand, sea, and sun) to a broad market segment. On the other hand, niche or specialist tour operators serve a smaller market segment with frequently highly specialised products. In an effort to thrive in a highly competitive environment of tourism, tour operators, specifically small independent ones, are incessantly searching for niche markets to develop. From the point of view of the customer, with less leisure time and more severe stress, services offered by tour operators are important for maximising valuable time. Moreover, the operator gains better transactions from the producers by buying in bulk, which enables them to bid low prices for the whole produce and/or service, which are quite difficult to acquire by the individual customer. Due to these factors, price and time, the services of tour

Simulation Of Scheduling Algorithms

Simulation Of Scheduling Algorithms Abstract- In this term paper we have discuss simulation of scheduling algorithm. We have discuss various type of scheduling algorithm such as robin round, first comes first served, shortest job first, and etc. We also discuss its advantages and disadvantages. In this term paper we take some c programme based on this scheduling algorithm to understand properly. We also include some graphical representatiion of each scheduling. From which we can differentiate between each algorithm. Keywords- In this term paper we use some keyword Round Robin(RR), First Come First Serve (FCFS), Shortest Job First(SJF), Process Control Block (PCB), Shortest Time Remaining (SRT). INTRODUCTION Scheduling is a fundamental operating-system function. Whenever the CPU becomes idle, the operating system must select one of the processes in the ready queue to be executed. The selection process is carried out by the short-term scheduler. The scheduler selects from among the processes in memory that are ready to execute, and allocates the CPU to one of them. All processes in the ready queue are lined up waiting for a chance to run on the CPU. The records are generally the PCBs (Process Control Block) of the processes. Another important component involved in the CPU scheduling function is the dispatcher. The dispatcher is the module that gives control of the CPU to the processes selected by the short-term scheduler. This function involves: à ¢Ã¢â€š ¬Ã‚ ¢ Switching context à ¢Ã¢â€š ¬Ã‚ ¢ Jumping to the proper location in the user program to restart that program. Our goal is to simulate the process scheduling algorithms to get a more accurate evaluation on how choice of a particular scheduling algorithm can effect CPU utilization and how a scheduler decides when processors should be assigned, and to which processes. Different CPU scheduling algorithms have different properties and may favour one class of processes over another. We have programmed a model of the computer system and implemented scheduling algorithms using Software data structures which represent the major components of the system which we have discussed in this section. 2. PROPOSAL When system has a choice of processes to execute, it must have a strategy -called a Process Scheduling Policy-for deciding which process to run at a given time .A scheduling policy should attempt to satisfy certain performance criteria, such as maximizing: à ¢Ã¢â€š ¬Ã‚ ¢ Throughput à ¢Ã¢â€š ¬Ã‚ ¢ Latency à ¢Ã¢â€š ¬Ã‚ ¢ Preventing Indefinite postponement of Process à ¢Ã¢â€š ¬Ã‚ ¢ Maximizing Process Utilization It is the job of the scheduler or dispatcher to assign a processor to the selected process. In our project various Process Scheduling Algorithms that determine at runtime which process runs next .These algorithms decide when and for how long each process runs; they make choices about à ¢Ã¢â€š ¬Ã‚ ¢ Preemptibility à ¢Ã¢â€š ¬Ã‚ ¢ Priorities à ¢Ã¢â€š ¬Ã‚ ¢ Running time à ¢Ã¢â€š ¬Ã‚ ¢ Time-to-Completion à ¢Ã¢â€š ¬Ã‚ ¢ Fairness We will be simulating these Scheduling Algorithms and comparing them against various parameters mentioned above. BACKGROUND What is Process :-A process is the locus of control of a procedure in execution that is manifested by the existence of a data structure called Process Control Block. Each process has its own address space, which typically consists of Text region, Data region and Stack region. The Text region stores the code that the processor executes. The Data region stores the variables and dynamically allocated memory that the process uses during execution. The Stack region stores instructions and local variables for active procedure calls. The contents of the Stack grow as the process issues nested procedure calls and shrink as procedures return. 4.WHAT IS PROCESSOR SCHEDULING? -When a system as a choice of processes to execute, it must have a strategy for deciding which process to run at a given time. This strategy is known as Processor Scheduling Policy. Different process scheduling algorithms have different properties and may favor one class of processes over another. In choosing which algorithm to use in a particular situation, we compare the following characteristics to compare the algorithms. CPU Utilization -We want to keep the CPU as busy as possible. It ranges from 0 to 100%. In real systems it ranges from 40% to 90%. For the purpose of this simulation we have assumed that CPU utilization is 100%. Throughput -The work done by the CPU is directly proportional to the CPU utilization. The number of processes completed per unit time, called throughput, is the measure of work done by the CPU. Algorithms should try to maximize the throughput. Turnaround time- The time interval from submission of job to the completion of job is termed as the turnaround time. It includes waiting time of the process and the service time of the process. Waiting time -The amount of time process spent waiting in the ready queue is termed as Waiting time. Any algorithm does not affect the service time of the process but does affect the waiting time of the process. Waiting time should be kept to the minimum. Response time The time interval from the submission of the process to the ready queue until the process receives the first response is known as Response time. Response time should always be kept minimum. Besides the above features, a scheduling algorithm must also have the following properties: à ¢Ã¢â€š ¬Ã‚ ¢ Fairness à ¢Ã¢â€š ¬Ã‚ ¢ Predictability à ¢Ã¢â€š ¬Ã‚ ¢ Scalability 5. SIMULATION- In our simulation the ready queue has been programmed to serve the processes in the First in First out, Round Robin, Shortest Process first, Highest Response Ration Next and also Shortest Remaining time. The simulator has a variable representing a clock; as this variables value is increased, the simulator modifies the system state to reflect the activities of the devices, the processes, and the scheduler. Our system has a function called Process Ready which checks which processes are ready to enter the system depending on the current clock. Preemption is performed based on the current clock. If the next process in the ready queue should get the CPU the current process is pushed into the queue and the next process, based on how the priority of the processes is calculated in ready queue, is taken and given the CPU time. We call this in real systems as context switch .We will be providing this overhead a simple variable which we fill add to a process when it is preempted. The scheduler is an abstract class in which we have defined the basic components which are needed by the scheduler like ready queue .FIFO, RR, SPF, SRT and HRRN are the classes which extend this scheduler class and implement the ready queue based on specific scheduler. The data that we are using to drive the simulation is generated using a random-number generator. The generator is programmed to generate processes, CPU-burst times, Arrivals and Finish time. The process PCB in our simulation consists of following attributes: Process Id Process ServiceTime Process ArrivalTime Process FinishTime Process ResponseTime The same set of processes is feed into the scheduling algorithm to evaluate the algorithms effect on the processes and CPU. These are initialized for all the processes that we randomly generate .Once the process gets the CPU its service time gets updated and if the simulation performs a context switch which preempts the current running process and puts it at the back of the ready queue i.e. we save the PCB of the process. After this the first process in the ready queue is given the block .In the end the system outputs the Arrival Time, Service Time, Turn around Time, Waiting Time and Response Time for each process executed by the system. The output formats, the input and the Analysis using this simulation model are shown in the sections that follow: A simple Class Diagrame :- 6. SCHEDULING ALGORITHM A scheduling algorithm is the method by which threads, processes or data flows are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to load balance a system effectively or achieve a target quality of service. The need for a scheduling algorithm arises from the requirement for most modern systems to perform multitasking (execute more than one process at a time) and multiplexing (transmit multiple flows simultaneously) Type of Scheduling algorithm Scheduling algorithm :- First Come First Serve (FCFS) Round Robin Shortest Job First Shortest Remaining Time Highest Response Ratio Next (HRRN) Fixed priority pre-emptive scheduling FIRST COME FIRST SERVE (FCFS) :- CPU scheduling deals with the problem of deciding which of the processes in the ready queue is to be allocated the CPU. There are many different CPU scheduling algorithms. By far the simplest CPU-scheduling algorithm is the first-come, first-served (FCFS) scheduling algorithm. With this scheme, the process that requests the CPU first is allocated the CPU first. The implementation of the FCFS policy is easily managed with a FIFO queue. When a process enters the ready queue, its PCB is linked onto the tail of the queue. When the CPU is free, it is allocated to the process at the head of the queue. The running process is then removed from the queue. The code for FCFS scheduling is simple to write and understand. The average waiting time under the FCFS policy, however, is often quite long. C- programming for this scheduling algorithm is given below. I only present the main part of the programme. /* Programme for FCFS*/ #include #include //Library for clearing the screen using namespace std; int cont, ctr; class FCFS{ //Class used for the simulation public: //public elements of the class void input(); void gantt(); protected: //protected elements of the class float wt, bt, arr, bt2; float awt; }; int main(){ //main function FCFS IT2B; cout cin>>ctr; if(ctr>=3ctr system(cls); IT2B.input(); //invocation }else{ cout cout cin>>cont; system(cls); main(); } return 0; } void FCFS::input() //input() function of class FCFS { wt=0; bt2=0; cout for(arr=1;arr cout>bt; cout bt2=bt+bt2; wt=bt2+wt; } awt=(wt-bt2)/ctr; cout cout cin>>cont; } /*void FCFS::gantt() { */ Limitations: In FCFS, average waiting time is quite longer. If we have a processor bound job (generally with longer service time) and other I/O bound jobs. And if, processor bound job is allocated the processor time, then it will hold the CPU. As a result, other I/O bound jobs will keep waiting in the ready queue and the I/O devices will remain idle. Like in the test cases we observed, process P3 despite having a very short service time had to wait for long till all the processes ahead of it ran to completion. Average Turn around Time: 12 Average Waiting Time: 7.2 Average Response Time: 7.2 6.2. ROUND ROBIN The round-robin (RR) scheduling algorithm is designed especially for time-sharing systems. It is similar to FCFS scheduling, but preemption is added to switch between processes. A small unit of time, called a time quantum or time slice, is defined. A time quantum is generally from 10 to 100 milliseconds. The ready queue is treated as a circular queue. The CPU scheduler goes around the ready queue, allocating the CPU to each process for a time interval of up to l time quantum. To implement RR scheduling, we keep the ready queue as a FIFO queue of processes. New processes are added to the tail of the ready queue. The CPU scheduler picks the first process from the ready queue, sets a timer to interrupt after l time quantum, and dispatches the process . C- programming for this scheduling algorithm is given below. I only present the main part of the programme. /* Programme for ROUND ROBIN*/ for(i=0;j { if(r[i]>0sp>=a[i]) { f=true; if(r[i] time=r[i]; else time=q; //schedule the process t[i]+=time,r[i]=time,order.push_back(i+1); if(r[i]==0) j++; for(k=0;k if(r[k]!=0k!=ia[k] if(!(a[k] w[k]+=sp+time-a[k],t[i]+=sp+timea[k]; else w[k]+=time,t[k]+=time; sp+=time; continue; } if(i==n-1) { if(!f) { int it; int diff=0; for(it=0;it if(sp { if(diff==0) diff=a[it]-sp; else if(diff>a[it]-sp) diff=a[it]sp; } sp+=diff; } f=false; } } OUTPUT:- Advantages:-Round Robin algorithm exhibits fairness. All the processes are treated equally and are given equal processor time. As compared to FCFS, the average waiting time is considerably reduced in Round Robin algorithm. Limitations: The performance of the system implementing Round Robin mainly depends upon the value of the quantum. If we set the quantum to very high value, then it will proceed as the FCFS. As a result the system performance will be sluggish. If we keep the quantum value low, more overhead will be produced because of frequent context switch .Round Robin with low quantum is generally suitable for the interactive system. However, to determine the optimal quantum time is a tedious task 6.3.SHORTEST JOB FIRST A different approach to CPU scheduling is the shortest-job-first (SJF) scheduling algorithm. This algorithm associates with each process the length of the processs next CPU burst. When the CPU is available, it is assigned to the process that has the smallest next CPU burst. If the next CPU bursts of two processes are the same, FCFS scheduling is used to break the tie. Note that a more appropriate term for this scheduling method would be the shortest-next-CPU-burst algorithm, because scheduling depends on the length of the next CPU burst of a process, rather than its total length. The SJF algorithm is a special case of the general priority scheduling algorithm. A priority is associated with each process, and the CPU is allocated to the process with the highest priority. Equal-priority processes are scheduled in FCFS order. An SJF algorithm is simply a priority algorithm where the priority (p) is the inverse of the (predicted) next CPU burst. The larger the CPU burst, the lower the pri ority, and vice versa. C- programming for this scheduling algorithm is given below. I only present the main part of the programme. /* Programme for SJF*/ #include #include #include void main() { char p[10][5],temp[5]; int tot=0,wt[10],pt[10],i,j,n,temp1; float avg=0; clrscr(); printf(enter no of processes:); scanf(%d,n); for(i=0;i { printf(enter process%d name:n,i+1); scanf(%s,p[i]); printf(enter process time); scanf(%d,pt[i]); } for(i=0;i { for(j=i+1;j { if(pt[i]>pt[j]) { temp1=pt[i]; pt[i]=pt[j]; pt[j]=temp1; strcpy(temp,p[i]); strcpy(p[i],p[j]); strcpy(p[j],temp); } } } wt[0]=0; for(i=1;i { wt[i]=wt[i-1]+et[i-1]; tot=tot+wt[i]; } avg=(float)tot/n; printf(p_namet P_timet w_timen); for(i=0;i printf(%st%dt%dn,p[i],et[i],wt[i]); printf(total waiting time=%dn avg waiting time=%f,tot,avg); getch(); } Output : Advantages: Shorter processes are given preference. If the ready queue contains Processor bound processes and some I/O bound processes, then the I/O bound will be given more preference. As a result the system throughput increases. Average waiting time of the processes decreases. Like in the test case, the process P3 waited for only 6 seconds compared to 10 seconds in RR and 16 seconds in FCFS. 6.4 .SHORTEST REMAINING TIME (SRT) This is the preemptive algorithm which acts on the principles of SPF. It gives preference to the processes with the smaller service time. If a process is using the process and in the mean time a new process arrives whose service time is less than the currently running, then it preempts the currently running process and gives processor control to the new process. This algorithm is no longer useful in todays operating systems. Advantages: It offers the minimum waiting time for the processes. Like the process P3, waited for 6 seconds before getting the processor time. Though this waiting time is equal to that in SPF. But being a preemptive algorithm, SRT scores over SPF by providing even lesser waiting time than the former. Average Turn around Time: 11 Average Waiting Time: 6.4 Average Response Time: 6 6.5 HIGHEST RESPONSE RATIO NEXT This algorithm corrects some of the weakness of the SPF. The SPF algorithm is biased towards the processes with short service time. This keeps the longer processes waiting in the ready queue for the longer time, despite of arriving in the ready queue before the short jobs. It is a non-preemptive scheduling algorithm in which the priority is the function of not only the service time but also of the time spent by the process waiting in the ready queue. Once the process obtains the control of the processor, it completes to completion. The priority is calculated by the formula Priority = (Waiting Time + Service Time)/Service Time In this algorithm too, short processes receive preference. But longer processes that have been waiting in the ready queue are also given the favorable treatment. 7.GRAPHICAL REPRESENTATION Turnaround Time Comparison Waiting time comparison Responce time comparison 8.CONCLUSION From the analysis of the algorithms, we have come up with the conclusion that RR has the best average response time and being the preemptive algorithm, it exhibits fairness. But however, performance of the RR algorithm depends heavily on the size of the quantum. On the one extreme is the time quantum is very large, RR algorithm is same as FCFS policy. But if the time quantum is fairly small, the RR will exhibit fairness but a considerable overhead gets added to the turnaround time due frequent context switch. This fact becomes clear from the RR average turnaround time reading is highest as compared to other algorithms. Hence we observed if majority of the processes are less then the time quantum, the RR will give better response time. Further, SPF has the least average turnaround time and average waiting time as compared to other algorithms. This shows that SPF is provably optimal, in that it gives the minimum average time in the set of processes by moving the short process before a long one. The waiting time of short process decreases more than the waiting time of the long process. Consequently the waiting time decreases. But this algorithm can only be used for systems which are interactive and thereby is biased to short processes and unfavorable to longer ones which may lead to indefinite postponement of longer processes. HRRN has approximately same average turnaround, waiting and response time. It overcomes the limitation of the SPF by giving favorable treatment to the processes waiting for a longer time, and thereby prevents indefinite postponement. SRT exhibits approximately same average response time, waiting time and turnaround time, and may seem to be an effective algorithm for interactive processes if the tasks performed before issuing I/O are short in duration. However, SRT determines priority based on the run time to completion, not the run time to I/O. Some interactive processes such as shell executes for the life time of the session, which would place the shell at the lowest priority level.

Cocaine and the Nervous System Essay examples -- Drug Drugs Coke Cocai

Cocaine and the Nervous System All drugs have a negative effect on the nervous system, but few can match the dramatic impact of cocaine. Cocaine is one of the most potent, addictive, and unpredictable recreational drugs, and thus can cause the most profound and irreversible damage to the nervous system. The high risk associated with cocaine remains the same regardless of whether the drug is snorted, smoked, or injected into the user ¡Ã‚ ¯s bloodstream. In addition to the intense damage cocaine can cause to the liver, intestines, heart, and lungs, even casual use of the drug will impair the brain and cause serious damage to the central nervous system. Although cocaine use affects many components of the body, including vision and appetite, the most significant damage cause by cocaine takes place in the brain and central nervous system. Spanish explorers first observe South American natives chewing the cocoa leaf, from which cocaine is derived, when they arrived on the continent in 16th century. The South Americans chewed these cocoa leaves in order to stay awake for longer periods of time. Centuries after this initial discovery, Albert Neiman isolated cocaine from the cocoa leaf in 1860. Neiman used this extraction as an anesthetic. Over the ensuing years, cocaine use became increasingly common and was even sanctioned by doctors, who prescribed the drug to aid recovering alcoholics. Cocaine was even a key ingredient in such popular beverages as Coca- Cola. It was not until the long-term health problems associated with cocaine use emerged that the public realized that the drug was harmful and highly addictive (2). Cocaine is a versatile drug which can be ingested in a variety of ways. In its purest form, coc... ...te an artificial high. Cocaine can cause serious damage to the nervous system, as it eats away chunks of the brain and increases blood pressure, heart rate and body temperature, often for the rest of the addict ¡Ã‚ ¯s life. Sources Cited: 1)Drug information: Cocaine http://www.theantidrug.com/drug_info/drug_info_cocaine.asp 2)Cocaine http://faculty.washington.edu/chudler/coca.html 3)The Effects of Cocaine on the Developing Nervous System https://cognet.mit.edu/login/?return_url=%2Flibrary%2Ferefs%2Fnelson%2Fn33%2Fabstract.html 4)The Physical Effects of Cocaine http://www.shesinrecovery.com/addiction/cocaineeffects.html 5)As a Matter of Fact http://www.well.com/user/woa/fscoke.htm 6)Crack and Cocaine http://www.nida.nih.gov/Infofacts/cocaine.html 7)Cocaine Brain Damage may be Permanent http://www.healthy.net/asp/templates/news.asp?Id=6376