Animal Farm Or Ussr Part II - 1243 Words

Cliffy Smith James Hensley Pre-IB LA 10 10 April 2015 Animal Farm or USSR Part II Animal Farm written by George Orwell is a hopeful novel about a group of animals that overthrow their farmer and create an animalistic government. Much like All the King’s Men a novel by Robert Penn Warren, Animal Farm has strong political undertones relating to the the skewed government of Soviet Russia. Throughout the book many animal characters can be identified with the political leaders and influences throughout Soviet Russia. According to New World Encyclopedia, â€Å"New Historicism is an approach to literary criticism and literary theory based on the premise that a literary work should be considered a product of the time, place, and historical circumstances of its composition rather than as an isolated work of art or text.† Animal Farm and it’s direct correlation with the USSR connects New Historicism and the impactful writing of Orwell with fluidity and ease. New Historicism is a criticism developed in the 1980’s by a Harvard English professor named Stephen Greenblatt. This criticism takes a look at every aspect of the story including the author’s political and emotional bias. It was used to bring outside information and cultural context into the book and create a deeper meaning for the reader. New Historicism gained widespread influence in the 90’s through its new way for reading and analyzing a story. Judith Newton explains New Historicism as a criticism that â€Å"aims to subject theShow MoreRelatedElements in George Orwells Animal Farm861 Words   |  4 PagesAnimal Farm, written by George Orwell, depicts a group of animals who plot to destroy their master, Mr. Jones. The oldest and wisest pig on the farm, Old Major, told the other animals a story about a revolt called, The Rebellion. The pigs, which were considered to be the most intelligent of all the animals, devised a plan and successfully conquered Manor Farm. The animals ran the farm effectively, with the pigs overseeing and constantly developing new ideas. One pig, Snowball, was in favorRead MoreOctober Revolution and Animal Farm1439 Words   |  6 Pagesï » ¿Dylan Hearn 2nd 9/24/14 Animal Farm 20 Questions Webquest    Directions: Please use the suggested links to find answers to each of the questions below. Be sure to paraphrase (not copy) the answers/information you find on the internet.   All these questions will have parallels in Animal Farm, so be sure to pay careful attention!    For questions #1-2, please refer to your copy of the novel and to this website http://www.k-1.com/Orwell/site/opinion/essays/rhodi.html 1. What was George Orwell’sRead MoreThe Characteristic Of Snowball By George Orwell885 Words   |  4 PagesKhatun Prof: John Remarek Language and Composition 10th Dec 2017 Characteristic of Snowball Animal Farm is an allegorical book which was written by George Orwell. In this book the author represents the important characters of the Russian Revolution. There are many characters in this book. A pig named Snowball is one of them who is based on Leon Trotsky. Leon Trotsky was an early leader in communism (ANIMAL FARM). He had control of the Soviet Union. He followed Karl Marx direction who was leader of communistRead MoreGeorge Orwells Animal Farm Essays2826 Words   |  12 Pagesincludes a strong message in his novel Animal Farm that is easily recognizable. Orwell’s Animal Farm focuses on two primary problems that were not only prominent in his WWII society, but also posed as reoccurring issues in all societies past and present. Orwell’s novel delivers a strong political message about class structure and oppression from the patriarchal society through an allegory of a farm that closely resembles the Soviet Union. George Orwell wrote Animal Farm: A Fairy Story with an intendedRead MoreEssay about Immortal Hopes of Animal Farm1859 Words   |  8 PagesImmortal Hopes of Animal Farm Communism is supposed to be a system under which all property would be held in common. The dignity of the poor workers oppressed by capitalism would be restored, and all people would live as equals in communism. This book, Animal Farm by George Orwell is an amusing story of allegory of the early history of the Soviet Union. Orwell wanted to make political writing into an art and to harmonize political concerns with artistry. As he became inspired by the RussianRead MoreUssr And The Soviet Revolution2076 Words   |  9 PagesAfter the end of World War II, there was a bipolar world with the two superpowers being the United States and the United Soviet Socialist Republics (USSR). Though they fought together in the war to defeat Hitler and the Axis powers, their lifestyles were too different to remain allies once it ended. The United States had a capitalist economy with free-markets whereas the USSR was a communist nation. Due to this, the two nations were in the midst of a Cold War. Instead of fighting with armies, theyRead MoreProblems of Today ´S World1621 Words    |  7 PagesWARS NATO After the WW II States of Western Europe and North America watched the expensive policy of the USSR. They found out that the Russian system, especially the dictatorship of the Communist Party, could become dangerous for independent democratic states. This threat stengthened with the events of years 1947-1949 (the putch in Czechoslovakia in February 1948, blockade of Berlin in April 1948). In March 1948 Belgium, France, Luxembourg, the Netherlands and the UK signed the TREATY OF BRUSSELSRead MoreAnalysis Of George Orwell And Animal Farm Essay2095 Words   |  9 PagesRichard Cortez Professor Sharon Pittman HUM 314 13 December 2016 George Orwell and Animal Farm: The Provocative Written Word in Political Protest INTRODUCTION AND THESIS Many writers, artists, novelists, journalists, and the sort seek to bring awareness to political and cultural issues through their work. It is not often, though, that their work attains such critically acclaimed status and subsequently creates a platform by which people are moved to respond to the writing’s purpose. George OrwellRead MoreThe World And Its Economic Systems Essay2422 Words   |  10 Pageseconomic systems been to, at an ever increasing rate.   Over thousands of years civilization have developed the means to master resources, such as, land, water and even the heavens. Agriculture allowed the human race to no longer rely on migrant herds of animals, but to settle and look to the ground beneath them for a continued supply of basic needs. Dale and Carter argue, â€Å"both civilization and the enjoyment of civilization rest on the surplus production by those who supply the necessities of life† (1955Read More Animal Farm as a Political Satire to Criticise Totalitarian Regimes4636 Words   |  19 PagesAnimal Farm as a Political Satire to Criticise Totalitarian Regimes This study aims to determine that George Orwells Animal Farm is a political satire which was written to criticise totalitarian regimes and particularly Stalins practices in Russia. In order to provide background information that would reveal causes led Orwell to write Animal Farm, Chapter one is devoted to a brief summary of the progress of authors life and significant events that had impact on his political convictions. Chapter

