DOCSLIB.ORG

Avoiding Job Starvation and Improving Job Execution Performance in Mapreduce Clusters 1 2 SHADAGONDA UMAREDDY , N

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Avoiding Job Starvation and Improving Job Execution Performance in Mapreduce Clusters 1 2 SHADAGONDA UMAREDDY , N ISSN 2319-8885 Vol.06,Issue.25 July-2017, Pages:4808-4810 www.ijsetr.com Avoiding Job Starvation and Improving Job Execution Performance in MapReduce Clusters 1 2 SHADAGONDA UMAREDDY , N. SUJATA KUMARI 1PG Scholar, Dept of CSE, Sridevi Women’s Engineering College, VattiNagulaPally, RangaReddy(Dt), Telangana, India. 2Assoc Prof, Dept of CSE, Sridevi Women’s Engineering College, VattiNagulaPally, RangaReddy(Dt), Telangana, India. Abstract: MapReduce is programming model which is define a MapReduce job as a map function and a reduce function, and provides a runtime system to divide the job into multiple map tasks and reduce tasks and perform these tasks on a MapReduce cluster in parallel. In order to provide high map and reduce data locality, proposed an efficient and suitable scheduling scheme named as hybrid job-driven scheduling scheme (JoSS) for the users. But, in this existing scheduling scheme, virtual MapReduce workload problem is occurred. So, here enhancing this JoSS scheme work with heterogeneous virtual MapReduce clusters by providing flexibility for JoSS. In this proposed work, it is provided with individual servers for individual jobs to reduce the MapReduce workload. Keywords: Mapreduce, Virtual Mapreduce Cluster, Data Locality. I. INTRODUCTION A cloud scheduler performs a main role in distributing The dramatic increase of data quantity in latest years sources for unique jobs executing in cloud environment. imposes a rising difficulty of processing and analyzing a Virtual machines are created and managed at the fly in cloud huge quantity of data. As a main framework for huge to create surroundings for task execution. Map Reduce is a information analytics this is pioneered with the aid of simple and effective programming version which has been Google and popularized by way of the open-source Hadoop, extensively used for processing large scale records extensive MapReduce is leveraged by means of a huge quantity of programs on a cluster of physical machines. Now a day’s organizations to parallelize their data processing on many groups, researchers, authorities businesses are strolling disbursed computing systems. It decomposes a task into Map Reduce packages on public cloud. Running Map some of parallel map tasks, observed by means of reduce Reduce on cloud has many benefits like on-call for tasks that merge all intermediate outcomes generated via establishment of cluster, scalability. Today’s data centers map tasks to provide very last effects. MapReduce jobs are provide specific modes of computing structures - local and typically executed on clusters of commodity PCs, which virtual clusters. Both those environments are having their require huge funding in difficult-ware and management. very own strengths and weaknesses. For example, a local Since a cluster has to be provisioned for peak utilization to cluster is higher for batch workloads like MapReduce from keep away from overload, it is underutilized on common. the overall performance angle, lowers SLA violations, and Thus, cloud turns into a promising platform for MapReduce however generally suffers from poor utilization, and jobs because of its flexibility and pay-as-you-go enterprise excessive hardware and electricity cost. A virtual cluster, version. For every MapReduce activity, a virtual cluster is then again, is appealing for interactive workloads from created by way of employing some of Virtual Machines consolidation and price standpoints, but won't provide (VMs). The cluster size may be dynamically adjusted aggressive performance like a local cluster, and incurs higher consistent with job requirements. However, the services SLA infringements. Intuitively, a hybrid platform along with furnished through an individual cloud issuer are generally native and virtualized cluster must be able to take advantage restricted to positive geographic regions, making it not of the blessings of both environments for providing a better possible to method data from all around the globe. To really cost-effective platform. Here, to discover this layout satisfy the promise of cloud computing for big data utility, alternative, which called as hybrid data center, and an rising scheme is to save and technique data in a demonstrate its benefits for helping each interactive and geographically dispersed cloud surroundings, in which a batch workloads, and attaining the right stability between couple of clouds locate at extraordinary places within the these types of layout standards, making it a suitable cluster international and they may be related by way of inter-cloud configuration alternative. networks. Copyright @ 2017 IJSETR. All rights reserved. SHADAGONDA UMAREDDY, N. SUJATA KUMARI II. RELATED WORK with the equal intermediate Key #1 and pass them to the 1. Matsunaga, M. Tsugawa, and J. Fortes research Reduce characteristic.The Reduce characteristic, also written investigated an efficient approach to the execution of by way of the user, accepts an intermediate Key #1 and a bioinformatics applications and validated it by hard and fast of values for that key. It merges together those demonstrating its low overheads and high performance values to shape a probably smaller set of values. by developing CloudBLAST, a distributed implementation of NCBIBLAST. The crux of the approach is the integration of the MapReduce approach to the parallel execution of applications with the encapsulation of software environments and data in virtual machines connected by virtual networks. 2. Vaishali W. Thawari, Sachin D. Babar, Nitin A. Dhawas present a data locality driven task scheduling algorithm called Balance-Reduce. This algorithm schedules tasks through using a global view as well as adjusts task data locality dynamically according to network state and cluster workload. In a poor network environment, this algorithm tries its best to enhance data locality. When cluster is overloaded, this algorithm decreases data The output value of 0 or 1 is produced in step with Reduce locality to make tasks start early. Here evaluating this invocation. The intermediate values are supplied to the algorithm by comparing it to other related algorithms. person's Reduce feature via an iterator (an object that 3. X. Bu, J. Rao, and C.-Z. Xu presents an interference and permits a programmer to traverse through all of the elements locality-aware scheduler for digital MapReduce clusters. of a group no matter its precise implementation). This It is based on scheduling modules: IASM and LASM. permits us to deal with lists of values which might be too The former plays the interference-unfastened scheduling large to in shape in reminiscence. with the assistance of a performance prediction version and the latter improves mission information locality via B. Improved JoSS the usage of Adaptive Delay Scheduling set of rules. Previously, JoSS is adviced to correctly schedule 4. J. Polo, D. Carrera, Y. Becerra, J. Torres, E. Ayguade, MapReduce jobs in a digital MapReduce cluster by using M. Steinder and I. Whalley resented a prototype of a addressing both map-data locality and reduce-data locality task scheduler for MapReduce applications. It has been from the attitude of a user. In this proposed JoSS, it can do implemented on top of Hadoop, the Apache’s open- the job classification and it based on the ratio of predefined source implementation of a MapReduce framework. The block size of reduce and Map jab, job classification can be scheduler dynamically estimates the completion time for classified into either a Map-Heavy (MH) or Reduce-Heavy every MapReduce process within the system, taking (RH) job. The Hybrid Job-Driven Scheduling Scheme advantage of the fact that each MapReduce activity is (JoSS) has two variations such as composed of a huge range of tasks (maps and reduces) 1. Task-driven Task Assigner (TTA) recognized earlier all through the activity initialization 2. Job-driven Task Assigner (JTA) section (whilst the enter statistics is split), and that the progress of the task may be determined at runtime. 1. Task-driven Task Assigner Whenever VPS has an idle Map slot, TTA preferentially The scheduler takes each submitted and now not yet assigns a Map task from MQ to VPS based on the Hadoop completed Hadoop task and video display units the average FIFO algorithm. The aim is to preferentially execute all undertaking duration for already completed obligations. This newly submitted jobs one by one and obtain their filtering information is used to be expecting the task crowning glory percentage values to determine their job classifications. time. However, if MQFIFO is empty, TTA assigns one of the first III. FRAMEWORK Map tasks from all the other map-task queues of data center A. MapReduce in a round-robin fashion such that tasks can be assigned MapReduce programs are designed to compute large quickly and job starvation can be avoided. volumes of records in a parallel manner. This calls for partitioning the workload across a large range of machines. 2. Job-driven Task Assigner Hadoop gives a systematic way to put into effect this JTA, which in fact is very similar to that of TTA. The programming paradigm. The computation takes a fixed of only difference is that JTA always uses the Hadoop FIFO enter key/value pairs and produces a fixed of output algorithm to assign a Map task from each map-task queue so key/value pairs. The computation includes simple as to further improve the VPS-locality. The job performance operations: Map and Reduce. The Map operation, written by can be improved as well as the data locality can be using the consumer, takes an input pair and produces a fixed increased in virtual MapReduce clusters by classifying jobs of intermediate key/price pairs. The MapReduce library into Map-Heavy (MH) & Reduce-Heavy (RH) jobs as well businesses collectively all intermediate values associated as designing the corresponding rules to agenda each glory of International Journal of Scientific Engineering and Technology Research Volume.06, IssueNo.25, July-2017, Pages: 4808-4810 Avoiding Job Starvation and Improving Job Execution Performance in MapReduce Clusters jobs in JoSS.
Load more

