A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generalization of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics. Also, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement. The comparison results show that the computation using our mapper/reducer placement is much cheaper while still satisfying the computation deadline.

A new grouping genetic algorithm for the MapReduce placement problem in cloud computing

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.

A new approach to the cloud-based heterogeneous MapReduce placement problem

Guaranteeing Quality of Service (QoS) with minimum computation cost is the most important objective of cloud-based MapReduce computations. Minimizing the total computation cost of cloud-based MapReduce computations is done through MapReduce placement optimization. MapReduce placement optimization approaches can be classified into two categories: homogeneous MapReduce placement optimization and heterogeneous MapReduce placement optimization. It is generally believed that heterogeneous MapReduce placement optimization is more effective than homogeneous MapReduce placement optimization in reducing the total running cost of cloud-based MapReduce computations. This paper proposes a new approach to the heterogeneous MapReduce placement optimization problem. In this new approach, the heterogeneous MapReduce placement optimization problem is transformed into a constrained combinatorial optimization problem and is solved by an innovative constructive algorithm. Experimental results show that the running cost of the cloud-based MapReduce computation platform using this new approach is 24:3%-44:0% lower than that using the most popular homogeneous MapReduce placement approach, and 2:0%-36:2% lower than that using the heterogeneous MapReduce placement approach not considering the spare resources from the existing MapReduce computations. The experimental results have also demonstrated the good scalability of this new approach.

A comparative study of the semi-elastic and fully-elastic MapReduce models

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics and it can obtain a better solution in a reasonable time. Furthermore, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement which puts a fixed number of mapper/reducer on each machine. The comparison results show that the computation using our mapper/reducer placement is much cheaper than the computation using the conventional placement while still satisfying the computation deadline.

Exploring the effectiveness of virtual product placement on recall and recognition of new brands

This paper investigates the effectiveness of virtual product placement as a marketing tool by examining the relationship between brand recall and recognition and virtual product placement. It also aims to address a gap in the existing academic literature by focusing on the impact of product placement on recall and recognition of new brands. The growing importance of product placement is discussed and a review of previous research on product placement and virtual product placement is provided. The research methodology used to study the recall and recognition effects of virtual product placement are described and key findings presented. Finally, implications are discussed and recommendations for future research provided.

Administrative Placement of the Information Systems Discipline in Universities - A SWOT Analysis of Queensland University of Technology

In some Queensland universities, Information Systems academics have moved out of Business Faculties. This study uses a pilot SWOT analysis to examine the ramifications of Information Systems academics being located within or outside of the Business Faculty. The analysis provides a useful basis for decision makers in the School studied, to exploit opportunities and minimise external threats. For Information Systems academics contemplating administrative relocation of their group, the study also offers useful insights. The study presages a series of further SWOT analyses to provide a range of perspectives on the relative merits of having Information Systems academics administratively located inside versus outside Business faculties.

A review of non-traditional occupational therapy practice placement education : a focus on role-emerging and project placements

Practice placement education has been recognised as an integral and critical component of the training of occupational therapy students. Although there is an extensive body of literature on clinical education and traditional practice placement education models, there has been limited research on alternative placements.-------- This paper reviews the literature on various practice placement education models and presents a contemporary view on how it is currently delivered. The literature is examined with a particular focus on the increasing range of practice placement education opportunities, such as project and role-emerging placements. The drivers for non-traditional practice placement education include shortages of traditional placement options, health reform and changing work practices, potential for role development and influence on practice choice. The benefits and challenges of non-traditional practice placement education are discussed, including supervision issues, student evaluation, professional and personal development and the opportunity to practise clinical skills.--------- Further research is recommended to investigate occupational therapy graduates' perceptions of role-emerging and project placements in order to identify the benefits or otherwise of these placements and to contribute to the limited body of knowledge of emerging education opportunities.

Exploring product placement in video games : an investigation of recall effects

Despite its growth and prominence, product placement is generally under-researched and this is even more apparent in the area of placement in video gaming. This paper presents exploratory focus group research into this practice. Findings indicate that the introductory footage to a game provides placement opportunities with the highest level of recall, while peripheral non-action is the worst. Interestingly, recall also appears to be higher for individual brands as opposed to manufacturer brands.

Product placement in US and New Zealand television soap operas : an exploratory study

Although the soap opera as a television genre has consistently captured the imagination of millions of people around the world, surprisingly little has been written about it in the marketing literature. Understanding the consumption imagery in soaps may allow marketers to assess the relevance of product placement for their promotion strategy better, as well as providing valuable insight into the consumption habits of their considerable viewing audiences. Data were collected through content analysis from two soap operas, one in the USA and one in New Zealand. The results indicated a high level of consumption imagery, including brand references. Furthermore significant differences in the types of product and the emotional outcome of product use were found between the countries.

Phylogenetic placement of the sugarcane orange rust pathogen Puccinia kuehnii in a historical and regional context

Sugarcane orange rust, caused by Puccinia kuehnii, was once considered a minor disease in the Australian sugar industry. However, in 2000 a new race of the pathogen devastated the high-performing sugarcane cultivar Q124, and caused the industry Aus$150–210 million in yield losses. At the time of the epidemic, very little was known about the genetic and pathogenic diversity of the fungus in Australia and neighbouring sugar industries. DNA sequence data from three rDNA regions were used to determine the genetic relationships between isolates within two P. kuehnii collections. The first collection comprised only recent Australian field isolates and limited sequence variation was detected within this population. In the second study, Australian isolates were compared with isolates from Papua New Guinea, Indonesia, China and historical herbarium collections. Greater sequence variation was detected in this collection and phylogenetic analyses grouped the isolates into three clades. All isolates from commercial cane fields clustered together including the recent Australianfield isolates and the Australian historical isolate from 1898.The other two clades included rust isolates from wild and garden canes in Indonesia and PNG. These rusts appeared morphologically similar to P. kuehnii and could potentially pose a quarantine threat to the Australian sugar industry. The results have revealed greater diversity in sugarcane rusts than previously thought.

QoS-aware reference station placement for regional network RTK

Network RTK (Real-Time Kinematic) is a technology that is based on GPS (Global Positioning System) or more generally on GNSS (Global Navigation Satellite System) measurements to achieve centimeter-level accuracy positioning in real-time. Reference station placement is an important problem in the design and deployment of network RTK systems as it directly affects the quality of the positioning service and the cost of the network RTK systems. This paper identifies a new reference station placement for network RTK, namely QoS-aware regional network RTK reference station placement problem, and proposes an algorithm for the new reference station placement problem. The algorithm can always produce a reference station placement solution that completely covers the region of network RTK.

Gateways placement in backbone wireless mesh networks

This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns mesh routers to identified gateways. The new algorithm can guarantee to find a feasible gateway placement satisfying Quality-of-Service (QoS) constraints, including delay constraint, relay load constraint and gateway capacity constraint. Experimental results show that its performance is as good as that of the best of existing algorithms for the gateway placement problem. But, the new algorithm can be used for BWMNs that do not form one connected component, and it is easy to implement and use.

The effectiveness of product placement within the immersive environment

This research investigates the impact of participants’ involvement on evaluation of virtual product placement within immersive environments. An exploratory student was conducted and face-to-face, semi structured interviews were used in this research. That sample consisted of active and current Second Life users in the age group of 20-50 years old and from a range of different occupations. Results of the qualitative study indicate that high involvement with the product and deep immersion within Second Life both lead to higher perceptions of product placement effectiveness and enhanced virtual experience. A model developed from the qualitative study is presented and future research is discussed.