Analysis Of The Overachievers The Secret Lives Of Driven...

Journalist Alexandra Robbins ventures back to her old high school to examine the competitive efforts students are having to take to compete on the battlefield that is the education system in her book, The Overachievers: The Secret Lives of Driven Kids. Robbins explores the lives of multiple students who are stressed and pressured to maintain good grades and get into an Ivy League college. This text allows for intriguing insight on how the educational system has â€Å"spiraled out of control† and displays the different measures students must now take to be the best. Robbins’ The Overachievers is an eye-opening bestseller which exposes the social pressures and anxieties students must overcome in their high school lives as they attempt to impress and prove to colleges they are worthy of acceptance. Alexandra Robbins follows many students who strive to be the best, but her findings show some of those students eventually become very stressed and their sanity falls victim to their overwhelming work while in pursuit of their perfect future. Julie, portrayed as the superstar, participates in many extracurricular activities in order to receive acceptance into the college of her dreams. â€Å"Her class schedule consisted of 5 AP classes followed by an hour-long thrice-weekly environmental education internship at a natural science museum. At 2:30 each day, she returned to school for cross country practice.† Julie’s busy schedule displays her desire to ‘build up’ her resume for college to seem

A Farewell to Arms Questions - Free Essay Example

Sample details Pages: 5 Words: 1570 Downloads: 10 Date added: 2019/08/15 Category Literature Essay Level High school Tags: A Farewell to Arms Essay Did you like this example? A Farewell to Arms by Ernest Hemingway is a love and war novel about the love between lieutenant Frederic Henry and Catherine Barkley, an English nurse. Love plays a critical role in this novel. When Frederic and Catherine first encounter each other, they immediately become invested in eachothers lives. Don’t waste time! Our writers will create an original "A Farewell to Arms Questions" essay for you Create order However, Catherine is skeptical about an incoming relationship because prior to Henry she was engaged to a soldier who tragically passed away at war. This event changed her perspective on love. She did not want to marry Henry because of what happened to her fianc? ©, however, she did love Henry deeply and tried to do everything in her power to please him. Frederic slowly begins to fall in love with the English nurse. For example on page 41 the reader is able to acknowledge that he feels lonely without Catherine. Frederic said, I went out the door and suddenly I felt lonely and empty. I had treated seeing Catherine very lightly. I had gotten somewhat drunk and had nearly forgotten to come but when I could not see her there I was feeling lonely and hollow. The couple become infatuated with each other and fell completely in love. Frederic did not plan on finding love at first, he did not like commitment and was more a player and a drinker. He was very surprised when he fell deeply in love with Catherine. On page 93 he states, God knows I didnt mean to fall in love with her. The love that Frederic had for Catherine came with a lifestyle change and brought order to his life. Love made the couple do courageous things for one another. Such as long distance while Frederic is away at war. Also Catherine was deeply brave when it came to being apart for many years and knowing that her loved one could be in danger. However, their love for eachother grew stronger and stronger. The love that the two shared for one another changed their perceptions of war in a drastic way. For example, the couple ran away together to get away from the fighting war. Frederic only cared about Catherine and their baby that was on the way. Frederic never liked the idea of war or fighting in it, however, after meeting and falling in love with Catherine, he disliked the idea of war even more. On page 49 Henry states, I believe we should get the war over. it would not finish if one side stopped fighting. It would only be worse if we stopped fighting. The couple just wanted to get away fro m war. The war shaped the couples love story. If it was not for the war, Frederic and Catherine would not have met and fell in love. Because of the war, their love story had many ups and downs and was very chaotic and challenging. The couple went through long distance, went without seeing each other for years, and went through danger together. The war taught the couple to love one another through any challenge that came their way like rowing away in a boat while pregnant and being away from each other for years. The war shaped their love story as the amazing, challenging, and loving love story that it was. 2. F. Scott Fitzgerald was and still is a very popular American fiction writer. However, he believed that Catherines character was a weak link in this novel. Critics think that Catherine is not fully believable for the reader. Fitzgerald said, Catherine was the weak link in A Farewell to Arms and I think Im inclined to agree. She seems to be slightly unnatural, maybe a bit one dimensional. What is she really like? I have no idea. Fitzgerald thought that the readers couldnt understand who she really was because she was too willing to please Henry. For example, Catherine did not have any religion and she told Henry, Youre my religion. She wants Henry to know that he is all she believes and cares for. Catherine was always trying to please Henry and to not make him have any troubles or go through much work. For example, when she was pregnant as told Henry, Ill try and not make any trouble for you. I know Ive made trouble now. But havent I always been a good girl until now? She did not want the pregnancy to trouble and worry Henry. This quote shows how much Catherine wanted to please Henry. Hemingway portrays Catherine as a caring English nurse who has gone through a tragedy a while back. She is also portrayed as a very brave woman. Catherine traveled to many different countries to cure patients. She works tirelessly, especially during her pregnancy taking care of injured or ill soldiers. She also was able to row a boat while being pregnant and without complaining. For example, she offered to row the boat and said, Nonsense. Rowing in moderation is very good for the pregnant lady. She was a very brave and strong person. She was formally engaged to a soldier who tragically passed away at war. This dismal event changed Catherine into a mature, independent women who knew how to handle disappointing and sad changes in life and who was able to unknowingly change Henrys player ways. Catherines past experiences with engagement made her decide that she did not want to get married to Henry. She thinks that being married to Henry would keep them from being together during the war. According to Catherine they did not need to get married because Were really married. I couldnt be any more married. Catherine felt that they were already married and they did not have the need to do the real thing. Also her last experience of her fianc? © is what is keeping her from marrying Henry. I do not agree with Fitzgeralds opinion of Catherines character being a weak link in this novel. I disagree because Catherine is just trying to please and take care of Henry because of all the love she has for him and because she does not want to lose another loved one like what had happened to her fiance. She is a very brave and strong character in this novel. She can handle disappointment and is very independent when she needs to be. 3. In this novel, A Farewell to Arms, foreshadowing plays a very crucial role. It especially plays an important role in the outcome of Henry and Catherines life. Foreshadowing is a writing technique used to help the reader anticipate the outcome of an situation. Hemingway uses setting and foreshadowing techniques to make the readers feel the suspense about what is about to occur. In this novel foreshadowing can be interpreted in many different ways and there are many examples of it in this novel. In this novel, Hemingway subtly signaled the reader, using foreshadowing, that Catherine was going to die during childbirth. This changes the readers perspective and approach when they reach the ending of the novel. On approaching the final chapters, the readers can interpret that something bad is going to happen to Catherine. There are many examples of foreshadowing throughout this novel. These examples help the readers infer what will happen in the upcoming chapters. Throughout the novel Catherine kept on insisting thats she is afraid of the rain. She tried to deny it, however, she knew she was terrified of it and she could not deny it. In chapter 19 she states, Its all nonsense. Its only nonsense. Im not afraid of the rain. I am not afraid of the rain. Oh, oh, god, I wish I wasnt. While reading this quote, the reader can feel how scared Catherine is of the rain. She believe that should would see herself dead in it. For example, on page 129 she told Henry, Im afraid of the rain because sometimes I see myself dead in it. This quote foreshadows the upcoming event of her death. After Catherine and her child die, Henry walks out of the hospital and walks home in the rain. In the last chapter of this novel it is stated that It was like saying goodbye to a statue. After a while I went out and left the hospital and walked back to the hotel in the rain. Catherines thought of seeing herself dead in the rain mostly came true because she died while it was raining. Catherine also stated that she has lost many loved ones prior to meeting Henry. This fact from Catherines life made the reader predict something bad was going to occur to the couple. Another form of foreshadowing is Catherine always telling Henry and saying that terrible things were going to happen to them. The feeling of melancholy is permeated, or spread out, throughout the novel. This feeling affects the readers perception of the story, the characters, and the outcome. This feeling of complete sadness that roams through the novel when u read makes the reader infer that an unhappy and sorrowful even will be coming up. It changes their views on the story, characters, and outcome because it gets the readers prepared for a sad ending. If this novel did not have the melancholy feeling that Hemingway portrays, then the readers would not be prepared for a sad or disappointing outcome. Hemingway provides the readers with hints of the finals chapters by foreshadowing and using the feeling of melancholy to make the tragic event of Catherine dying in childbirth predicta ble.