Recommended publications
  • Armadillo C++ Library
    Armadillo: a template-based C++ library for linear algebra Conrad Sanderson and Ryan Curtin Abstract The C++ language is often used for implementing functionality that is performance and/or resource sensitive. While the standard C++ library provides many useful algorithms (such as sorting), in its current form it does not provide direct handling of linear algebra (matrix maths). Armadillo is an open source linear algebra library for the C++ language, aiming towards a good balance between speed and ease of use. Its high-level application programming interface (function syntax) is deliberately similar to the widely used Matlab and Octave languages [4], so that mathematical operations can be expressed in a familiar and natural manner. The library is useful for algorithm development directly in C++, or relatively quick conversion of research code into production environments. Armadillo provides efficient objects for vectors, matrices and cubes (third order tensors), as well as over 200 associated functions for manipulating data stored in the objects. Integer, floating point and complex numbers are supported, as well as dense and sparse storage formats. Various matrix factorisations are provided through integration with LAPACK [3], or one of its high performance drop-in replacements such as Intel MKL [6] or OpenBLAS [9]. It is also possible to use Armadillo in conjunction with NVBLAS to obtain GPU-accelerated matrix multiplication [7]. Armadillo is used as a base for other open source projects, such as MLPACK, a C++ library for machine learning and pattern recognition [2], and RcppArmadillo, a bridge between the R language and C++ in order to speed up computations [5].
    [Show full text]
  • Scala Tutorial
    Scala Tutorial SCALA TUTORIAL Simply Easy Learning by tutorialspoint.com tutorialspoint.com i ABOUT THE TUTORIAL Scala Tutorial Scala is a modern multi-paradigm programming language designed to express common programming patterns in a concise, elegant, and type-safe way. Scala has been created by Martin Odersky and he released the first version in 2003. Scala smoothly integrates features of object-oriented and functional languages. This tutorial gives a great understanding on Scala. Audience This tutorial has been prepared for the beginners to help them understand programming Language Scala in simple and easy steps. After completing this tutorial, you will find yourself at a moderate level of expertise in using Scala from where you can take yourself to next levels. Prerequisites Scala Programming is based on Java, so if you are aware of Java syntax, then it's pretty easy to learn Scala. Further if you do not have expertise in Java but you know any other programming language like C, C++ or Python, then it will also help in grasping Scala concepts very quickly. Copyright & Disclaimer Notice All the content and graphics on this tutorial are the property of tutorialspoint.com. Any content from tutorialspoint.com or this tutorial may not be redistributed or reproduced in any way, shape, or form without the written permission of tutorialspoint.com. Failure to do so is a violation of copyright laws. This tutorial may contain inaccuracies or errors and tutorialspoint provides no guarantee regarding the accuracy of the site or its contents including this tutorial. If you discover that the tutorialspoint.com site or this tutorial content contains some errors, please contact us at [email protected] TUTORIALS POINT Simply Easy Learning Table of Content Scala Tutorial ..........................................................................
    [Show full text]
  • Cmsc 132: Object-Oriented Programming Ii
    © Department of Computer Science UMD CMSC 132: OBJECT-ORIENTED PROGRAMMING II Iterator, Marker, Observer Design Patterns Department of Computer Science University of Maryland, College Park © Department of Computer Science UMD Design Patterns • Descriptions of reusable solutions to common software design problems (e.g, Iterator pattern) • Captures the experience of experts • Goals • Solve common programming challenges • Improve reliability of solution • Aid rapid software development • Useful for real-world applications • Design patterns are like recipes – generic solutions to expected situations • Design patterns are language independent • Recognizing when and where to use design patterns requires familiarity & experience • Design pattern libraries serve as a glossary of idioms for understanding common, but complex solutions • Design patterns are used throughout the Java Class Libraries © Department of Computer Science UMD Iterator Pattern • Definition • Move through collection of objects without knowing its internal representation • Where to use & benefits • Use a standard interface to represent data objects • Uses standard iterator built in each standard collection, like List • Need to distinguish variations in the traversal of an aggregate • Example • Iterator for collection • Original • Examine elements of collection directly • Using pattern • Collection provides Iterator class for examining elements in collection © Department of Computer Science UMD Iterator Example public interface Iterator<V> { bool hasNext(); V next(); void remove();
    [Show full text]
  • Iterators in C++ C 2016 All Rights Reserved
    Software Design Lecture Notes Prof. Stewart Weiss Iterators in C++ c 2016 All rights reserved. Iterators in C++ 1 Introduction When a program needs to visit all of the elements of a vector named myvec starting with the rst and ending with the last, you could use an iterative loop such as the following: for ( int i = 0; i < myvec.size(); i++ ) // the visit, i.e., do something with myvec[i] This code works and is a perfectly ne solution. This same type of iterative loop can visit each character in a C++ string. But what if you need code that visits all elements of a C++ list object? Is there a way to use an iterative loop to do this? To be clear, an iterative loop is one that has the form for var = start value; var compared to end value; update var; {do something with node at specic index} In other words, an iterative loop is a counting loop, as opposed to one that tests an arbitrary condition, like a while loop. The short answer to the question is that, in C++, without iterators, you cannot do this. Iterators make it possible to iterate through arbitrary containers. This set of notes answers the question, What is an iterator, and how do you use it? Iterators are a generalization of pointers in C++ and have similar semantics. They allow a program to navigate through dierent types of containers in a uniform manner. Just as pointers can be used to traverse a linked list or a binary tree, and subscripts can be used to traverse the elements of a vector, iterators can be used to sequence through the elements of any standard C++ container class.
    [Show full text]
  • Generic Programming
    Generic Programming July 21, 1998 A Dagstuhl Seminar on the topic of Generic Programming was held April 27– May 1, 1998, with forty seven participants from ten countries. During the meeting there were thirty seven lectures, a panel session, and several problem sessions. The outcomes of the meeting include • A collection of abstracts of the lectures, made publicly available via this booklet and a web site at http://www-ca.informatik.uni-tuebingen.de/dagstuhl/gpdag.html. • Plans for a proceedings volume of papers submitted after the seminar that present (possibly extended) discussions of the topics covered in the lectures, problem sessions, and the panel session. • A list of generic programming projects and open problems, which will be maintained publicly on the World Wide Web at http://www-ca.informatik.uni-tuebingen.de/people/musser/gp/pop/index.html http://www.cs.rpi.edu/˜musser/gp/pop/index.html. 1 Contents 1 Motivation 3 2 Standards Panel 4 3 Lectures 4 3.1 Foundations and Methodology Comparisons ........ 4 Fundamentals of Generic Programming.................. 4 Jim Dehnert and Alex Stepanov Automatic Program Specialization by Partial Evaluation........ 4 Robert Gl¨uck Evaluating Generic Programming in Practice............... 6 Mehdi Jazayeri Polytypic Programming........................... 6 Johan Jeuring Recasting Algorithms As Objects: AnAlternativetoIterators . 7 Murali Sitaraman Using Genericity to Improve OO Designs................. 8 Karsten Weihe Inheritance, Genericity, and Class Hierarchies.............. 8 Wolf Zimmermann 3.2 Programming Methodology ................... 9 Hierarchical Iterators and Algorithms................... 9 Matt Austern Generic Programming in C++: Matrix Case Study........... 9 Krzysztof Czarnecki Generative Programming: Beyond Generic Programming........ 10 Ulrich Eisenecker Generic Programming Using Adaptive and Aspect-Oriented Programming .
    [Show full text]
  • Generators & Coroutines Part 1: Iterators
    Generators & Coroutines Part 1: Iterators Edited Version of Slides by David Beazely http://www.dabeaz.comPart I Introduction to Iterators and Generators Monday, May 16, 2011 Monday, May 16, 2011 Copyright (C) 2008, http://www.dabeaz.com 1- 11 Iteration Iterating over a Dict As you know, Python has a "for" statement • • If you loop over a dictionary you get keys You use it to loop over a collection of items • >>> prices = { 'GOOG' : 490.10, >>> for x in [1,4,5,10]: ... 'AAPL' : 145.23, ... print x, ... 'YHOO' : 21.71 } ... ... 1 4 5 10 >>> for key in prices: >>> ... print key ... And, as you have probably noticed, you can YHOO • GOOG iterate over many different kinds of objects AAPL (not just lists) >>> Copyright (C) 2008, http://www.dabeaz.com 1- 12 Copyright (C) 2008, http://www.dabeaz.com 1- 13 Iterating over a String • If you loop over a string, you get characters >>> s = "Yow!" >>> for c in s: ... print c ... Y o w ! >>> Copyright (C) 2008, http://www.dabeaz.com 1- 14 Iterating over a Dict • If you loop over a dictionary you get keys >>> prices = { 'GOOG' : 490.10, ... 'AAPL' : 145.23, ... 'YHOO' : 21.71 } ... >>> for key in prices: ... print key ... YHOO GOOG AAPL >>> Copyright (C) 2008, http://www.dabeaz.com 1- 13 Iterating over a String Iterating over a File • If you loop over a file you get lines If you loop over a string, you get characters >>> for line in open("real.txt"): • ... print line, ... >>> s = "Yow!" Iterating over a File Real Programmers write in FORTRAN >>> for c in s: ..
    [Show full text]
  • An Overview of the Scala Programming Language
    An Overview of the Scala Programming Language Second Edition Martin Odersky, Philippe Altherr, Vincent Cremet, Iulian Dragos Gilles Dubochet, Burak Emir, Sean McDirmid, Stéphane Micheloud, Nikolay Mihaylov, Michel Schinz, Erik Stenman, Lex Spoon, Matthias Zenger École Polytechnique Fédérale de Lausanne (EPFL) 1015 Lausanne, Switzerland Technical Report LAMP-REPORT-2006-001 Abstract guage for component software needs to be scalable in the sense that the same concepts can describe small as well as Scala fuses object-oriented and functional programming in large parts. Therefore, we concentrate on mechanisms for a statically typed programming language. It is aimed at the abstraction, composition, and decomposition rather than construction of components and component systems. This adding a large set of primitives which might be useful for paper gives an overview of the Scala language for readers components at some level of scale, but not at other lev- who are familar with programming methods and program- els. Second, we postulate that scalable support for compo- ming language design. nents can be provided by a programming language which unies and generalizes object-oriented and functional pro- gramming. For statically typed languages, of which Scala 1 Introduction is an instance, these two paradigms were up to now largely separate. True component systems have been an elusive goal of the To validate our hypotheses, Scala needs to be applied software industry. Ideally, software should be assembled in the design of components and component systems. Only from libraries of pre-written components, just as hardware is serious application by a user community can tell whether the assembled from pre-fabricated chips.
    [Show full text]
  • Cmsc 132: Object-Oriented Programming Ii
    © Department of Computer Science UMD CMSC 132: OBJECT-ORIENTED PROGRAMMING II Object-Oriented Programming Intro Department of Computer Science University of Maryland, College Park © Department of Computer Science UMD Object-Oriented Programming (OOP) • Approach to improving software • View software as a collection of objects (entities) • OOP takes advantage of two techniques • Abstraction • Encapsulation © Department of Computer Science UMD Techniques – Abstraction • Abstraction • Provide high-level model of activity or data • Don’t worry about the details. What does it do, not how • Example from outside of CS: Microwave Oven • Procedural abstraction • Specify what actions should be performed • Hide algorithms • Example: Sort numbers in an array (is it Bubble sort? Quicksort? etc.) • Data abstraction • Specify data objects for problem • Hide representation • Example: List of names • Abstract Data Type (ADT) • Implementation independent of interfaces • Example: The ADT is a map (also called a dictionary). We know it should associate a key with a value. Can be implemented in different ways: binary search tree, hash table, or a list. © Department of Computer Science UMD Techniques – Encapsulation • Encapsulation • Definition: A design technique that calls for hiding implementation details while providing an interface (methods) for data access • Example: use the keyword private when designing Java classes • Allow us to use code without having to know its implementation (supports the concept of abstraction) • Simplifies the process of code
    [Show full text]
  • CSCI 104 C++ STL; Iterators, Maps, Sets
    1 CSCI 104 C++ STL; Iterators, Maps, Sets Mark Redekopp David Kempe 2 Container Classes • ArrayLists, LinkedList, Deques, etc. are classes used simply for storing (or contain) other items • C++ Standard Template Library provides implementations of all of these containers – DynamicArrayList => C++: std::vector<T> – LinkedList => C++: std::list<T> – Deques => C++: std::deque<T> – Sets => C++: std::set<T> – Maps => C++: std::map<K,V> • Question: – Consider the get() method. What is its time complexity for… – ArrayList => O(____) – LinkedList => O(____) – Deques => O(____) 3 Container Classes • ArrayLists, LinkedList, Deques, etc. are classes used simply for storing (or contain) other items • C++ Standard Template Library provides implementations of all of these containers – DynamicArrayList => C++: std::vector<T> – LinkedList => C++: std::list<T> – Deques => C++: std::deque<T> – Sets => C++: std::set<T> – Maps => C++: std::map<K,V> • Question: – Consider the at() method. What is its time complexity for… – ArrayList => O(1) // contiguous memory, so just go to location – LinkedList => O(n) // must traverse the list to location i – Deques => O(1) 4 Iteration • Consider how you iterate over all the ArrayList<int> mylist; ... elements in a list for(int i=0; i < mylist.size(); ++i) – Use a for loop and get() or { cout << mylist.get(i) << endl; operator[] } • For an array list this is fine since each call to at() is O(1) LinkedList<int> mylist; ... • For a linked list, calling get(i) for(int i=0; i < mylist.size(); ++i) requires taking i steps through the { cout << mylist.get(i) << endl; linked list } – 0th call = 0 steps – 1st call = 1 step head – 2nd call = 2 steps 0x148 – 0+1+2+…+n-2+n-1 = O(n2) 0x148 0x1c0 0x3e0 3 0x1c0 9 0x3e0 5 NULL • You are re-walking over the linked list a lot of the time get(0) get(1) get(2) 5 Iteration: A Better Approach iterator head • Solution: Don't use get() Mylist.end() Curr = NULL 0x148 • Use an iterator 0x148 0x1c0 0x3e0 – an internal state variable (i.e.
    [Show full text]
  • Functional Programming HOWTO Release 3.3.3
    Functional Programming HOWTO Release 3.3.3 Guido van Rossum Fred L. Drake, Jr., editor November 17, 2013 Python Software Foundation Email: [email protected] Contents 1 Introduction ii 1.1 Formal provability.......................................... iii 1.2 Modularity.............................................. iii 1.3 Ease of debugging and testing.................................... iii 1.4 Composability............................................. iii 2 Iterators iv 2.1 Data Types That Support Iterators..................................v 3 Generator expressions and list comprehensions vi 4 Generators vii 4.1 Passing values into a generator.................................... viii 5 Built-in functions ix 6 The itertools module xi 6.1 Creating new iterators......................................... xi 6.2 Calling functions on elements.................................... xii 6.3 Selecting elements.......................................... xii 6.4 Grouping elements.......................................... xiii 7 The functools module xiv 7.1 The operator module......................................... xv 8 Small functions and the lambda expression xv 9 Revision History and Acknowledgements xvi 10 References xvi 10.1 General................................................ xvi 10.2 Python-specific............................................ xvii 10.3 Python documentation........................................ xvii Indexxix Author A. M. Kuchling Release 0.31 In this document, we’ll take a tour of Python’s features suitable for implementing programs
    [Show full text]
  • Scala Tutorial
    Scala About the Tutorial Scala is a modern multi-paradigm programming language designed to express common programming patterns in a concise, elegant, and type-safe way. Scala has been created by Martin Odersky and he released the first version in 2003. Scala smoothly integrates the features of object-oriented and functional languages. This tutorial explains the basics of Scala in a simple and reader-friendly way. Audience This tutorial has been prepared for beginners to help them understand the basics of Scala in simple and easy steps. After completing this tutorial, you will find yourself at a moderate level of expertise in using Scala from where you can take yourself to next levels. Prerequisites Scala Programming is based on Java, so if you are aware of Java syntax, then it's pretty easy to learn Scala. Further if you do not have expertise in Java but if you know any other programming language like C, C++ or Python then it will also help in grasping Scala concepts very quickly. Disclaimer & Copyright © Copyright 2015 by Tutorials Point (I) Pvt. Ltd. All the content and graphics published in this e-book are the property of Tutorials Point (I) Pvt. Ltd. The user of this e-book is prohibited to reuse, retain, copy, distribute or republish any contents or a part of contents of this e-book in any manner without written consent of the publisher. We strive to update the contents of our website and tutorials as timely and as precisely as possible, however, the contents may contain inaccuracies or errors. Tutorials Point (I) Pvt.
    [Show full text]
  • Iterator Objects
    Object-oriented programming with Java Grouping objects Iterator objects Ahmed Al-Ajeli Lecture 9 Main topics to be covered • Improve the structure of the MusicOrganizer class • Iterator objects • Index versus Iterator • Removing from a collection 2 Ahmed Al-Ajeli Object-oriented programming with Java Moving away from String • Our collection of String objects for music tracks is limited. • No separate identification of artist, title, etc. • We will define a Track class with separate fields: – artist – filename 3 The Track class public class Track { private String artist; private String filename; public Track(String artist, String filename) { this.artist = artist; this.filename = filename; } public String getArtist() { return artist; } 4 Ahmed Al-Ajeli Object-oriented programming with Java The Track class public String getFilename() { return filename; } public void setArtist (String artist) { this.artist = artist; } public void setFilename (String filename) { this.filename = filename; } } 5 The MusicOrganizerV2 class import java.util.ArrayList; public class MusicOrganizer { private ArrayList<Track> tracks; public MusicOrganizer() { tracks = new ArrayList<>(); object } parameter public void addTrack(Track track) { tracks.add(track); } 6 Ahmed Al-Ajeli Object-oriented programming with Java The MusicOrganizerV2 class public void listTrack(int index) { Track track = tracks.get(index); System.out.println(“Artist: “ + track.getArtist()+ “ Filename: “ + track.getFilename()); } public void listAllTracks() { for(Track track : tracks) { System.out.println(“Artist:
    [Show full text]