My Philosophy of Education Essay - 767 Words

My Philosophy of Education My philosophy of education and my personal goals and theories about how students are empowered through their educational experience revolve around the student-centered, interactive approach to instruction and learning. My goal as an educator is to create a learner-focused environment that promotes the basic literacy skills - reading, writing, listening, speaking and thinking. Children are readers, writers, and thinkers who need language to question and understand. They become members of literate communities using language in real ways for real purposes. Through my own classroom research, I have learned to listen to children, to observe the multitude of ways in which they learn, and to examine the†¦show more content†¦I hope as individuals, they will be caring, compassionate, respectful and understanding of social and cultural diversity. In more specific terms, I hope as readers and writers that they become individuals who find pleasure and satisfaction in reading and writing. I hope that they make these activities an important part of their everyday lives, voluntarily engaging in reading and writing for their intrinsic social and personal values. I hope that they use language to understand themselves and others to make sense of their world and as a means of reflecting on their lives. I hope that they leave the classrooms as individuals who know how to read, write, speak, and listen effectively as a competent and influential part of our society? and our future generations. As an educator, I will be committed to a lifetime of learning. In today?s world, it would be impossible to be an effective teacher if learning ended when a degree is earned. I believe a teacher?s mind should always be open to change, and methods of teaching should be new and different. I hope to instill in my students a love of learning and a thirst for knowledge. I plan to use collaboration and diversity as important aspects within my classroom. Collaboration is important if we hope to enhance our educational programs for students. With many schools using inclusion, successful collaboration among professionals is vital. Successful collaborationShow MoreRelatedMy Philosophy On The Philosophy Of Education844 Words   |  4 PagesIn mathematics, as in life, everything must be brought to the simplest of terms. I base my teaching philosophy on the foundation that every student is capable of learning mathematics. I will strive, as a teacher, to ensure that my students are able to have a strong foundation of mathematical skills when they leave my classroom. Some students believe that they are not mathematically gifted; therefore, incapable of learning mathematics. I believe to the contrary, all students with motivation, sustainedRead MoreMy Philosophy On Philosophy Of Education852 Words   |  4 PagesMy Philosophy of Education My philosophy of education is founded on a belief that all students have a desire to learn and to feel accepted. Learning takes place when students are able to have their specific needs meet inside the classroom, to feel accepted in the environment, and find the learning to be meaningful. I believe that before learning can take place a proper educational environment must be present inside the classroom. In order to make any classroom work I believe you need meet three criteriaRead MoreMy Philosophy Of Education As A Education864 Words   |  4 Pagesdifferent philosophy of education, and what purpose education serves in a child’s life. The five philosophies of education that we recognize are: Essentialism, Perennialism, Progressivism, Social Reconstructionism, and Existentialism. I would most recognize my philosophy of education as Essentialism. Essentialism has been a dominant influence in American education since World War II. It focuses on core curriculum of traditional academic topics. I believe that the purpose of education is teachingRead MoreMy Philosophy of Education824 Words   |  4 Pages13 February 2011 My Philosophy of Education I believe that progressivism educational philosophy most closely matches my educational ideals. In my opinion based on the progressivism educational philosophy, the purpose of education is to enable students to learn useful knowledge that has meaning to them in the future. Thus, the most useful education for students is the skill of â€Å"learning how to learn†. When students understand the methodsRead MoreMy Philosophy Of Education And Education1038 Words   |  5 PagesMy Philosophy of Education When trying coming up with a personal philosophy of education, I had to ask myself what the purpose of education is. To me, the purpose of education is to teach students knowledge that is needed to make it through school and to succeed in the world after graduation. Anyone can go into teaching, but not every teacher can teach. Teachers go above and beyond to introduce methods, philosophies, and strategies to help their students learn, as well as, retain the informationRead MoreMy Education Philosophy 1511 Words   |  6 PagesPersonal Mission Statement Education is the imparting and acquiring of knowledge and skills through teaching and learning. As an educator, my personal mission statement is to master my subject area in order to serve as a role model for my students thereby producing students who thoroughly understand the subject matter, and who develop holistically. In order to achieve this goal I must have a set education philosophy with a strong Christian worldview. I must also have a general understanding of theRead MoreMy Philosophy Of Education1056 Words   |  5 PagesPhilosophy of Student Engagement My philosophy of education is that every child should receive high quality education that is inclusive, relevant and meaningful to their life. I am a firm believer of making pedagogy relatable to my students. My vision is driven by my personal experiences with the American school system. I was what is thought of as â€Å"A child at risk†. I am an immigrant, black, Muslim student. My life is transactional as I am a part of multiple marginalized groups. Most of my teachersRead MoreMy Philosophy Of Education And Education864 Words   |  4 PagesPhilosophy of Education Children are the future and their education is the key to our society’s success. When considering this, I realize I have an immense responsibility as an educator. The main focuses of my teaching are active learning, building character within students, and providing meaningful curriculum. I want to create a comfortable setting where every student feels safe to learn. In many ways, my philosophy agrees with the holistic approach to education. I feel this challenges the studentRead MoreMy Philosophy on Education814 Words   |  3 PagesMy Philosophy of Education I think when I made the decision to become a teacher I was not thinking the seriousness of this decision. When we become teachers we also become the molder that will shape our student to be successful in life. But when you decide to become a teacher in a Christian school you are not only shaping this student to be successful in life but we are also shaping their Christian mind to do things with a feeling knowing that they are shape and where made by the image of GodRead MoreMy Philosophy Of Education1015 Words   |  5 Pagesimmediately sparked my interest in becoming an educator and share my personal beliefs on the important aspects of education. In addition to this, I will present various traits I believe are essential and critical for teachers to successfully fulfill their role as an educator. During my elementary years, I developed an urge to frequently ask many questions during the school day. Being able to question anything was astonishing to me. This was because my parents were unable to answer my questions and help