Rhetorical Analysis Of Florence Kelleys Speech On Child...

Guilt and lack of empowerment can cause people to stand up for what they believe in. Florence Kelley, a successful social worker delivered a speech in 1905 for the National American Woman Suffrage Association at Philadelphia. Passionately and pointedly, Kelley persuades her audience that if women were allowed to vote, then child labor laws could be fixed. Initially Kelley conveys her message about the corrupt child labor laws by criticizing the practices of the states in a way that incites change by using examples and rhetorical devices. She begins by providing specific evidence of child labor statistics to add to her credibility. Explaining that â€Å"two million children under the age of sixteen† are working just to survive, alludes to the†¦show more content†¦Kelley accentuates white girls in hopes that her audience will imagine their own daughters in a similar situation and feel they are to blame. Throughout the first half of her speech, Kelley uses rhetorical dev ices to elicit the feelings of sympathy, remorse, and pity to persuade her audience. Using extensive details, she illustrates the harsh reality of what the children go through. She expresses that tonight while they sleep â€Å"several thousand little girls will be working in textile mills, all the night through, in the deafening noise of spindles and the looms spinning and weaving cotton and wool, silks and ribbons† for the audience to buy. She intentionally mentions items of necessity and luxury to relate to the poor and wealthier people she is speaking to. She uses rhetorical stances to emphasize her point by listing all the items the children make throughout the night that her audience members have most likely previously purchased. Going into detail that â€Å"the children make [their] shoes in the shoe factories; they knit [their] stockings, [their] knitted underwear† and continues by adding that they are â€Å"little beast of burden, robbed of the school lifeâ⠂¬  so they can work instead. With these rhetorical stances, she evokes the feeling of guilt within her audience. By painting this picture, she reveals the grim truth that these children are forced to live by due to the

My Experience at the Animal Shelters Free Essays

