DOCSLIB.ORG

A Networking Approach to Grid Computing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

TEAM LinG - Live, Informative, Non-cost and Genuine! ffirs.qxd 10/11/2004 3:44 PM Page i A NETWORKING APPROACH TO GRID COMPUTING TEAM LinG - Live, Informative, Non-cost and Genuine! ffirs.qxd 10/11/2004 3:44 PM Page ii TEAM LinG - Live, Informative, Non-cost and Genuine! ffirs.qxd 10/11/2004 3:44 PM Page iii A NETWORKING APPROACH TO GRID COMPUTING DANIEL MINOLI Managing Director Leading-Edge Networks Incorporated A JOHN WILEY & SONS, INC., PUBLICATION TEAM LinG - Live, Informative, Non-cost and Genuine! ffirs.qxd 10/11/2004 3:44 PM Page iv Copyright © 2005 by John Wiley & Sons, Inc. All rights reserved. Published by John Wiley & Sons, Inc., Hoboken, New Jersey. Published simultaneously in Canada. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, scanning or otherwise, except as permitted under Section 107 or 108 of the 1976 United States Copyright Act, without either the prior written permission of the Publisher, or authorization through payment of the appropriate per-copy fee to the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, (978) 750-8400, fax (978) 646-8600, or on the web at www.copyright.com. Requests to the Publisher for permission should be addressed to the Permissions Department, John Wiley & Sons, Inc., 111 River Street, Hoboken, NJ 07030, (201) 748-6011, fax (201) 748-6008. Limit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts in preparing this book, they make no representation or warranties with respect to the accuracy or completeness of the contents of this book and specifically disclaim any implied warranties of merchantability or fitness for a particular purpose. No warranty may be created or extended by sales representatives or written sales materials. The advice and strategies contained herein may not be suitable for your situation. You should consult with a professional where appropriate. Neither the publisher nor author shall be liable for any loss of profit or any other commercial damages, including but not limited to special, incidental, consequential, or other damages. For general information on our other products and services please contact our Customer Care Department within the U.S. at 877-762-2974, outside the U.S. at 317-572-3993 or fax 317-572-4002. Wiley also publishes its books in a variety of electronic formats. Some content that appears in print, however, may not be available in electronic format. Library of Congress Cataloging-in-Publication Data is available. ISBN 0-471-68756-1 Printed in the United States of America. 10987654321 TEAM LinG - Live, Informative, Non-cost and Genuine! ffirs.qxd 10/11/2004 3:44 PM Page v For Anna, Emma, Emile, Gabrielle, Gino, Angela, and Peter TEAM LinG - Live, Informative, Non-cost and Genuine! ffirs.qxd 10/11/2004 3:44 PM Page vi TEAM LinG - Live, Informative, Non-cost and Genuine! ftoc.qxd 10/11/2004 3:48 PM Page vii Contents About the Author xiii Preface xv Acknowledgments xvii 1 Introduction 1 1.1 What Is Grid Computing And What Are The Key Issues? 1 1.2 Potential Applications and Financial Benefits of Grid Computing 10 1.3 Grid Types, Topologies, Components, and Layers— 13 A Preliminary View 1.4 Comparison with Other Approaches 21 1.5 A First Look at Grid Computing Standards 24 1.6 A Pragmatic Course of Investigation 27 2 Grid Benefits and Status of Technology 31 2.1 Motivations for Considering Computational Grids 31 2.2 Brief History of Computing, Communications, and Grid Computing 38 Communication 44 Computation 46 Grid Technology 47 2.3 Is Grid Computing Ready for Prime Time? 47 2.4 Early Suppliers and Vendors 51 2.5 Possible Economic Value 53 2.5.1 Possible Economic Value: One State’s Positioning 53 2.5.2 Possible Economic Value: Extrapolation 56 2.6 Challenges 56 3 Components of Grid Computing Systems and Architectures 63 3.1 Overview 63 3.2 Basic Constituent Elements—A Functional View 71 Portal/User Interface Function/Functional Block 85 The Grid Security Infrastructure: User Security 75 Function/Functional Block vii TEAM LinG - Live, Informative, Non-cost and Genuine! ftoc.qxd 10/11/2004 3:48 PM Page viii viii CONTENTS Node Security Function/Functional Block 76 Broker Function/Functional Block and Directory 76 Scheduler Function/Functional Block 77 Data Management Function/Functional Block 78 Job Management And Resource Management 78 Function/Functional Block User/Application Submission Function/Functional Block 79 Resources 79 Protocols 80 3.3 Basic Constituent Elements—A Physical View 81 Networks 81 Computation 84 Storage 85 Scientific Instruments 90 Software and licenses 91 3.4 Basic Constituent Elements—Service View 91 4 Standards Supporting Grid Computing: OGSI 101 4.1 Introduction 104 4.2 Motivations for Standardization 109 4.3 Architectural Constructs 113 4.3.1 Definitions 113 4.3.2 Protocol Perspective 115 4.3.3 Going From “Art” To “Science” 123 4.4 What is OGSA/OGSI? A Practical View 125 4.5 OGSA/OGSI Service Elements and Layered Model 129 4.5.1 Key Aspects 129 4.5.2 Ancillary Aspects 132 4.5.3 Implementations of OGSI 136 4.6 What is OGSA/OGSI? A More Detailed View 139 4.6.1 Introduction 139 4.6.2 Setting the Context 140 4.6.3 The Grid Service 145 4.6.4 WSDL Extensions and Conventions 145 4.6.5 Service Data 146 4.6.6 Core Grid Service Properties 149 4.6.7 Other Details 151 4.7 A Possible Application of OGSA/OGSI to Next-Generation 151 Open-Source Outsourcing 4.7.1 Opportunities 151 4.7.2 Outsourcing Trends 151 5 Standards Supporting Grid Computing: OGSA 155 5.1 Introduction 156 5.2 Functionality Requirements 158 TEAM LinG - Live, Informative, Non-cost and Genuine! ftoc.qxd 10/11/2004 3:48 PM Page ix CONTENTS ix 5.2.1 Basic Functionality Requirements 159 5.2.2 Security Requirements 160 5.2.3 Resource Management Requirements 161 5.2.4 System Properties Requirements 162 5.2.5 Other Functionality Requirements 163 5.3 OGSA Service Taxonomy 164 5.3.1 Core Services 166 5.3.2 Data Services 168 5.3.3 Program Execution 169 5.3.4 Resource Management 173 5.4 Service Relationships 173 5.4.1 Service Composition 174 5.4.2 Service Orchestration 175 5.4.3 Types of Relationships 176 5.4.4 Platform Services 176 5.5 OGSA Services 177 5.5.1 Handle Resolution 177 5.5.2 Virtual Organization Creation and Management 178 5.5.3 Service Groups and Discovery Services 178 5.5.4 Choreography, Orchestrations and Workflow 180 5.5.5 Transactions 180 5.5.6 Metering Service 181 5.5.7 Rating Service 182 5.5.8 Accounting Service 182 5.5.9 Billing and Payment Service 182 5.5.10 Installation, Deployment, and Provisioning 183 5.5.11 Distributed Logging 183 5.5.12 Messaging and Queuing 184 5.5.13 Event 186 5.5.14 Policy and Agreements 187 5.5.15 Base Data Services 188 5.5.16 Other Data Services 190 5.5.17 Discovery Services 191 5.5.18 Job Agreement Service 192 5.5.19 Reservation Agreement Service 192 5.5.20 Data Access Agreement Service 193 5.5.21 Queuing Service 193 5.5.22 Open Grid Services Infrastructure 193 5.5.23 Common Management Model 195 5.6 Security Considerations 196 5.7 Examples of OGSA Mechanisms in Support of VO Structures 197 6 Grid System Deployment Issues, Approaches, and Tools 201 6.1 Generic Implementations: Globus Toolkit 201 6.1.1 Globus Toolkit tools and APIs 203 TEAM LinG - Live, Informative, Non-cost and Genuine! ftoc.qxd 10/11/2004 3:48 PM Page x x CONTENTS 6.1.2 Details on Key Tookit Protocols 207 6.1.3 Globus Toolkit Version 3 213 6.1.4 Applications 216 6.2 Grid Computing Environments 217 6.2.1 Introduction 217 6.2.2 Portal Services 219 6.3 Basic Grid Deployment and Management Issues 220 6.3.1 Products Categories 221 6.3.2 Business Grid Types 221 6.3.3 Deploying a Basic Computing Grid 223 6.3.4 Deploying More Complex Computing Grids 224 6.3.5 Grid Networking Infrastucture Required for Deployment 226 6.3.6 Grid Operation—Basic Steps 230 6.3.7 Deployment Challenges and Approaches 231 6.4 Grid Security Details—Deployment Peace of Mind 234 6.4.1 Basic Approach and Mechanisms 234 6.4.2 Additional Perspectives 236 6.4.3 Conclusion 249 7 Grid System Economics 251 7.1 Introduction 252 7.2 Grid Economic Services Architecture 255 7.2.1 Introduction 255 7.2.2 Overview 256 7.2.3 The Chargeable Grid Service (CGS) 258 7.2.4 The Grid Payment System 267 7.2.5 GPSHold Service 274 7.2.6 The Grid CurrencyExchange Service 275 7.2.7 An Example 277 7.2.8 Security Considerations 280 8 Communication Systems for Local Grids 281 8.1 Introduction and Positioning 281 8.2 SAN-Related Technology 284 8.2.1 Fibre Channel Technology—Native Mode 285 8.2.2 Fibre Channel Technology—Tunneled Modes 298 8.3 LAN-Related Technology 303 8.3.1 Standards 303 8.3.2 Key concepts 307 9 Communication Systems for National Grids 313 9.1 Multilink Frame Relay 313 9.1.1 Motivations and Scope 315 9.1.2 Multilink Frame Relay Basics 319 TEAM LinG - Live, Informative, Non-cost and Genuine! ftoc.qxd 10/11/2004 3:48 PM Page xi CONTENTS xi 9.2 MPLS Technology 321 9.2.1 Approaches 322 9.2.2 MPLS Operation 324 9.2.3 Key Mechanisms Supporting MPLS 328 9.2.4 Service Availability 332 10 Communication Systems for Global Grids 333 10.1 The Basics of Layer 2 and layer 3 VPNs 334 10.2 The Layer 3 Approach 334 10.3 Layer 2 MPLS VPNs-A Different Philosophy 336 10.4 Which Works Better Where? 337 10.5 A Grid Computing Application 338 References 339 Glossary 353 Index 365 TEAM LinG - Live, Informative, Non-cost and Genuine! ftoc.qxd 10/11/2004 3:48 PM Page xii TEAM LinG - Live, Informative, Non-cost and Genuine! fbetw.qxd 10/11/2004 3:51 PM Page xiii About the Author Daniel Minoli has many years of IT, telecom, and networking experience for end users and carriers, including work at AIG, ARPA think tanks, Bell Telephone Lab- oratories, ITT, Prudential Securities, Bell Communications Research (Bellcore/Tel- cordia), and AT&T (1975–2001).
Recommended publications
  • On Abundancy Index of Some Special Class of Numbers

    On Abundancy Index of Some Special Class of Numbers

    Sohag J. Math. 4, No. 2, 37-40 (2017) 37 Sohag Journal of Mathematics An International Journal http://dx.doi.org/10.18576/sjm/040202 On Abundancy Index of Some Special Class of Numbers Bhabesh Das1,∗ and Helen K. Saikia2 1 Department of Mathematics, B.P.C.College, Assam, 781127, India 2 Department of Mathematics, Gauhati University, Assam, 781014, India Received: 10 Dec. 2015, Revised: 12 Sep. 2016, Accepted: 23 Sep. 2016 Published online: 1 May 2017 σ(n) σ Abstract: For any positive integer n, abundancy index I(n) is defined as I(n) = n , where (n) is the sum of all positive divisors of n. In this paper, we have discussed non trivial lower and upper bounds of I(n) for some special class of numbers like Quasi perfect numbers, Super hyperperfect numbers, Near perfect numbers and Hyperperfect numbers. Keywords: Quasi perfect number, Super hyperperfect number, Near perfect number, Hyperperfect number p−1 1 Introduction of n. If m = 2 Mp is an even perfect number, where p p both p and Mp = 2 − 1 are primes, then n = 2m, n = 2 m We known divisor function σ(n) is the sum of all positive and n = (2p − 1)m are near perfect numbers. There are divisors of n , including 1 and n itself. The abundancy finitely many near perfect numbers other than these three p index I(n) for any positive integer n is associated with the shapes. The primes of the form Mp = 2 − 1 are called divisor function σ(n) and is defined as Mersenne primes.
  • Generalized Perfect Numbers

    Generalized Perfect Numbers

    Acta Univ. Sapientiae, Mathematica, 1, 1 (2009) 73–82 Generalized perfect numbers Antal Bege Kinga Fogarasi Sapientia–Hungarian University of Sapientia–Hungarian University of Transilvania Transilvania Department of Mathematics and Department of Mathematics and Informatics, Informatics, Tˆargu Mure¸s, Romania Tˆargu Mure¸s, Romania email: [email protected] email: [email protected] Abstract. Let σ(n) denote the sum of positive divisors of the natural number n. A natural number is perfect if σ(n) = 2n. This concept was already generalized in form of superperfect numbers σ2(n)= σ(σ(n)) = k+1 k−1 2n and hyperperfect numbers σ(n)= k n + k . In this paper some new ways of generalizing perfect numbers are inves- tigated, numerical results are presented and some conjectures are estab- lished. 1 Introduction For the natural number n we denote the sum of positive divisors by arXiv:1008.0155v1 [math.NT] 1 Aug 2010 σ(n)= X d. d|n Definition 1 A positive integer n is called perfect number if it is equal to the sum of its proper divisors. Equivalently: σ(n)= 2n, where AMS 2000 subject classifications: 11A25, 11Y70 Key words and phrases: perfect number, superperfect number, k-hyperperfect number 73 74 A. Bege, K. Fogarasi Example 1 The first few perfect numbers are: 6, 28, 496, 8128, . (Sloane’s A000396 [15]), since 6 = 1 + 2 + 3 28 = 1 + 2 + 4 + 7 + 14 496 = 1 + 2 + 4 + 8 + 16 + 31 + 62 + 124 + 248 Euclid discovered that the first four perfect numbers are generated by the for- mula 2n−1(2n − 1).
  • Cluster, Grid and Cloud Computing: a Detailed Comparison

    Cluster, Grid and Cloud Computing: a Detailed Comparison

    The 6th International Conference on Computer Science & Education (ICCSE 2011) August 3-5, 2011. SuperStar Virgo, Singapore ThC 3.33 Cluster, Grid and Cloud Computing: A Detailed Comparison Naidila Sadashiv S. M Dilip Kumar Dept. of Computer Science and Engineering Dept. of Computer Science and Engineering Acharya Institute of Technology University Visvesvaraya College of Engineering (UVCE) Bangalore, India Bangalore, India [email protected] [email protected] Abstract—Cloud computing is rapidly growing as an alterna- with out any prior reservation and hence eliminates over- tive to conventional computing. However, it is based on models provisioning and improves resource utilization. like cluster computing, distributed computing, utility computing To the best of our knowledge, in the literature, only a few and grid computing in general. This paper presents an end-to- end comparison between Cluster Computing, Grid Computing comparisons have been appeared in the field of computing. and Cloud Computing, along with the challenges they face. This In this paper we bring out a complete comparison of the could help in better understanding these models and to know three computing models. Rest of the paper is organized as how they differ from its related concepts, all in one go. It also follows. The cluster computing, grid computing and cloud discusses the ongoing projects and different applications that use computing models are briefly explained in Section II. Issues these computing models as a platform for execution. An insight into some of the tools which can be used in the three computing and challenges related to these computing models are listed models to design and develop applications is given.
  • Grid Computing: What Is It, and Why Do I Care?*

    Grid Computing: What Is It, and Why Do I Care?*

    Grid Computing: What Is It, and Why Do I Care?* Ken MacInnis <[email protected]> * Or, “Mi caja es su caja!” (c) Ken MacInnis 2004 1 Outline Introduction and Motivation Examples Architecture, Components, Tools Lessons Learned and The Future Questions? (c) Ken MacInnis 2004 2 What is “grid computing”? Many different definitions: Utility computing Cycles for sale Distributed computing distributed.net RC5, SETI@Home High-performance resource sharing Clusters, storage, visualization, networking “We will probably see the spread of ‘computer utilities’, which, like present electric and telephone utilities, will service individual homes and offices across the country.” Len Kleinrock (1969) The word “grid” doesn’t equal Grid Computing: Sun Grid Engine is a mere scheduler! (c) Ken MacInnis 2004 3 Better definitions: Common protocols allowing large problems to be solved in a distributed multi-resource multi-user environment. “A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities.” Kesselman & Foster (1998) “…coordinated resource sharing and problem solving in dynamic, multi- institutional virtual organizations.” Kesselman, Foster, Tuecke (2000) (c) Ken MacInnis 2004 4 New Challenges for Computing Grid computing evolved out of a need to share resources Flexible, ever-changing “virtual organizations” High-energy physics, astronomy, more Differing site policies with common needs Disparate computing needs
  • Cloud Computing Over Cluster, Grid Computing: a Comparative Analysis

    Cloud Computing Over Cluster, Grid Computing: a Comparative Analysis

    Journal of Grid and Distributed Computing Volume 1, Issue 1, 2011, pp-01-04 Available online at: http://www.bioinfo.in/contents.php?id=92 Cloud Computing Over Cluster, Grid Computing: a Comparative Analysis 1Indu Gandotra, 2Pawanesh Abrol, 3 Pooja Gupta, 3Rohit Uppal and 3Sandeep Singh 1Department of MCA, MIET, Jammu 2Department of Computer Science & IT, Jammu Univ, Jammu 3Department of MCA, MIET, Jammu e-mail: [email protected], [email protected], [email protected], [email protected], [email protected] Abstract—There are dozens of definitions for cloud Virtualization is a technology that enables sharing of computing and through each definition we can get the cloud resources. Cloud computing platform can become different idea about what a cloud computing exacting is? more flexible, extensible and reusable by adopting the Cloud computing is not a very new concept because it is concept of service oriented architecture [5].We will not connected to grid computing paradigm whose concept came need to unwrap the shrink wrapped software and install. into existence thirteen years ago. Cloud computing is not only related to Grid Computing but also to Utility computing The cloud is really very easier, just to install single as well as Cluster computing. Cloud computing is a software in the centralized facility and cover all the computing platform for sharing resources that include requirements of the company’s users [1]. software’s, business process, infrastructures and applications. Cloud computing also relies on the technology II. CLUSTER COMPUTING of virtualization. In this paper, we will discuss about Grid computing, Cluster computing and Cloud computing i.e.
  • “Grid Computing”

    “Grid Computing”

    VISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY A seminar report on “Grid Computing” Submitted by Nagaraj Baddi (2SD07CS402) 8th semester DEPARTMENT OF COMPUTER SCIENCE ENGINEERING 2009-10 1 VISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE ENGINEERING CERTIFICATE Certified that the seminar work entitled “Grid Computing” is a bonafide work presented by Mr. Nagaraj.M.Baddi, bearing USN 2SD07CS402 in a partial fulfillment for the award of degree of Bachelor of Engineering in Computer Science Engineering of the Vishveshwaraiah Technological University Belgaum, during the year 2009-10. The seminar report has been approved as it satisfies the academic requirements with respect to seminar work presented for the Bachelor of Engineering Degree. Staff in charge H.O.D CSE (S. L. DESHPANDE) (S. M. JOSHI) Name: Nagaraj M. Baddi USN: 2SD07CS402 2 INDEX 1. Introduction 4 2. History 5 3. How Grid Computing Works 6 4. Related technologies 8 4.1 Cluster computing 8 4.2 Peer-to-peer computing 9 4.3 Internet computing 9 5. Grid Computing Logical Levels 10 5.1 Cluster Grid 10 5.2 Campus Grid 10 5.3 Global Grid 10 6. Grid Architecture 11 6.1 Grid fabric 11 6.2 Core Grid middleware 12 6.3 User-level Grid middleware 12 6.4 Grid applications and portals. 13 7. Grid Applications 13 7.1 Distributed supercomputing 13 7.2 High-throughput computing 14 7.3 On-demand computing 14 7.4 Data-intensive computing 14 7.5 Collaborative computing 15 8. Difference: Grid Computing vs Cloud Computing 15 9.
  • Computer Systems Architecture

    Computer Systems Architecture

    CS 352H: Computer Systems Architecture Topic 14: Multicores, Multiprocessors, and Clusters University of Texas at Austin CS352H - Computer Systems Architecture Fall 2009 Don Fussell Introduction Goal: connecting multiple computers to get higher performance Multiprocessors Scalability, availability, power efficiency Job-level (process-level) parallelism High throughput for independent jobs Parallel processing program Single program run on multiple processors Multicore microprocessors Chips with multiple processors (cores) University of Texas at Austin CS352H - Computer Systems Architecture Fall 2009 Don Fussell 2 Hardware and Software Hardware Serial: e.g., Pentium 4 Parallel: e.g., quad-core Xeon e5345 Software Sequential: e.g., matrix multiplication Concurrent: e.g., operating system Sequential/concurrent software can run on serial/parallel hardware Challenge: making effective use of parallel hardware University of Texas at Austin CS352H - Computer Systems Architecture Fall 2009 Don Fussell 3 What We’ve Already Covered §2.11: Parallelism and Instructions Synchronization §3.6: Parallelism and Computer Arithmetic Associativity §4.10: Parallelism and Advanced Instruction-Level Parallelism §5.8: Parallelism and Memory Hierarchies Cache Coherence §6.9: Parallelism and I/O: Redundant Arrays of Inexpensive Disks University of Texas at Austin CS352H - Computer Systems Architecture Fall 2009 Don Fussell 4 Parallel Programming Parallel software is the problem Need to get significant performance improvement Otherwise, just use a faster uniprocessor,
  • Strategies for Managing Business Disruption Due to Grid Computing

    Strategies for Managing Business Disruption Due to Grid Computing

    Strategies for managing business disruption due to Grid Computing by Vidyadhar Phalke Ph.D. Computer Science, Rutgers University, New Jersey, 1995 M.S. Computer Science, Rutgers University, New Jersey, 1992 B.Tech. Computer Science, Indian Institute of Technology, Delhi, 1989 Submitted to the MIT Sloan School of Management in Partial Fulfillment of the Requirements for the Degree of Master of Science in the Management of Technology at the Massachusetts Institute of Technology June 2003 © 2003 Vidyadhar Phalke All Rights Reserved The author hereby grants to MIT permission to reproduce and to distribute publicly paper and electronic copies of this thesis document in whole or in part Signature of Author: MIT Sloan School of Management 9 May 2003 Certified By: Starling D. Hunter III Theodore T. Miller Career Development Assistant Professor Thesis Supervisor Accepted By: David A. Weber Director, Management of Technology Program 2 Strategies for managing business disruption due to Grid Computing by Vidyadhar Phalke Submitted to the MIT Sloan School of Management on May 9 2003 in partial fulfillment of the requirements for the degree of Master of Science in the Management of Technology ABSTRACT In the technology centric businesses disruptive technologies displace incumbents time and again, sometimes to the extent that incumbents go bankrupt. In this thesis we would address the issue of what strategies are essential to prepare for and to manage disruptions for the affected businesses and industries. Specifically we will look at grid computing that is poised to disrupt (1) certain Enterprise IT departments, and (2) the software industry in the high-performance and web services space.
  • On Perfect Numbers and Their Relations 1 Introduction

    On Perfect Numbers and Their Relations 1 Introduction

    Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 27, 1337 - 1346 On Perfect Numbers and their Relations Recep G¨ur 2000 Evler Mahallesi Boykent Sitesi E Blok 26/7 Nevsehir, Turkey [email protected] Nihal Bircan Technische Universitaet Berlin Fakultaet II Institut f¨ur Mathematik MA 8 − 1 Strasse des 17. Juni 136 D-10623 Berlin, Germany [email protected] Abstract In this paper, we get some new formulas for generalized perfect numbers and their relationship between arithmetical functions φ, σ concerning Ore’s harmonic numbers and by using these formulas we present some examples. Mathematics Subject Classification: 11A25, 11A41, 11Y70 Keywords: perfect number, 2-hyperperfect number, Euler’s totient function, Ore harmonic number 1 Introduction In this section, we aimed to provide general information on perfect numbers shortly. Here and throughout the paper we assume m, n, k, d, b are positive integers and p is prime. N is called perfect number, if it is equal to the sum of its proper divisors. The first few perfect numbers are 6, 28, 496, 8128,... since, 6 = 1+2+3 28 = 1+2+4+7+14 496 = 1+2+4+8+16+31+62+124+248 Euclid discovered the first four perfect numbers which are generated by the formula 2n−1(2n−1), called Euclid number. In his book ’Elements’ he presented the proof of the formula which gives an even perfect number whenever 2n −1is 1338 Recep G¨ur and Nihal Bircan prime. In order for 2n −1 to be a prime n must itself be a prime.
  • Identities for Near and Deficient Hyperperfect Numbers

    Identities for Near and Deficient Hyperperfect Numbers

    Received: 03.01.2016 Year: 2017, Pages: 01-12 Published: 13.04.2017 Original Article** Identities for Near and Deficient Hyperperfect Numbers Bhabesh Das1;* <[email protected]> Helen K.Saikia2 <[email protected]> 1Department of Mathematics,B.P.C.College,781127,Assam,India 2Department of Mathematics,Gauhati University,781014,Assam,India Abstaract − It is well-known that a positive integer n is said to be k−hyperperfect number if k + 1 k − 1 σ(n) = n + ; k k where k is a positive integer and σ(n) is the sum of all positive divisors of n. We call a number n is near k−hyperperfect number if k + 1 k − 1 σ(n) = n + + d k k and decient k−hyperperfect number if k + 1 k − 1 σ(n) = n + − d; k k where d is a proper divisor of n. In this paper, for any prime number q, we present two classes of near (q − 1)−hyperperfect number and one class of decient (q − 1)−hyperperfect number with two distinct prime factors and also present some numerical results. Keywords − Perfect number, Hyperperfect number, Near perfect number, Decient perfect number. **Edited by A. D. Godase (Editor-in-Chief). *Corresponding Author. Indian Journal in Number Theory, 2017, 01-12 2 1 Introduction For any positive integer n, divisor function σ(n) denote the sum of all positive divisors of n, X σ(n) = d: djn Denition 1.1. A positive integer n is called perfect number, if σ(n) = 2n. All known perfect numbers are even. The Euclid-Euler theorem gives the general form of even perfect numbers.
  • Contributions to Desktop Grid Computing Gilles Fedak

    Contributions to Desktop Grid Computing Gilles Fedak

    Contributions to Desktop Grid Computing Gilles Fedak To cite this version: Gilles Fedak. Contributions to Desktop Grid Computing : From High Throughput Computing to Data-Intensive Sciences on Hybrid Distributed Computing Infrastructures. Calcul parallèle, distribué et partagé [cs.DC]. Ecole Normale Supérieure de Lyon, 2015. tel-01158462v2 HAL Id: tel-01158462 https://hal.inria.fr/tel-01158462v2 Submitted on 7 Dec 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Copyright University of Lyon Habilitation `aDiriger des Recherches Contributions to Desktop Grid Computing From High Throughput Computing to Data-Intensive Sciences on Hybrid Distributed Computing Infrastructures Gilles Fedak 28 Mai 2015 Apr`esavis de : Christine Morin Directeur de Recherche, INRIA Pierre Sens Professeur, Universit´eParis VI Domenico Talia Professeur, University of Calabria Devant la commission d'examen form´eede : Vincent Breton Directeur de Recherche, CNRS Christine Morin Directeur de Recherche, INRIA Manish Parashar Professeur, Rutgers University Christian Perez Directeur de Recherche, INRIA Pierre Sens Professeur, Universit´eParis VI Domenico Talia Professeur, University of Calabria Contents 1 Introduction 9 1.1 Historical Context . .9 1.2 Contributions . 13 1.3 Summary of the Document . 16 2 Evolution of Desktop Grid Computing 19 2.1 A Brief History of Desktop Grid and Volunteer Computing .
  • Resume Ivo Janssen

    Resume Ivo Janssen

    Ivo J. Janssen 13266 Kerrville Folkway Austin, TX 78729 (512) 750-9455 / [email protected] Objective To be part of a successful professional services team in a pre-sales and post-sales architecture and deployment role. Summary I'm an experienced, enthusiastic and skilled professional services consultant with experience in architecting and supporting large-scale enterprise software, with extensive experience in designing and implementing custom solutions as part of pre- and post sales support activities in diverse industry verticals across five continents. I'm as comfortable in designing and coding in an engineering role as I am in on-site planning, executing and troubleshooting customer deployments in a professional services role, as well as in participating in sales calls and drafting proposals in a sales engineering role. I'm able to adapt to new environments quickly and rapidly become proficient with new systems, tools and skills. I'm a good team player who thinks beyond the problem at hand instead of following the established paths in order to find a better solution that meets both current and future needs. Professional experience • Virtual Bridges , Austin, TX, USA (Nov 2010 – present) Senior Solution Architect o Solution architect for VDI product line. • Initiate Systems / IBM , Austin, TX, USA (Sep 2008 – Nov 2010) Senior Consultant o Senior implementation engineer for Healthcare sector of Master Data Management product line. o Responsibilities include requirements gathering, product installation and configuration, custom coding, connectivity scripting on Windows and Unix, database performance tuning, customer training workshops, pre/post-sales support. o Successfully architected, implemented and brought live custom implementation projects for major hospital systems and labs in the US, including customers with up to 250 million records (1TB database) connected to 20 auxiliary systems.