Gun-Free Zones Do Not Make Us More Safe Essay - 2971 Words

GUN-FREE ZONES DO NOT MAKE US MORE SAFE Columbine High School, Littleton, Colorado, 1999; Trolley Square Mall, Salt Lake City, Utah, 2007; Virginia Tech University, Blacksburg, Virginia, 2007; Westroads Mall, Omaha, Nebraska, 2007; New Life Church, Colorado Springs, Colorado, 2007; Pearl High School, Pearl, Mississippi, 1997. All of these, except Colorado Springs were in areas designated as gun-free zones, places where state, federal, and/or private property laws and regulations forbid people from carrying a firearm, except law enforcement or security personnel. The only difference between the first four incidents and the last two is the gunman was confronted by someone else with a gun before law enforcement could arrive. Do you feel†¦show more content†¦Had she been allowed to carry her handgun into that restaurant, her parents might very well have lived to see another day. Six years later in Pearl, Mississippi, Assistant Principal Joel Myrick was walking to his office when he heard the distinct sounds of gunfire in his school. His instincts were to grab his sidearm. However, federal laws banned him from carrying it on school property (Laugesen, 2007). He watched as the gunman leveled his rifle at students and pulled the trigger. As soon as the gunman heard the sounds of approaching emergency responders, he proceeded with his plan by attempting to flee the high school and make his way to the nearby middle school. While police were dealing with the situation at the high school, he would have the freedom to inflict more deaths (Laugesen, 1999). However, in a heroic act, Myrick had run to his truck to retrieve his handgun, hoping he would not have to use it on a student. As the gunman was fleeing in his mother’s car, Myrick leveled his gun at the shooter and caused him to lose control of the vehicle (Laugesen, 1999). In the heat and adrenaline rush of the moment, a properly trained person was able to save untold lives that day at the middle school and possibly other locations. While he was waiting for law enforcement to arrive, emotions could have justified him pulling the trigger, but his training and moral compassShow MoreRelatedGun Violence And The United States Essay1269 Words   |  6 PagesGun Violence in the United States For many years there has been a growing controversy between two sides. The side that wants to take away our right to have firearms and those that want to keep our rights in place. Because of this, gun violence in the US varies from state to state, depending on current gun laws in each individual state. States with the toughest gun laws are the states with the highest crime rates because of a victim inability to protect themselves. One must also remember that CriminalsRead MoreEssay on Teachers Should Be Allowed to Carry Weapons956 Words   |  4 Pagesweapon, how allowing teachers to carry concealed weapons is helping other countries, and why Gun-Free zones aren’t working. Let’s start with the advantages of allowing teachers to carry a concealed weapon. There are three main advantages for allowing teachers to carry a concealed weapon. The three advantages are casualties will be reduced if you could take down the shooter quickly before the shooter kills any more people, teachers can be a tremendous deterrent to crime, and teachers can help stop anotherRead MoreStudents Deserve the Right to Protect Themselves Essay1301 Words   |  6 Pagesright to carry a weapon for years. As of 2014, 22 states do not allow students to carry guns on campus and 22 leave the policy of guns on campus to the schools. The remaining 6 allow students to carry weapons, but not necessarily into school buildings. Only in Utah is a student’s right to concealed carry protected by state law. While the government, state or federal, may not be able to control a private institutions right to ban guns, on public school grounds, students should be allowed to legallyRead MoreCarrying A Concealed Weapon Is The Argument Amongst Most Citizens857 Words   |  4 Pagesa permit to carry a concealed weapon would make citizens feel safer due to the terrorist threats and actions around the world. Choosing a new president, the candidate should have a plan to take action regarding gun safety in America. Being pro-gun; having the right to own guns, would make America a safer place. For example, the United States is the highest gun owner country in the world with a total of 88.8% of gun owners (Norell, 46-52). With the gun owning rate being substantially high, adultsRead MoreThe Problem Of Gun Violence1678 Words   |  7 Pageslistening, and being brainwashed by the overpaid liberal media continually, it is obvious that America is hurting from having these people telling us how we should think. The media is trying to push gun control on anyone that will tune in or read it. The media will all say the same thing, and the problem is gun violence. What if one removes the word gun from gun violence, that still leaves violence. Before one can decide which side to support, the information should be completely researched for importantRead MoreGun Control Persuasive Essay1068 Words   |  5 PagesThere is no question that gun control has been one of the biggest debates for many years and ha s not gotten anywhere. Our country has been through horrific crimes that majorly involve guns. Such incidents that has brought back the controversial debate of gun usage and that has made the government to take reinforcements towards such issue. Is it rightful to carry a gun and hurt an individual whenever it is required? Isn’t part of our rights to bear arms? These questions have been a huge argument betweenRead MoreWhy The Government Should Not Ban Guns1316 Words   |  6 Pagesfew years public shootings have gone up. With this long-standing debate people are reacting and saying guns cause these shootings. Guns do not kill people, people kill people. Not all people are bad in the world, that is why the government should not ban guns. Guns can keep people safe and make people feel safer. In the 2nd amendment in the Bill of Rights, the founding fathers of America gave us the right to bear arms for self-defense. Everyone in America has the right to own a firearm, but you mustRead MoreThe War On Gun Control1296 Words   |  6 Pages English 3 08 May 2015 The War on Gun Control The debate over gun control is one of the most heated debates currently going on in the government, and in the general population of the United States. One side of the debate says that guns are a legal right protected by the Second Amendment, and help to keep citizens safe if they are ever attacked. The other side says that guns are an evil thing, that they are the cause of death and destruction, and theyRead MoreThe Right to Bear Arms and College Campuses Essay1721 Words   |  7 PagesGun control on campuses all across the United States of America has been a controversial and popular debate topic for me ever since I woke up one morning on April 20, 1999 and witnessed, what at that time was the deadliest campus shooting in our history, at that time. Obviously I am talking about the shooting that occurred at Columbine High School in Columbine, Colorado where Dylan Klebold and Eric Harris attacked their school and opened fire on helpless students, brutally murdering 12 students,Read MorePersuasive Essay On Gun Control1242 Words   |  5 Pageskilling his first deer with the same gun he used thirty years ago. The first firearm was made 653 years ago in 1364, to fire the gun, you had to hold a burning wick to a touch hole to ignite the powder, causing an explosion which sends the projectile out of the barrel. Since then, guns have evolved tremendously, in Germany, 1885, the first semi automatic handgun was made, allowing the user to fire shot after shot without reloading, until the magazine is empty. This gun was made for police officers around