These are my experiences while visiting both animal shelters; first I visited Orange County Animal Services. When I came in I realize there were people standing on line waiting to talk to the clerk to tell her their business in the shelter. While waiting on line I observed this two young girls in front of me very excited that they were adopting a dog, when they got to the clerk they told the clerk that they had choose a dog and were ready to take him home, the first question from the clerk was what’s the cage number, but they didn’t know the cage number So the clerk told the girls to go back and check the cage number, soonest they left it was my turn to tell the clerk my business at the shelter. We will write a custom essay sample on My Experience at the Animal Shelters or any similar topic only for you Order Now I told her I was there from school and it seem like she has got a lot of those visits because before I could finish she told me the best way to get around the shelter, so I wouldn’t miss anything. She told me that after I was done to come back to her and she would have a brochure signed and ready for me to take. I started walking down the hall and the first thing I saw was a table with some pictures of what I suppose is people that work or volunteer there, with dogs and cats from the shelter; the table was decorated with some dog or cat toys. I kept walking and started hearing barking I was getting closer to where the dogs are. As the barks from the dogs were getting louder I looked around at the walls of the hallway they had pictures of dogs and cats with their happy owners that had adopted them from the shelter. Almost at the end of the hall there was a whole wall of pictures with dogs that were missing from their owners, they all looked so happy in the pictures I counted 18 pictures of dogs that were missing from their owners, after I had reviewed and counted the pictures of the missing dogs. I continued walking down the hall and got to the first door because there are two doors to get to the actual place where the dogs are kept. As soon as a walked in I saw the two young girls from earlier, they were getting the info that the clerk needed to continue with the adoption procedure; the dog they were taking was the first dog in the left. I wanted to ask them some questions but they seem to be so exited and in such a rush that I decided not to ask them anything, regardless I saw the dog they were adopting his name is Gizmo he is a five month old male pointer/bloodhound mix he is super happy and riendly I took a picture with my cell phone I kept walking by the cages looking at the dogs trying not to overdo it because I couldn’t stop feeling bad that they had no home and no master to wag their tail to, even though they all seem to wag their tail to very person that passed by and they tried to look as happy as they can under the circumstances, is like if they knew that th ey had to look their best because one of those person passing by could potentially by his or her new master There were about 60 dogs in house on that day, after walking by all the dogs. I went to where the cats are kept. Where the cats are kept is divide it in three parts, two small rooms were in the front to the left and right side. In the middle was the entrance to the bigger room where most of the cats were kept in small cages, that were all around the room, most of the cages had cats in them some of them had two cats in it. There were two women that were working as volunteers; I asked them a few questions. They told me there were about 60 cats in house at the moment they didn’t know the number of cats and dogs that get adopted but they told me it was high if not 100% In that particular animal shelter, they also explained to me what the two smaller rooms are for. The one in the right side was for letting that cats stretch out and do exercise. The other room on the left was for the people who wanted to adopt a cat, could get to know his or her new cat better. After I was done walking through the shelter I went back to the clerk in the front. she had a brochure sign and ready for me to take, I came out from the first shelter and went in to SPCA of central Florida, which was a little confusing to me because it looked like a store, I asked the clerk and she told me I was in the right place, that was the entrance she told me which was the best way to get around the shelter and told me when I was done walking around to come back to her so she can give me a signed brochure. I found that both shelter are the same but different this one had fewer dogs and they looked to me bigger than the once from the other shelter they had about 40 dogs in house at the moment. After I was done with the dogs, I went to the cat section and to my surprise it was a lot bigger than the other one and had different rooms for different thing, there was a section for sick cats, for healthy cats, for cats that are going home, for cats to know their new master, and for wild cats. I talked to Sherry a nice lady that works there and had the patience to walk and showed all the cat places I mentioned. I ask her about cats and dog adoptions and she told me it was a lot higher for dogs than cats at this shelter, I asked why and she said many different reasons, but mainly because they in house so many wild cats, that made me feel sad because I saw the wild cats and they are just as beautiful as the rest of them I took a picture of a wild cat that I saw at the shelter I will include in this report. After I was done walking the whole shelter I went back to the front desk clerk to collect my brochure and that’s the end of my walk in two Orange County Shelter, I hope you have enjoy reading it as much as I enjoy making it. How to cite My Experience at the Animal Shelters, Essay examples

The Various Aspects of Leadership Styles

Question: Describe about the the traits or character of specific leadership styles? Answer: Introduction This paper described the various aspects of leadership styles. The main objective of this paper is to evaluate the traits or character of specific leadership styles. Indeed, leadership style provides a route, executing plan and encourages people. The purpose of the firm explains which leadership style fit for the organization. Some organizations offer different kinds of leadership styles within the firms and its depend on the essential task to fulfill and departmental desires and needs. Transformational, Transactional and Charismatic is the main leadership styles that are used by the most of organization. Out of them, we would select the transformational leadership style. This style concept was first introduced by James McGregor Burns books in the 1978. Indeed, transformational leadership styles occur when one or more person link with other such as leader and followers increase one another to higher levels of ethics and encouragement. This kinds of leadership is proactive that new ex pectations in follow. It creates learning opportunities for their followers challenges to solve problem. (Lentz, 2012) These are the main traits or characters of the transformational leadership styles that are following below: Internal motivation and self management: Motivation ensures that your values are adjusted with the firm. It motivate follower to work for objective that beyond its desires or needs. (Hogg, 2012) If leaders motivate the internal employees of the organization then it helps to raise the organization growth and development. Internal motivation raises the employees moral and confidence. Due to internal motivation and self management skills they are able to make positive changes in the organization that helps to organization succeed. Potential to take difficult decision: It is main skills of leaders that handle the difficult decision in the organization. Transformational leadership doesnt avoid or delay tough decision. Difficult decisions became easier when its attached with clear goals, vision, values or goals. Further, it is main character of this leadership style that take difficult decision. So, it is able to make change in their organization. Evaluate your arrogant: when you are appointed in power position then we need to evaluate the arrogant level of your mind. If you are leader in the company then you need to encourage the best output from others within the firm. If organization will rise then you as a leader also get succeed. However, arrogant is the sign of business crisis. It does harm the business growth. Ability to take right risk: It is very important character of this leadership style to take right risk as per organization desires or needs. Risk plays an important role in the organization. So, anyone can take a risk according their requirement. Transformational leadership has ability to take calculated risks that often not provides positive way. Trust on your aptitude as well as your group to collect the essential talent it significant. Organizational consciousness: Transformational leadership styles share the collective conscious of their company. Those values are linked with firm and they share multipurpose with firm and dont view their position in the firm as a job. (Nayab, 2010) Further, if organization will be aware about the organization needs then it would take well-being decision for their workers or employees. This leadership styles has potential to alert the organization about the requirement of the company. Adaptability: Transformational leadership styles are deciding to adopt and always looking new way to respond fast movement in business environment. They knew that they will be passed through their competitor that means they are broad-minded to change. However, adaptability skills of leaders may be positive or negative. If leaders have potential to handle new ideas or thought that is provided by their employees or worker. Then, they should adopt this leadership character that affects the organization succeed. In the global competitive market, customer needs variety in product or services so leaders must adopt new technology that can fulfill customers desires or needs. Force to listen and entertain new thought: Transformational leadership style understands that growth and development is a team effort that willing to open ideas from all levels of their firm. It creates design to listen to their group and incorporate their insights. This leadership style has listening character and accept new idea from their colleague or subordinates. If leader will provide rights to express their idea or thought then it will raise employees or worker morale and confidence and they will take interest to raise organization productivity and profit margin. (Iqbal, 2011) In the global competitive market, customers desires or needs is changing constantly so we need to make change in our policies so new idea or thought of the employees or worker will be helpful in the organization success. Inspirational: It is significant character of transformational leadership style that helps to make beneficial change in their organization. People want or desire to be motivated. Transformation leadership style has potential to raise them. It is not only comes from motivational speech, but also treating individuals and taking the time to understand what encourages and inspires their team. (Nayab, 2010) In the global competitive market, inspirational skills play an important role because it raises employees morale that increases productivity of the organization. Due to inspirational leadership style we can raise organization in the worldwide level. Proactive: This is main character of this leadership styles that it is proactive decision maker. This leadership style doesnt wait for other to take decision and they react as per their decision. They are always ready to take risk, adopt new things and take new approach to developing the firms. Although, they knew that how to handle risk and take decision that are backed by research. Visionary: It is concise and realistic vision, mission and values that fit the culture of your company. Transformational leadership style has potential not only to negotiate the mission, but also get every people to purchase and work passion and clearly forcing the direction. (Hogg, 2012) Further, this leadership style has clear objective and goal that affect the organization growth and development. Conclusion From the above discussion, it can be concluded that clear and effective character of the transformational leadership style as well as high ability to adopt new idea or thought helps it to maintain its competitive position in the worldwide leadership field. References Gerome, S., C., (2008). An Examination of Relationships Between Transformational Leadership Behavior and Interactive Justice Perceptions Among Membership of a Local Chapter of Human Resource Professionals. USA: ProQuest. Hogg, B., (2012). 10 Characteristics Of Transformational Leaders. Retrieved from: https://www.billhogg.ca/2012/03/10-characteristics-of-transformational-leaders/ Iqbal, T., (2011). The Impact of Leadership Styles on Organizational Effectiveness. Germany: GRIN Verlag. Lentz, K., (2012). Transformational Leadership in Special Education: Leading the IEP Team. USA: RL Education. Nayab, N., (2010). Characteristics of transformational leadership. Retrieved from: https://www.brighthub.com/office/home/articles/71743.aspx Syndell, M., A., (2008). The Role of Emotional Intelligence in Transformational Leadership Style. USA: ProQuest.

Lock Free Binary Search Algorithms †Free Samples to Students

Question: Discuss about the Lock Free Binary Search Algorithms. Answer: Introduction: Recent researches oriented around the concurrent search tress that is a binary search tree best be described as a graphical presentation in which nodes follow up with specific components with left and right sub trees. The research and evaluation on the concurrent search tress has provided the necessary solutions, which is directly dependent on either the locking segments of the data framework or the exhibit suboptimal memory utility. Trees are not as significant to be placed parallelized segment for the fact that they comprise multiple networks of mutable sectors per node but the overall search that is a time relative issue compared with the simpler existing structures as such the linked lists properties creates a demand for them. Utilizing certain component, in this report a binary search tree, parallel in nature is created. The components so used are single-word reads, writes and the compare-and-swap. Accordingly, following this algorithm operations are only contend at the instance s wherein, the concurrent updates are seen to affect the similar node/ nodes. Updates are relatively non-blocking for the fact that the present threads are capable of accomplishing the operations based on the correlations among them and each of the performed operations is linearisable. Evidences based on various experimental methodologies reveal the mentioned process to be faster as compared to the alternative solutions and proves to be scalable compared to the large numbers of concurrently threads set to execute. This, in majority scenarios, outperforms the concurrent skip enlistments as set to test. Testifying, it shows or reveals that there is 65% more throughputs in the instance of the performance difference is averaged in each experiment. Additionally, relative memory prints are smaller compared to the other examined structures. The present CPU configurations have achieved a relative stagnant level in relevance to the single-threaded throughputs; with evolution in the configuration of chips, which in turn provides smaller increments. The designers of the hardware have intended on the increment of the processing units per CPU arrangement. However, this introduced the necessity of improved algorithms that would be efficient enough to utilize the developed processing resources (Howley, 2012). Multiple threads should be capable of communication and synchronization proactively as an unit through the shared data structures present in the memory. The efficiency relative to these Data Structures might prove to be beneficial and crucial to the evaluation of performances while the relevant designs are considered difficult (Ellen, 2014). When, there is a presence of high value thread inter-leavings makes the configured algorithm to be difficult to be considered. An efficient measure oriented around the concept of unblocking or as mentioned, utilizing the term lock-free is an implementation surrounding a shared object to make it easily accessible to the contentious proceedings. This systemized strategic implementation provides the guarantee of the system to progress even in the presence of one to multiple thread failures. This can be conceptually put forward that the shared object is protected from any further access relative to any lock-related limitations. These limitations enlist the priority inversion, deadlock and convoying (Crain, 2013). In this report, an algorithm is introduced for a relatively binary search tree (BST). This proves to be compatible with the other available systems based on the reliance relative to the commonly adaptable and available operations. These common components are: Word reads writes and compare-swap (CAS) concepts (Crain, 2013). Traversing the structural tree is possible only in the space of read only memory without interfering with the concurrent updates available. Majority of the updates oriented towards the internal structure of the tree system is potentially tolerated without any triggering towards rebooting. This report in a descriptive manner provides the algorithm configuration and the relevant operations of the same followed by a detailed evaluation of a C++ configured implementation in the upcoming sections. The report advances with the further briefing of the management issues and the much-required solutions to them, put forward as efficient measures. Consequently, a proof schematic relative to the non-blocking operation and linearisability properties would be discussed. This is a well-known fact that the constructed algorithm serves a good throughput as compared with the set of concurrent algorithms and this is recorded to be better in the context of scaling with the increment in number of threads (Park, 2012). This algorithm is set with a specific configuration to benefit the data structure interface set in an abstract framework. A set is recorded to comprise a set of unique set of keys with relevant valuation oriented with specific methodologies and conditions. The consists of instructions likely as to: firstly, concerning the addition of a key (k)n to the existing set of which it is still not a part, the instruction add(k) is applied. Similarly, the removal of any key from the oriented set remove (k) is instructed, when the same is already a member of the targeted set. Another important or major examination lies on the grounds to identify the existence of a variable or a key in the set; this uses the instruction contains (k). The core orientation beneath the data structure is based on the BST. Describing the BST in details, the attention lies on the fact that it is a detailed tree structure consisting of the binary components. Such is the consideration that if the dedicated set contains N nodes, then supposedly, the left sub tree should consists of nodes lesser that the N number and it is vice-versa for the sub tree on the right end of the set. A BST takes an estimated time interval of O (log n) averagely while in the worst scenario it takes about O (n). This algorithm can be stated to be non-blocking thus ensuring a system-wide throughput even on the stances of thread starvation. This also serves the benefit of linearisable, which reveals the fact that operations are executes effect at a certain level. Regarding any concurrent executions, the sequence of these linearization points sets the sequential history, which in turn cohesively collaborates with the expectation level of response from the implemented object (Braginsky, 2012). Typically, a recorded issue surrounding the implementation of a tree infrastructure with the combination of CAS seems to be a limitation surrounding the changes or transformations to the multiple child pointers in an automatic way (Cao, 2016). The pointer system however makes it quite difficult for the utility of the algorithms. When it is surrounding the Harrys pointer markings as it presents chances, wherein, a child pointer has a probability of getting marked while the node is combined to a different child pointer (Cao, 2016). The tree infrastructure in usage holds the potential to reflect on the sequential BST with the addition of attribute of operations in each of the node. This field is utilized for the storage of details surrounding the live updates to the node and prevents any generation of updates from another contemporary operation until the completion of the same. Following to this an insert is conducted through the process of inclusion of information relative to the next thread for the completion of consecutive operation in the infrastructure. Following this the copy action linked to the pointer into the operation field of the node for receiving a new child. On updating the operation field there is no chance of failure in terms of the operations and thus, can be logically estimated to be inserted in the structure. CAS is the only component to update the operation field and can only fulfill the status relative to the operations only when satisfied on verification. This provides a limitation on the operations to interfere among each other (Drachsler, 2014). Removal of node with lesser than two children is a direct action, which in correspondence is marked on the operation field of the node with the respective key. While a feature that is notable is the irreversible process of removing the key. While to regain the access over the key or any key for that instance, the insertion instruction can be utilized over the parental node with the intention to complete the physical process of removal. Presenting or evaluating the major limitation towards the parallelization is the procedure of removal of nodes with two children. In the instance of removal of one node and the identification of this necessary action is followed by the allocation of the next largest or the smallest key. Thus, the one, later allocated, replaces the key belonging to the former node and thus, the later node is removed from the tree structure. However, this action could possibly generate two major problems : firstly, availing updates for both the nodes tends to be atomic and secondly, there is a requirement to detect the any invalidated search relative to the keys in the higher position in the tree(Drachsler, 2014). Copying the necessary data required for the updating the former node is done and following that a reference is framed on the operation field of the targeted node in the oriented tree structure. This update framework prevents any further interference to the target-node. Following the success relative to the set objectives, the former node is cleared and the targeted node is marked with the operation. There exists a major conditionality corresponding to the replacement of node-key: if this is a result of removal of any existing key then it direct set an evaluation on the range of keys that can be contained in each of the sub-trees. This can be put forward with a specific formulation explaining that the replacement by a larger key ensures the expansion of the left sub-tree while the range for the right sub-tree is reduced. The opposite result is at the instance of an opposite action involved in the operation field of the nodes. With the traversing searches of the node there are simultaneous implications. Expansion of the ranges according to the action would not have any direct effect on the search, as the key corresponding to the intended search is still contained in the sub-tree but ht reduction to the range might be required for the rebooting (Mariano, 2015). A particular instance of the structure tree is capable of sustaining only one out of the smaller and the larger replacements and is not efficient towards both simultaneously. Modifications concerning the actions relative to the simultaneous support to the replacement methodologies as well as the ABA prevention mechanics is a critical requirement for the development regarding the protection of the key field consisted in the node. The enlisted set of implementation automatically replaces a particular key with the available largest key; this reflects the requirement for a run-check on the last node. The proper child link was required to be considered for any intended changes (Lowe, 2016). Detailed Description: This section of the report contributes in the detailing out all the necessary components as required for briefing the actual design of the algorithm that was enforced in the main content of the report with the utilization of specific instructions corresponding to the necessary actions for the operation fields of the respective nodes. This section is presented through the representation of multiple sub-sections dedicated to the description of respective structure and the major components. The various classes that is a substantial part of any C++ programming structure can be witnessed in the figure 1 presented in this section of the report. The node class can be placed in close reference with the a sequential arrangement as for a typical BST; only additionally there is the presence of an operation field, which can be significantly used to detect any changes initiated a the nodes of the tree structure (Miller, 2015). As per the concept of a 32-bit data system, dedicated to the memory storage only returns the allocation addresses on a 4-byte boundary structure with two least significant bits, which are structured to store the auxiliary data. This is the most commonly used methodology regarding the simultaneous use of the CAS based on the pointer values. This technique specifically is dedicated to the storage of four different node change states: Firstly, the storage state- NONE: this indicates the absence of any operation, secondly, MARK: indicates the absence of any node key and accordingly instructs to remove the node physically, thirdly, CHILDCAS: one of the many child pointers gets modified. Finally, the state, RELOCATE: one of node is affected owing to the relocation. There are few macros present in the algorithm presented in the figure for the modification of data. There are a few enlisted instructions set, each dedicated to the certain phase of the structure of operations. Firstly, FLAG (ptr, state): this command instructs to set the operation pointer accordingly, corresponding to one of the pre-mentioned state of storage. Secondly, GETFLAG (ptr)- performs a stripping action of the pointer data to collect the state information. Thirdly, the UNFLAG (ptr): this instruction rips off the state bits ensuring the the pointers are intact. The left and the right pointer have specific and customized values to indicate the presence of a null pointer as this can initiate a ABA issue and accordingly set a valid node and the node is ready for a removal and the pointer is reverted to a null reading (Silver, 2016). The mechanism to restore the null values is used for the retention of pointer data. Simultaneously, set a low order bit to identify the presence of any null pointer. This way this methodology ensures that each null pointer is unique for the operation field. Other two macros parameters: SETNULL (ptr) and ISNULL (ptr) are utilized to configure the null bit of a node pointer and to identify the the presence of any null pointer in a respective manner. A node can be initialized with the characteristic right and left pointers. The entire set up of a node is mutable only the features such as the key, right and left are set to the probability of modification on the stance when the operation is already set on the op field ( David, 2015). The instruction set as CHILDCASOp comprises enough information regarding the next present thread corresponding to the completion-operation linked with the modification of the child pointers of a specific node with few information of conditionality surrounding the change of the pointers and necessary details. An active state of this instruction is flagged with the CHILDCAS state in the operation field (op) of the nodes (Howley, 2012). Similarly, the instruction RelocateOp object withholds enough information regarding the removal of any key of the node comprising the two children and performs a replacement with the next available largest key. This instruction too needs the details for the designated action as the need and the addressed field subjected for the removal action. Again, this instruction if flagged with the RELOCATE state in the corresponding operation field of the node. The purpose is well established previously. The tree class is not listed while it contains the relative features:; node object, the root, corresponding to which the right sub-tree with the child field indicates logical root of the tree structure or it corresponds to the null value when the present structure is empty. This is subjected for the simplification regarding the implementation actions (Liu, 2012). The associated CAS operation comprises majorly three parameters: the accessible memory location, location value (expected entity) and writable value (compatible with the expected one). According to the positive or negative execution result, a boolean bit is returned to the main program or the operation field of the node. Alternatively, a VCAS value is utilized recorded to return a stored value of the memory prior to the attempted operation. On the instance of the absence of the same, it is applicable to the user to use the CAS value (Ramachandran, 2015). The tree structure contains few components, which are essential to mention as a descriptive approach towards the article. These are presented in the following sections of the report. Contains (k): The operation related to this instruction reveals that it utilizes a find method to locate the position of a key initiating from an estimated starting point. This point is auxRoot. The position information is obtained and stored in the corresponding variables predOp and currOp. The result of the related search is contained in one of the four values presented as- FOUND, NOTFOUND_L, NOTFOUND_R and ABORT. These values predict the necessary situation according to the key position and valuation condition (Silver, 2016). The search for a particular key initiates with the basic initialization of the variables curr, currOp,next, lastRight and lastRightOp prior to the traversing of the subjected loop. Each of the variables oriented within instructions are designated to perform a definite function such that the next is used to locate the succeeding node in the path directive. While the other curr-instructions are used for the maintenance of the record relative to the last node respective to which the child path was adapted (Timnat, 2014). The search loops progresses its action through the nodes, considering one at a time till the key is discovered or the relative null point is obtained. As presented in the proposed algorithm, it reveals that at first the ongoing action is completed and then the search gets rebooted. This is a proposed mechanism for the reduction of any complexity and special cases to be considered (Zhang, 2016). Add (k): this instruction introduces the methodology for the addition of a key to the set in the nodes. The instance of verification indicating the non-necessary bonding of the key to the tree structure and the new insertion point for the same is discovered an entirely new node along with the ChildCASOp gets created for the insertion program. With the utilization of the CAS instruction, insertion of an operation is done to the currOp field relative to that a key point can be evaluated to be logically inserted. There are otherwise, present few indications with respect to the succeeding CAS revealing that curr-operation field is yet to be modified, since it was subjected for read and thus indicating few additional changes to some other fields. In this case, the helpChildCAS does the major part of the insertion segment for the node to the tree structure. Any thread encountering any operation in the currOp field can call for this. Remove (k): the instruction for the intended removal of a key once the correct node has been located among the chosen paths. Specific considerations are instructed, depending on the number of children present for the node paths and the operations are simplest for the path with less than two children. In the instance, where, the CAS needs to change the operation state of the curr-field, there is a need for the removal of the key from the set. At this instance, the requirement of this instruction can be clearly stated (Natarajan, 2014). It utilizes the ChildCASOp for the replacement of pred-child with the curr. This is done categorically with a null pointer or a pointer present in the curr. In case of the requirement of the guarantee for the marking associated with a node before the returning of the marking operations another call instruction can created to find the key using find(k) in case the CAS fails. A successful CAS value reveals that the relocation operation probably does not f ail at this very stance it can be precisely estimated that the key is removed from the structure. Optimizing traversal: the optimized action relative to the find instruction ignores or eliminates any present operations that is being performed in the in the duration of the search but still it is a priority to return any key without any adhered operation to it. This is can be evaluated with the help and retry mechanism that identifies any ongoing operations (Lowe, 2016). The back track gets stored during the traversal phase. In this phase, a chain of previously and logically deleted nodes could be traversed in a obvious manner depending on the memory management relative to the physically removed nodes, calling for a verification to detect the logically deleted node before any further operation. However, this optimization mechanism violates the theory of guarantee associated with the pred observed on the return of find, claiming it is free of any operation. This has an attached issue for the removal action of the nodes. While a search traversing a maerked node or ChildCASOp in predi cted to be safer in a natural basis as they cannot affect the validation relative to the search outcomes (Miller, 2015). Updates in the presented and the proposed algorithm are non-blocking as the threads are capable of performing and supporting the contemporary operations and actions at the necessary instances and thus, as a result, each of the operation is linear sable. The linearisability is executed in the chosen algorithm for the report with the precise definition for linearsisation points reflective to: add, remove and contains instructions for the operations field of the nodes. A deadlock situation refers to the situation wherein, more than two threads are blocked in a permanent way (Drachsler, 2014) With the corresponding consistency maintained in the sequence of the ordering, in reference to the locking and un-locking of the threads, the deadlocks when present unlike this one, can be avoided. Thread Starvation reflects to the situation wherein, different threads compete for a single mutex and only a single one gains the benefit (Mariano, 2015). The algorithm briefed in the report reveals the fact that a non-blocking algorithm as such, provides a guarantee that the system will comprise a wide system bearing the consisting the throughput even if there is a presence of thread starvation. There is a show of linearsiability, which in response to any concurrent execution presents a sequential history in relevance to the implementation object. However, there is no guarantee in an instance when a thread is lock free for less than a nanosecond. In this instance, the other thread has probably no chance for acquiring locks. To prevent this very concurrency, the utilization of a thread yield function, this reschedules the order of the thread execution. This parameter thus, enables a fair locking system for the threads accumulated at the mutex. However, this is dependent on the scheduler implementation of threads(Cao, 2016). Search trees as in this case provide the solutions related to the concurrency that is relative to the locking parts or display the memory usage. These search trees are traditionally non-trivial to parallelism due to the presence of multiple mutable fields per present nodes. The search trees relatively consume time similar to the simpler structures such as linked-lists (David, 2015) updates relative to these search trees are no-blocking as the threads complements each others activities or operations and maintains linearisability. There are evaluated evidences that present the fact that the operation system is fast as compared to the alternative solutions and are scalability is present in large numbers in the execution of concurrent threads. This is witnessed to outperform the concurrent skip lists and there is 65% more throughput. The memory management implementation claims no extra space for each node but in the case of hazard pointers, five protected object pointers are necessary for each of the threads (David, 2015). Related Work: Majority of the list-based data structure adapted successfully in the concurrent and non-blocking form are oriented on the basis of the methodology of two-stage node deletion mechanism as enlisted utilizing the compare and swap to precisely indicate the specific pointer (Crain, 2013). For the search trees, the data structures included in the same comprises of multiple links and hence, the direct application of the mentioned method is not possible according to the Harris proposed mechanism. In this instance, the Software Transactional Memory is a worthy tool in resolving the issues and provides a parallelizing data structure to availing the updates to multiple memory locations (Brown, 2014). Additionally in this concept, a contention management is required for deciding the sequence of transaction. STM proves to be beneficial as it outperforms to provide the solution as compared to the simpler locks set to protect the data structure (Brown, 2014). In a thesis presented by Fraser, regarding the lock-free implementation concerning the internal system BST that comprises the usage of CAS that utilizes the descriptors to estimate and avail the amount of memory locations that requires a session of updates. On the removal of a node with two children demands eight automatically updated memory locations that provide a commendable overhead to the BST algorithm (Park, 2012). Another proposed theory reflects on the first ever developed and practically approved model for the non-blocking external BST (Howley, 2012). Barnes method of cooperative updates is applicable for changing the routing nodes. A link containing all the details about the updates is technically copied into each node subjected to modifications. In this instance, if any thread is available can potentially be a part for the completion action prior to the creation of the new threads (Chatterjee, 2014). Another relative theory is descriptive about the relaxed balance AVL is utilized to manage updates available per node but it avoids the issue of locking large segments of the tree structure during the process of removal and replacement. Basic improvements relative to the adjustments succeeding the updates made to balance the structure. This method has experimentally shown to bear the negligible increment in the node numbers (Ellen, 2014). A theory by Pugh presented the skip lists, which is an alternative to balanced tress. At the base level, this system comprise of a linked list whereas, the base nodes have a considerable chance of containing extra standards of relative node links (Natarajan, 2014). The optimized structure as is briefed earlier provides a complex time structure for the location of nodes and henceforth, is placed at BST at times. Conclusion: This report is based on the findings and the propositions of the provided article, which solely highlights a non-blocking internal binary search tree that has though informally, has proved the data structure to be linearisable. Replacement relative to an internal node does not prevent any access to the other nodes out of the procedure of removal or replacement. The outcome of the experiment presents a positive concurrent performance when compared to the other present ordered sets. The algorithm proposed in the article is extremely memory efficient as compared to the other algorithms in consideration of large data structure. At the instance of comparison, with a lock free external BST, this proposed algorithm outperformed in every possible way providing 65% more throughput as compared with the other AVL trees and lock free skip lists, which are losing the potential for competitiveness. The experiments in the proposed paper utilized the keys, generated randomly (Braginsky, 2012). This provides the benefit relative to the proper balancing of the tree structures. In worst scenarios, while the keys are inserted in an ascending order a tree is expected to perform like a linked list, wherein, the balanced structures are expected to execute in a better way. The proposed paper has put forward an excellent lock-free memory management tom the tree using a methodology of CAS (a single word system), which demands no memory space per node. Bibliography Braginsky, A. Petrank, E. (2012). InProceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures. Brown, T. E. (2014). A general technique for non-blocking trees. (Vol. 49). Cao, H. G. (2016). MagicDetector: A Precise and Scalable Static Deadlock Detector for C/C++ Programs. Arabian Journal for Science and Engineering , 5149-5167. Chatterjee, B. N. (2014). Efficient lock-free binary search trees. InProceedings of the 2014 ACM symposium on Principles of distributed computing , 322-331. Crain, T. G. (2013). A contention-friendly binary search tree., (pp. 229-240). David, T. G. (2015). Asynchronized concurrency: The secret to scaling concurrent search data structures. (Vol. 43). Drachsler, D. V. (2014). Practical concurrent binary search trees via logical ordering. (Vol. 49). Ellen, F. F. (2014). The amortized complexity of non-blocking binary search trees. Howley, S. V. (2012). InProceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures. Liu, W. (2012). Research on cloud computing security problem and strategy. InConsumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference , 1216-1219. Lowe, G. (. (2016). Concurrent depth-first search algorithms based on Tarjans algorithm. International Journal on Software Tools for Technology Transfer, , 129-147. Mariano, A. B. (2015). Parallel (probable) lock-free hash sieve: a practical sieving algorithm for the SVP. InParallel Processing. Miller, G. L. (2015). Improved parallel algorithms for spanners and hopsets. InProceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures , 192-201. Natarajan, A. Mittal, N. (2014). Fast concurrent lock-free binary search trees (Vol. 49). Park, S. V. (2012). A unified approach for localizing non-deadlock concurrency bugs. . InSoftware Testing, Verification and Validation (ICST), 2012 IEEE Fifth International Conference , 51-60. Ramachandran, A., Mittal, N. (2015, January). A fast lock-free internal binary search tree. InProceedings of the 2015 International Conference on Distributed Computing and Networking(p. 37). ACM.. Silver, D. H. (2016). Mastering the game of Go with deep neural networks and tree search.Nature. Timnat, S., Petrank, E. (2014, February). A practical wait-free simulation for lock-free data structures. InACM SIGPLAN Notices(Vol. 49, No. 8, pp. 357-368). ACM. Zhang, D., Dechev, D. (2016). A lock-free priority queue design based on multi-dimensional linked lists.IEEE Transactions on Parallel and Distributed Systems,27(3), 613-626.