LABOR IN AMERICA (2106 words) Essay Example For Students

LABOR IN AMERICA (2106 words) Essay LABOR IN AMERICABy Ira Peck(Scholastic Inc.)The Industrial Revolution was dawning in the United States. At Lowell, Massachusetts,the construction of a big cotton mill began in 1821. It was the first of several that wouldbe built there in the next 10 years. The machinery to spin and weave cotton into clothwould be driven by water power. All that the factory owners needed was a dependablesupply of labor to tend the machines. As most jobs in cotton factories required neither great strength nor special skills, theowners thought women could do the work as well as or better than men. In addition,they were more compliant. The New England region was home to many young, singlefarm girls who might be recruited. But would stern New England farmers allow theirdaughters to work in factories? The great majority of them would not. They believedthat sooner or later factory workers would be exploited and would sink into hopelesspoverty. Economic laws would force them to work harder and harder for less and lesspay. THE LOWELL EXPERIMENTHow, then, were the factory owners able to recruit farm girls as laborers? They did itby building decent houses in which the girls could live. These houses were supervisedby older women who made sure that the girls lived by strict moral standards. The girlswere encouraged to go to church, to read, to write and to attend lectures. They savedpart of their earnings to help their families at home or to use when they got married. The young factory workers did not earn high wages; the average pay was about $3.50a week. But in those times, a half-dozen eggs cost five cents and a whole chicken cost15 cents. The hours worked in the factories were long. Generally, the girls worked 11 to13 hours a day, six days a week. But most people in the 1830s worked from dawn untildusk, and farm girls were used to getting up early and working until bedtime at nine oclock. The factory owners at Lowell believed that machines would bring progress as well as profit. Workers and capitalists would both benefit from the wealth created by mass production. For a while, the factory system at Lowell worked very well. The population of the towngrew from 200 in 1820 to 30,000 in 1845. But conditions in Lowells factories had alreadystarted to change. Faced with growing competition, factory owners began to decreasewages in order to lower the costand the priceof finished products. They increased the number of machines that each girl had to operate. In addition, theybegan to overcrowd the houses in which the girls lived. Sometimes eight girls had to shareone room. In 1836, 1,500 factory girls went on strike to protest wage cuts. (The girls called theiraction a turn out.) But it was useless. Desperately poor immigrants were beginning toarrive in the United States from Europe. To earn a living, they were willing to accept lowwages and poor working conditions. Before long, immigrant women replaced theYankee (American) farm girls. To many people, it was apparent that justice for wage earners would not come easily. Labor in America faced a long, uphill struggle to win fair treatment. In that struggle, moreand more workers would turn to labor unions to help their cause. They would endureviolence, cruelty and bitter defeats. But eventually they would achieve a standard ofliving unknown to workers at any other time in history. GROWTH OF THE FACTORYIn colonial America, most manufacturing was done by hand in the home. Some wasdone in workshops attached to the home. As towns grew into cities, the demand formanufactured goods increased. Some workshop owners began hiring helpers to increaseproduction. Relations between the employer and helper were generally harmonious. They worked side by side, had the same interests and held similar political views. The factory system that began around 1800 brought great changes. The employerno longer worked beside his employees. He became an executive and a merchantwho rarely saw his workers. He was concerned less with their welfare than with thecost of their labor. Many workers were angry about the changes brought by thefactory system. In the past, they had taken great pride in their handicraft skills; nowmachines did practically all the work, and they were reduced to the status of commonlaborers. In bad times they could lose their jobs. Then they might be replaced byworkers who would accept lower wages. To skilled craft workers, the IndustrialRevolution meant degradation rather than progress. Line by Line Analysis of The Road Not Taken EssayThe next day 600 militiamen arrived from Philadelphia. They were ordered to clear the tracks at thefreight yard. The soldiers advanced toward the crowd and shooting erupted. In the aftermath, 20people in the crowd lay dead. Many more were wounded. News of the killings triggered rioting andfires in the Pittsburgh railyards. President Rutherford Hayes ordered federal troops to Pittsburgh toend mob violence. When they arrived, the fighting had already ended. In the smoking ruins, theyfound the wrecks of more than 2,000 railroad cars. Dozens of buildings lay in ashes. Many strikers were sent to jail and others lost their jobs. A large part of the public was shocked bythe violence in Pittsburgh and other cities. Some people were convinced that miners, railroadworkers and other laborers were common criminals. Legislatures in many states passed newconspiracy laws aimed at suppressing labor. But the Great Railway Strike of 1877 helped theworkers in some ways. A few railroads took back the wage cuts they had ordered. More importantwas the support given to the strike by miners, iron workers and others. It gave labor an awarenessof its strength and solidarity. KNIGHTS OF LABORThe Railway Strike led many workers to join a growing national labor organization. It had a grandnamethe Noble and Holy Order of the Knights of Labor. It was founded in 1869 by a small groupof Philadelphia clothing workers. Their union had been unable to organize effectively. The reason,they believed, was that its members were too well-known. Employers fired them and then put theirnames on a blacklist. Other employers would not hire anyone whose name appeared on the list. The garment workers came to two conclusions:Secrecy was needed to protect union members against employer spies. Labor organizations would fail if they were divided into separate craft unions. Instead, labor shouldbe organized in one big union of both skilled and unskilled workers. Membership in the Knights of Labor was open to wage earners over 18 years of age regardless ofrace, sex or skill. New members had to take an oath of secrecy. They swore that they wouldnever reveal the name of the order or the names of its members. The program of the Knights of Labor called for: an eight-hour working day, laws establishing aminimum weekly wage, the use of arbitration rather than strikes to settle disputes, laws to protectthe health and safety of industrial workers, equal pay for equal work, an end to child labor under14 years of age and government ownership of railroads, telegraphs and telephones. It was impossible for the Knights to operate in complete secrecy. Rumors of their activitiesreached the press. Newspaper stories usually exaggerated the strength of the order. Underpressure from public opinion, the Knights began to operate openly. But they were still forbiddento reveal the name of any member to an employer. Membership in the Knights increased slowly. By 1884, the order had only 52,000 members. Butthat year workers led by Knights of Labor organizers went on strike against two big railroadcompanies. Both strikes ended in complete victories for the Knights. Now workers everywhererushed to join the order. Within two years membership in the Knights rose to 150,000. Newspaperswarned their readers about the power of the Knights. One of them said, Their leaders can shutmost of the mills and factories, and disable the railroads. Many people associated the order withdangerous radicals. Later railroad strikes by the Knights met with defeat. The order was not nearly as powerful as ithad seemed. Workers began to leave it in great numbers. Within 10 years of its greatest victories,the Knights of Labor collapsed.

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.