Speed-up of Parallel Processing of Divisible Loads on k-dimensional Meshes and Tori
|
|
- Asher Gilbert
- 6 years ago
- Views:
Transcription
1 The Computer Journal, 46(6, c British Computer Society 2003; all rights reserved Speed-up of Parallel Processing of Divisible Loads on k-dimensional Meshes Tori KEQIN LI Department of Computer Science, State University of New York, New Paltz, NY 12561, USA lik@newpaltzedu A divisible load distribution algorithm on k-dimensional meshes tori is proposed analyzed It is found that by using our algorithm, the speed-up of parallel processing of a divisible load on k-dimensional meshes tori is bounded from above by a quantity independent of network size, due to communication overhead limited network connectivity In particular, it is shown that for k-dimensional meshes tori, as the network size becomes large, the asymptotic speed-up of processing divisible loads with corner initial processors is approximately β 1 1/2k,whereβ is the ratio of the time for computing a unit load to the time for communicating a unit load It is also proved that by choosing interior initial processors, an asymptotic speed-up of 2 k β 1 1/2k can be achieved Received 29 October 2002; revised 13 February INTRODUCTION A divisible load has the property that it can be arbitrarily divided into small load fractions which are assigned to parallel processors for processing Example applications include large-scale data file processing, signal image processing, scientific numerical computing, finiteelement engineering computations, database multimedia applications, many real-time computing problems such as target identification, searching data processing in distributed sensor networks [1] The problem of divisible load distribution on parallel distributed computing systems with static interconnection networks was first proposed by Cheng Robertazzi in 1988 [2] Since then, divisible load distribution, scheduling processing have been investigated by a number of researchers for the bus [3, 4], linear array [5], tree [3, 6, 7], two-dimensional mesh [8], two-dimensional toroidal mesh [9], three-dimensional mesh [10], hypercube [11] partitionable [12, 13] networks Other studies can be found in [14, 15, 16, 17] 1 The well-known Amdahl s Law [18] states that if fraction f of a computation is sequential cannot be parallelized at all, the speed-up is bounded from above by 1/f no matter how many processors are used For a divisible load, there is no inherently sequential part, that is f 0 However, this does not imply that unbounded speed-up can be achieved The reason is that Amdahl s Law has no restriction on a parallel system, where processors can communicate with each other without cost When a divisible load is processed on a multicomputer with a static interconnection 1 The reader is also referred to the Website tom/dlthtml for more references in this field network, there is communication overhead for distributing load among the processors Also, the network topology, that determines the speed at which a divisible load is distributed over a network, has a strong impact on performance (ie parallel processing time speed-up In this paper, we propose a divisible load distribution algorithm on k-dimensional meshes tori analyze the parallel time speed-up of the algorithm We derive a recurrence relation so that the ultimate parallel processing time asymptotic speed-up can be easily calculated for k-dimensional meshes tori It is found that by using our algorithm, the speed-up of parallel processing of a divisible load on k-dimensional meshes tori is bounded from above by a quantity independent of network size, due to communication overhead limited network connectivity In particular, it is shown that for k-dimensional meshes tori, as the network size becomes large, the asymptotic speed-up of processing divisible loads with corner initial processors is approximately β 1 1/2k,where β is the ratio of the time for computing a unit load to the time for communicating a unit load We also prove that by choosing interior initial processors, an asymptotic speed-up of 2 k β 1 1/2k can be achieved [19] The significance of our research is three-fold First, these results include the earlier results for linear arrays two-dimensional meshes in [13] as special cases Second, this paper provides a unified treatment for divisible load distribution on k-dimensional meshes tori for all k 1 Third, divisible load distribution on k-dimensional meshes tori with k>3has never been addressed before our work gives an initial investigation on these networks
2 626 K LI 2 THE MODEL We consider parallel processing of a divisible load on a multicomputer system with N processors P 1,P 2,,P N connected by a static interconnection network Each processor P i has n i neighbors It is assumed that P i has n i separate ports for communication with each of the n i neighbors; ie processor P i can send messages to all its n i neighbors simultaneously Once a processor sends a load fraction to a neighbor, it can proceed with other computation communication activities This provides the capability to overlap computation communication enhances the system performance However, a neighbor (receiver must wait until a load fraction arrives before it starts to process the load fraction It is this waiting time that limits the overall system performance Let T cm be the time to transmit a unit load along a link The time to send a load to a neighbor is proportional to the size of the load, with a negligible communication startup time Let be the time to process a unit load on a processor Again, the computation time is proportional to the size of a load We use β /T cm to denote the computation granularity, which is a parameter indicating the nature of a parallel computation a parallel architecture A large (small β gives a small (large communication overhead A computation intensive load has a large β a communication intensive load has a small β An infinite β implies that the communication cost is negligible 3 THE LOAD DISTRIBUTION ALGORITHM A k-dimensional mesh M k can be specified by k 1 positive integers N 1,N 2,,N k,wheren r 2 is the size in the rth dimension of the mesh, 1 r k M k has a set of N N 1 N 2 N k processors, P k {P j1,j 2,,j k 1 j r N r, 1 r k} Each processor P j1,j 2,,j k has neighbors P j1,,j r ±1,,j k if they exist Assume that there is a load x initially on processor P N1,N 2,,N k, called the initial processor The load is to be distributed over all the N processors of a k- dimensional mesh for parallel processing We now describe our algorithm A N1,N 2,,N k for processing divisible loads on a k-dimensional mesh M k of size N N 1 N 2 N k For notational convenience, a single processor is treated as a zero-dimensional mesh M 0 with a one-processor set P 0 Our algorithm A N1,N 2,,N k for processing a divisible load x on a k-dimensional mesh M k works as follows (A1 When N 1, the single processor processes load x by itself (A2 In general, when N > 1, the initial processor P N1,N 2,,N k sends a faction α of the load x to processor P N1,N 2,,N k 1 The remaining load (1 αx is processed by the (k 1-dimensional mesh M k 1 of size N 1 N 2 N k 1 with the set of processors P k 1 {P j1,j 2,,j k 1,N k 1 j r N r, 1 r k 1} by using the load distribution algorithm A N1,N 2,,N k 1 (A3 If N k > 2, processor P N1,N 2,,N k 1 is regarded as the initial processor of the k-dimensional mesh M k of size N 1 N 2 (N k 1 with the set of processors P k {P j 1,j 2,,j k 1 j r N r, 1 r k 1, 1 j k N k 1} Upon receiving the load αx by processor P N1,N 2,,N k 1, thek-dimensional mesh M k processes the load αx by using the load distribution algorithm A N1,N 2,,N k 1 (A4 If N k 2, processor P N1,N 2,,N k 1 is regarded as the initial processor of the (k 1-dimensional mesh M k 1 of size N 1 N 2 N k 1 with the set of processors P k 1 {P j 1,j 2,,j k 1,N k 1 1 j r N r, 1 r k 1} Upon receiving the load αx by processor P N1,N 2,,N k 1, the (k 1-dimensional mesh M k 1 processes the load αx by using the load distribution algorithm A N1,N 2,,N k 1 A k-dimensional torus is similar to a k-dimensional mesh except that each processor P j1,j 2,,j k has neighbors P j1,,(j r ±1 mod N r,,j k Since a k-dimensional torus contains a k-dimensional mesh as its subnetwork, algorithm A N1,N 2,,N k is also applicable for load distribution on k-dimensional tori 4 PARALLEL TIME AND SPEED-UP Let T N1,N 2,,N k denote the parallel time for processing one unit of load on a k-dimensional mesh M k of size N N 1 N 2 N k by using the load distribution algorithm A N1,N 2,,N k Since both computation communication times are linearly proportional to the amount of load, the time for processing x units of load on a k-dimensional mesh M k of size N N 1 N 2 N k is xt N1,N 2,,N k for all x 0 The speed-up S N1,N 2,,N k is defined as the ratio of the sequential processing time to the parallel processing time, namely T 1 S N1,N 2,,N k T N1,N 2,,N k T N1,N 2,,N k We are particularly interested in T,,, S,,, lim N 1,N 2,,N k T N 1,N 2,,N k lim S N 1,N 2,,N k, N 1,N 2,,N k
3 SPEED-UP OF PARALLEL PROCESSING OF DIVISIBLE LOADS 627 ie the ultimate parallel processing time the asymptotic speed-up when the size of a k-dimensional mesh goes to infinity We use T S to represent T,,, S,,, respectively, where there are k s We now prove the main result of the paper THEOREM 41 For k-dimensional meshes, we have T 1 ( 4 T cm + Tcm 2 T 1 ( 4T (k 1 T cm + Tcm 2, k 2 Furthermore, we have S β 1 1/2k for large β all k 1 Proof The value T N1,N 2,,N k can be obtained recursively as follows First, by (A1, we have T 1 In general, when N > 1, processor P N1,N 2,,N k can proceed without waiting after sending the load fraction α in (A2 Hence, the time spent by M k 1 is (1 αt N1,N 2,,N k 1 In(A3,it takes αt cm time for the load fraction α to reach processor P N1,N 2,,N k 1 Then M k requires αt N 1,N 2,,N k 1 time to process the load fraction α To minimize the parallel processing time T N1,N 2,,N k, we need to make sure that both M k 1 M k spend the same amount of time, ie This implies that T N1,N 2,,N k (1 αt N1,N 2,,N k 1 α(t cm + T N1,N 2,,N k 1 α T N1,N 2,,N k 1 T N1,N 2,,N k 1 + T N1,N 2,,N k 1 + T cm Hence, T N1,N 2,,N k satisfies the following recurrence relation, T 1 (1 T N1,N 2,,N k T N 1,N 2,,N k 1 (T N1,N 2,,N k 1 + T cm, T N1,N 2,,N k 1 + T N1,N 2,,N k 1 + T cm N>1 (2 Taking the limit on both sides of Equation (2, we obtain T (T + T cm, k 1 T + + T cm T T (k 1 (T + T cm, k 2 T + T (k 1 + T cm That is, T 2 + T cmt T cm 0, k 1 T 2 + T cmt T (k 1 T cm 0, k 2 Solving these quadratic equations, we get T T with k 2inthetheorem As for asymptotic speed-up, we prove by induction on k 1thatS β 1 1/2k for large β When k 1, we note that S T 2 4 T cm + T 2 cm T cm 4β β for large β Whenk 2, we have S T 2 4T (k 1 T cm + T 2 cm T cm 4(T(k 1 /T cm By the induction hypothesis, ie S (k 1 /T cm T (k 1 T (k 1 /T cm β β 1 1/2k 1, T (k 1 /T cm we know that T (k 1 /T cm β 1/2k 1 for large β Therefore, S β 1 1/2k, (3 4β 1/2k for large β This proves the theorem The following corollaries are immediate consequences of Theorem 41 for two- three-dimensional meshes COROLLARY 41 For two-dimensional meshes, we have T, 1 ( 4T T cm + Tcm 2 ( 1 2 Furthermore, S, 2T cm 4 T cm + T 2 cm T 2 cm T cm β 3/4, T, 2 4β for large β COROLLARY 42 For three-dimensional meshes, we have T,, 1 ( 4T, T cm + Tcm 2 1 2T cm 2T cm 4 T cm +Tcm 2 2 T cm 2 T cm 2 T cm
4 628 K LI Furthermore, S,, T,, 2 2 β 7/8 4β for large β It is clear that Theorem 41 also holds for k-dimensional tori COROLLARY 43 For k-dimensional tori, we have T 1 ( 4 T cm + Tcm 2 T 1 ( 4T (k 1 T cm + Tcm 2, k 2 Furthermore, we have S β 1 1/2k for large β all k 1 In Table 1, we demonstrate numerical values of asymptotic speed-up S For each pair of β k, we give three values of S The first value is the exact value of S calculated by using Theorem 41 The second third values are estimations of S in Equation (3 These estimations are more accurate for small k large β than for large k small β 5 PERFORMANCE IMPROVEMENT Improved speed-up can be achieved by placing the initial load on an interior processor instead of corner boundary processors A submesh M k of a k-dimensional mesh M k of size N N 1 N 2 N k contains processors P k {P j 1,j 2,,j k a r j r b r, 1 r k}, where a r <b r for all 1 r k b r a r +1isthesizein the rth dimension of the submesh A processor P j1,j 2,,j k is called a boundary processor of M k in dimension r if j r a r or j r b r, a corner processor of M k if j r a r or j r b r for all 1 r k A processor P j1,j 2,,j k is called an interior processor of M k in dimension r if a r <j r <b r We say that a k-dimensional mesh M k is split at s r in dimension r if M k is divided into two disjoint submeshes M k containing processors P k {P j 1,j 2,,j k 1 j r N r,r r, 1 j r s r }, M k containing processors P k {P j 1,j 2,,j k 1 j r N r,r r, s r + 1 j r N r } If a processor P j1,j 2,,j k is an interior processor of a k-dimensional mesh M k in dimensions r 1,r 2,,r m, it will eventually become a corner processor of a submesh by splitting M k for m times Let T (m N 1,N 2,,N k denote the parallel time for processing one unit of load on a k-dimensional mesh M k of size N N 1 N 2 N k when the initial processor is an interior processor in m of the k dimensions, where 0 m k T (0 N 1,N 2,,N k is actually T N1,N 2,,N k Define T,,, (m lim T (m N 1,N 2,,N k N 1,N 2,,N k S,,, (m lim N 1,N 2,,N k S(m N 1,N 2,,N k, with abbreviation T (m S(m THEOREM 51 For k-dimensional meshes tori, we have T (m T /2 m S (m 2m β 1 1/2k for all 0 m k When the initial processor is an interior processor in all the k dimensions, the asymptotic speed-up of 2 k β 1 1/2k can be achieved Proof When m 1, the initial processor P N1,,j r,,n k is an interior processor in one dimension r The initial processor sends a fraction α of load x to one of its neighbors in dimension r, say,p N1,,j r +1,,N k The initial processor the selected neighbor are initial processors of two separate k-dimensional meshes M k M k obtained by splitting M k at j r in the rth dimension These two submeshes process the loads αx (1 αx respectively by using algorithm A N1,N 2,,N k It is clear that T (1 (1 αt α(t + T cm, which yields T (1 T (T + T cm T (β 1/2k + 1 2T + T cm 1/2k + 1 T 2 S (1 /T (1 1 1/2k for large β When m>1, the initial processor is an interior processor in dimensions r 1,r 2,,r m Thek-dimensional mesh M k is first split at j r1 in dimension r 1 The two resulted submeshes are further split in dimension r 2, the four resulted submeshes are further split in dimension r 3 so on It is not difficult to see that T (m T (m (1 αt (m 1 T (m 1 T (m (m 1 α(t + T cm (m 1 (T 2T (m 1 + T cm + T cm T (m 1 /2forall1 m k Hence, T (m T /2 m,s (m /T (m 2m ( /T 2 m β 1 1/2k In Table 2, we demonstrate numerical values of asymptotic speed-up S (m where k 3 It can be seen that the doubling effect S (m 2S(m 1 is stronger for small m large β than for large m small β
5 SPEED-UP OF PARALLEL PROCESSING OF DIVISIBLE LOADS 629 TABLE 1 Numerical values of asymptotic speed-up S β k 6 NOTES ON RELATED WORK Performance limits to parallel processing of divisible loads on static interconnection networks have been observed previously Asymptotic performance analyses for linear arrays were conducted in [20] The special cases of Theorems where k 1 for linear arrays are essentially similar to those in [21], the special cases of Theorems where k 2 for twodimensional meshes were obtained in [12] An infinite twodimensional mesh with the initial processor in the center was considered in [8] However, our study deals with finite meshes It was shown in [10] that the speed-up of O(β can be achieved in three-dimensional meshes The result is
6 630 K LI TABLE 2 Numerical values of asymptotic speed-up S (m (k 3 β obtained by adopting the circuit-switched routing technique which assumes that communication times are independent of the distances among processors Note that part (A4 of algorithm A N1,N 2,,N k is not related to the analysis in this paper The reason is that, in this paper, we increase the network size N by fixing k increasing the sizes of all the dimensions It is also possible to increase N by fixing N 1,N 2,,N k increasing the number of dimensions k For instance, when all the N r sarefixed at 2 N increases as k increases, we get hypercubes For hypercubes, we use the (k 1-dimensional mesh M k 1 in (A2 the (k 1-dimensional mesh M k 1 in (A4 to process the load fractions (1 αx αx, respectively Therefore, the analysis of parallel time speed-up for processing divisible loads on hypercubes follows a different direction [13] 7 CONCLUDING REMARKS We have proposed a divisible load distribution algorithm on k-dimensional meshes tori analyzed the parallel time speed-up of the algorithm We have shown that by using our algorithm on k-dimensional meshes tori, as the network size becomes large, the asymptotic speed-up of processing divisible loads with corner initial processors is approximately β 1 1/2k We have also proved that by choosing interior initial processors, the asymptotic speed-up of 2 k β 1 1/2k can be achieved The improved speed-up for large k is due to the increased network connectivity which yields a faster speed for load distribution Our work includes earlier results of linear arrays two-dimensional meshes as special cases, provides a unified treatment for divisible load distribution on k-dimensional meshes tori for all k 1 gives an initial investigation of divisible load distribution on k-dimensional meshes tori with k>3 m ACKNOWLEDGEMENTS The author wishes to express his gratitude to two anonymous reviewers for their criticism comments This material is based upon work supported by the US National Science Foundation under Grant No CCR Any opinions, findings conclusions or recommendations expressed in this material are those of the author do not necessarily reflect the views of the National Science Foundation REFERENCES [1] Bharadwaj, V, Ghose, D, Mani, V Robertazzi, T G (1996 Scheduling Divisible Loads in Parallel Distributed Systems IEEE Computer Society Press, Los Alamitos, CA [2] Cheng, Y C Robertazzi, T G (1988 Distributed computation with communication delays IEEE Trans Aerospace Electron Syst, 24, [3] Bataineh, S, Hsiung, T-Y Robertazzi, T G (1994 Closed form solutions for bus tree networks of processors load sharing a divisible job IEEE Trans Computers, 43, [4] Sohn, J Robertazzi, T G (1996 Optimal divisible job load sharing for bus networks IEEE Trans Aerospace Electron Syst, 32, [5] Mani, V Ghose, D (1994 Distributed computation in linear networks: closed-form solutions IEEE Trans Aerospace Electron Syst, 30, [6] Barlas, G D (1998 Collection-aware optimum sequencing of operations closed-form solutions for the distribution of a divisible load on arbitrary processor trees IEEE Trans Parallel Distributed Syst, 9, [7] Cheng, Y C Robertazzi, T G (1990 Distributed computation for a tree network with communication delays IEEE Trans Aerospace Electron Syst, 26, [8] Błażewicz, J Drozdowski, M (1996 The performance limits of a two-dimensional network of load sharing processors Found Comput Decision Sci, 21, 3 15 [9] Błażewicz, J, Drozdowski, M, Guinard, F Trystram, D (1999 Scheduling a divisible task in a two-dimensional toroidal mesh Discrete Appl Math, 94, [10] Drozdowski, M Głazek, W (1999 Scheduling divisible loads in a three-dimensional mesh of processors Parallel Computing, 25, [11] Błażewicz, J Drozdowski, M (1995 Scheduling divisible jobs on hypercubes Parallel Computing, 21, [12] Li, K (1998 Managing divisible load on partitionable networks In Schaeffer, J (ed, High Performance Computing Systems Applications, pp Kluwer Academic Publishers, Boston, MA [13] Li, K (2003 Parallel processing of divisible loads on partitionable static interconnection networks Cluster Computing (Special Issue on Divisible Load Scheduling, 6, [14] Błażewicz, J Drozdowski, M (1997 Distributed processing of divisible jobs with communication startup costs Discrete Appl Math, 76, [15] Błażewicz, J, Drozdowski, M Markiewicz, M (1999 Divisible task scheduling concept verification Parallel Computing, 25, 87 98
7 SPEED-UP OF PARALLEL PROCESSING OF DIVISIBLE LOADS 631 [16] Ko, K (2000 Scheduling Data Intensive Parallel Processing in Distributed Networked Environments PhD dissertation Department of Electrical Computer Engineering, State University of New York, Stony Brook, New York [17] Sohn, J, Robertazzi, T G Luryi, S (1998 Optimizing computing costs using divisible load analysis IEEE Trans Parallel Distrib Syst, 9, [18] Amdahl, G M (1967 Validity of the single processor approach to achieving large scale computing capabilities In Proc AFIPS Spring Joint Computer Conf, Vol 30, pp CSREA Press [19] Li, K (2002 Speedup of parallel processing of divisible loads on k-dimensional meshes tori In Proc Int Conf on Parallel Distributed Processing Techniques Applications, Las Vegas, Nevada, June 24 27, pp [20] Ghose, D Mani, V (1994 Distributed computation with communication delays: asymptotic performance analysis J Parallel Distrib Comput, 23, [21] Bataineh, S Robertazzi, T G (1992 Ultimate performance limits for networks of load sharing processors In Proc Conf Information Sciences Systems, pp Princeton University Press, Princeton, NJ
No.6 Distributing and Scheduling Divisible Task 789 ssor Connection Graph and denote it by PCG = (P; L; S; C; A). Each node P i in P represents a proc
Vol.17 No.6 J. Comput. Sci. & Technol. Nov. 2002 Distributing and Scheduling Divisible Task on Parallel Communicating Processors LI Guodong (ΞΛ ) and ZHANG Defu (Π ) State Key Lab for Novel Software Technology,
More informationAll-port Total Exchange in Cartesian Product Networks
All-port Total Exchange in Cartesian Product Networks Vassilios V. Dimakopoulos Dept. of Computer Science, University of Ioannina P.O. Box 1186, GR-45110 Ioannina, Greece. Tel: +30-26510-98809, Fax: +30-26510-98890,
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More information9 Distributed Data Management II Caching
9 Distributed Data Management II Caching In this section we will study the approach of using caching for the management of data in distributed systems. Caching always tries to keep data at the place where
More information7 Distributed Data Management II Caching
7 Distributed Data Management II Caching In this section we will study the approach of using caching for the management of data in distributed systems. Caching always tries to keep data at the place where
More informationOn the Complexity of the Policy Improvement Algorithm. for Markov Decision Processes
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon Computer Sciences Department University of Wisconsin - Madison 0 West Dayton Street Madison,
More informationLecture 15: The subspace topology, Closed sets
Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology
More informationUsing Graph Partitioning and Coloring for Flexible Coarse-Grained Shared-Memory Parallel Mesh Adaptation
Available online at www.sciencedirect.com Procedia Engineering 00 (2017) 000 000 www.elsevier.com/locate/procedia 26th International Meshing Roundtable, IMR26, 18-21 September 2017, Barcelona, Spain Using
More informationMaximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube
Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube Kavish Gandhi April 4, 2015 Abstract A geodesic in the hypercube is the shortest possible path between two vertices. Leader and Long
More informationOn Algebraic Expressions of Generalized Fibonacci Graphs
On Algebraic Expressions of Generalized Fibonacci Graphs MARK KORENBLIT and VADIM E LEVIT Department of Computer Science Holon Academic Institute of Technology 5 Golomb Str, PO Box 305, Holon 580 ISRAEL
More informationBounds on the signed domination number of a graph.
Bounds on the signed domination number of a graph. Ruth Haas and Thomas B. Wexler September 7, 00 Abstract Let G = (V, E) be a simple graph on vertex set V and define a function f : V {, }. The function
More informationMonetary Cost and Energy Use Optimization in Divisible Load Processing
2004 Conference on Information Sciences and Systems, Princeton University, March 17 19, 2004 Monetary Cost and Energy Use Optimization in Divisible Load Processing Mequanint A. Moges, Leonardo A. Ramirez,
More informationOn the packing chromatic number of some lattices
On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department
More informationThe Fibonacci hypercube
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 187 196 The Fibonacci hypercube Fred J. Rispoli Department of Mathematics and Computer Science Dowling College, Oakdale, NY 11769 U.S.A. Steven
More informationOdd Harmonious Labeling of Some Graphs
International J.Math. Combin. Vol.3(0), 05- Odd Harmonious Labeling of Some Graphs S.K.Vaidya (Saurashtra University, Rajkot - 360005, Gujarat, India) N.H.Shah (Government Polytechnic, Rajkot - 360003,
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Explain the steps in a proof by (strong) mathematical induction Use (strong) mathematical induction
More informationThe super connectivity of augmented cubes
Information Processing Letters 106 (2008) 59 63 www.elsevier.com/locate/ipl The super connectivity of augmented cubes Meijie Ma a,, Guizhen Liu b, Jun-Ming Xu c a Department of Mathematics, Zhejiang Normal
More informationy(b)-- Y[a,b]y(a). EQUATIONS ON AN INTEL HYPERCUBE*
SIAM J. ScI. STAT. COMPUT. Vol. 12, No. 6, pp. 1480-1485, November 1991 ()1991 Society for Industrial and Applied Mathematics 015 SOLUTION OF LINEAR SYSTEMS OF ORDINARY DIFFERENTIAL EQUATIONS ON AN INTEL
More informationARITHMETIC operations based on residue number systems
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 53, NO. 2, FEBRUARY 2006 133 Improved Memoryless RNS Forward Converter Based on the Periodicity of Residues A. B. Premkumar, Senior Member,
More informationEDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS. Jordan Journal of Mathematics and Statistics (JJMS) 8(2), 2015, pp I.
EDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS M.S.A. BATAINEH (1), M.M.M. JARADAT (2) AND A.M.M. JARADAT (3) A. Let k 4 be a positive integer. Let G(n; W k ) denote the class of graphs on n vertices
More informationPROOF OF THE COLLATZ CONJECTURE KURMET SULTAN. Almaty, Kazakhstan. ORCID ACKNOWLEDGMENTS
PROOF OF THE COLLATZ CONJECTURE KURMET SULTAN Almaty, Kazakhstan E-mail: kurmet.sultan@gmail.com ORCID 0000-0002-7852-8994 ACKNOWLEDGMENTS 2 ABSTRACT This article contains a proof of the Collatz conjecture.
More informationFully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon
Fully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon Tamal Pramanick 1,a) 1 Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati
More informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More informationCLASSIFICATION OF SURFACES
CLASSIFICATION OF SURFACES JUSTIN HUANG Abstract. We will classify compact, connected surfaces into three classes: the sphere, the connected sum of tori, and the connected sum of projective planes. Contents
More informationComponent connectivity of crossed cubes
Component connectivity of crossed cubes School of Applied Mathematics Xiamen University of Technology Xiamen Fujian 361024 P.R.China ltguo2012@126.com Abstract: Let G = (V, E) be a connected graph. A r-component
More informationHeuristic Algorithms for Multiconstrained Quality-of-Service Routing
244 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 10, NO 2, APRIL 2002 Heuristic Algorithms for Multiconstrained Quality-of-Service Routing Xin Yuan, Member, IEEE Abstract Multiconstrained quality-of-service
More informationAn Improved Upper Bound for the Sum-free Subset Constant
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), Article 10.8.3 An Improved Upper Bound for the Sum-free Subset Constant Mark Lewko Department of Mathematics University of Texas at Austin
More informationBar k-visibility Graphs
Bar k-visibility Graphs Alice M. Dean Department of Mathematics Skidmore College adean@skidmore.edu William Evans Department of Computer Science University of British Columbia will@cs.ubc.ca Ellen Gethner
More informationEmbedding Large Complete Binary Trees in Hypercubes with Load Balancing
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 35, 104 109 (1996) ARTICLE NO. 0073 Embedding Large Complete Binary Trees in Hypercubes with Load Balancing KEMAL EFE Center for Advanced Computer Studies,
More informationSignature Search Time Evaluation in Flat File Databases
I. INTRODUCTION Signature Search Time Evaluation in Flat File Databases KWANGIL KO THOMAS G. ROBERTAZZI, Fellow, IEEE Stony Brook University Flat file records are the most basic of database records. In
More informationAnalytical Modeling of Parallel Programs
2014 IJEDR Volume 2, Issue 1 ISSN: 2321-9939 Analytical Modeling of Parallel Programs Hardik K. Molia Master of Computer Engineering, Department of Computer Engineering Atmiya Institute of Technology &
More informationA Distributed Formation of Orthogonal Convex Polygons in Mesh-Connected Multicomputers
A Distributed Formation of Orthogonal Convex Polygons in Mesh-Connected Multicomputers Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 3343 Abstract The
More informationPlanar graphs. Math Prof. Kindred - Lecture 16 Page 1
Planar graphs Typically a drawing of a graph is simply a notational shorthand or a more visual way to capture the structure of the graph. Now we focus on the drawings themselves. Definition A drawing of
More informationCollege of Computer & Information Science Fall 2007 Northeastern University 14 September 2007
College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007 CS G399: Algorithmic Power Tools I Scribe: Eric Robinson Lecture Outline: Linear Programming: Vertex Definitions
More informationHere, we present efficient algorithms vertex- and edge-coloring graphs of the
SIAM J. ALG. DISC. METH. Vol. 7, No. 1, January 1986 (C) 1986 Society for Industrial and Applied Mathematics 016 EFFICIENT VERTEX- AND EDGE-COLORING OF OUTERPLANAR GRAPHS* ANDRZEJ PROSKUROWSKIf AND MACIEJ
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
More informationComponent Connectivity of Generalized Petersen Graphs
March 11, 01 International Journal of Computer Mathematics FeHa0 11 01 To appear in the International Journal of Computer Mathematics Vol. 00, No. 00, Month 01X, 1 1 Component Connectivity of Generalized
More informationProgress Towards the Total Domination Game 3 4 -Conjecture
Progress Towards the Total Domination Game 3 4 -Conjecture 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006 South Africa
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationTilings of Parallelograms with Similar Right Triangles
Discrete Comput Geom (2013) 50:469 473 DOI 10.1007/s00454-013-9522-0 Tilings of Parallelograms with Similar Right Triangles Zhanjun Su Chan Yin Xiaobing Ma Ying Li Received: 1 October 2012 / Revised: 29
More informationParameterized graph separation problems
Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.
More informationFault-Tolerant Routing Algorithm in Meshes with Solid Faults
Fault-Tolerant Routing Algorithm in Meshes with Solid Faults Jong-Hoon Youn Bella Bose Seungjin Park Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science Oregon State University
More informationPerformance of Multihop Communications Using Logical Topologies on Optical Torus Networks
Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks X. Yuan, R. Melhem and R. Gupta Department of Computer Science University of Pittsburgh Pittsburgh, PA 156 fxyuan,
More information184 J. Comput. Sci. & Technol., Mar. 2004, Vol.19, No.2 On the other hand, however, the probability of the above situations is very small: it should b
Mar. 2004, Vol.19, No.2, pp.183 190 J. Comput. Sci. & Technol. On Fault Tolerance of 3-Dimensional Mesh Networks Gao-Cai Wang 1;2, Jian-Er Chen 1;3, and Guo-Jun Wang 1 1 College of Information Science
More informationDelay-minimal Transmission for Energy Constrained Wireless Communications
Delay-minimal Transmission for Energy Constrained Wireless Communications Jing Yang Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, M0742 yangjing@umd.edu
More informationMinimum-Link Watchman Tours
Minimum-Link Watchman Tours Esther M. Arkin Joseph S. B. Mitchell Christine D. Piatko Abstract We consider the problem of computing a watchman route in a polygon with holes. We show that the problem of
More informationON HARMONIOUS COLORINGS OF REGULAR DIGRAPHS 1
Volume 1 Issue 1 July 015 Discrete Applied Mathematics 180 (015) ON HARMONIOUS COLORINGS OF REGULAR DIGRAPHS 1 AUTHORS INFO S.M.Hegde * and Lolita Priya Castelino Department of Mathematical and Computational
More informationGlobal Minimization via Piecewise-Linear Underestimation
Journal of Global Optimization,, 1 9 (2004) c 2004 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Global Minimization via Piecewise-Linear Underestimation O. L. MANGASARIAN olvi@cs.wisc.edu
More informationAXIOMS FOR THE INTEGERS
AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,
More informationNew Optimal Load Allocation for Scheduling Divisible Data Grid Applications
New Optimal Load Allocation for Scheduling Divisible Data Grid Applications M. Othman, M. Abdullah, H. Ibrahim, and S. Subramaniam Department of Communication Technology and Network, University Putra Malaysia,
More informationA Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time
A Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time S. Suresh 1, V. Mani 1, S. N. Omkar 1, and H. J. Kim 2 1 Department of Aerospace Engineering,
More informationFast algorithms for max independent set
Fast algorithms for max independent set N. Bourgeois 1 B. Escoffier 1 V. Th. Paschos 1 J.M.M. van Rooij 2 1 LAMSADE, CNRS and Université Paris-Dauphine, France {bourgeois,escoffier,paschos}@lamsade.dauphine.fr
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationA Vizing-like theorem for union vertex-distinguishing edge coloring
A Vizing-like theorem for union vertex-distinguishing edge coloring Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau Abstract We introduce a variant of the vertex-distinguishing
More informationBalance of Processing and Communication using Sparse Networks
Balance of essing and Communication using Sparse Networks Ville Leppänen and Martti Penttonen Department of Computer Science University of Turku Lemminkäisenkatu 14a, 20520 Turku, Finland and Department
More informationEdge-Disjoint Cycles in Regular Directed Graphs
Edge-Disjoint Cycles in Regular Directed Graphs Noga Alon Colin McDiarmid Michael Molloy February 22, 2002 Abstract We prove that any k-regular directed graph with no parallel edges contains a collection
More informationEmbedding a graph-like continuum in some surface
Embedding a graph-like continuum in some surface R. Christian R. B. Richter G. Salazar April 19, 2013 Abstract We show that a graph-like continuum embeds in some surface if and only if it does not contain
More informationCompact Sets. James K. Peterson. September 15, Department of Biological Sciences and Department of Mathematical Sciences Clemson University
Compact Sets James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 15, 2017 Outline 1 Closed Sets 2 Compactness 3 Homework Closed Sets
More informationLecture : Topological Space
Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous
More informationLoad Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations Stefan Bischof, Ralf Ebner, and Thomas Erlebach Institut für Informatik Technische Universität München D-80290
More informationInterconnect Technology and Computational Speed
Interconnect Technology and Computational Speed From Chapter 1 of B. Wilkinson et al., PARAL- LEL PROGRAMMING. Techniques and Applications Using Networked Workstations and Parallel Computers, augmented
More informationFramework for Design of Dynamic Programming Algorithms
CSE 441T/541T Advanced Algorithms September 22, 2010 Framework for Design of Dynamic Programming Algorithms Dynamic programming algorithms for combinatorial optimization generalize the strategy we studied
More informationFlexible Coloring. Xiaozhou Li a, Atri Rudra b, Ram Swaminathan a. Abstract
Flexible Coloring Xiaozhou Li a, Atri Rudra b, Ram Swaminathan a a firstname.lastname@hp.com, HP Labs, 1501 Page Mill Road, Palo Alto, CA 94304 b atri@buffalo.edu, Computer Sc. & Engg. dept., SUNY Buffalo,
More informationCharacterization of Boolean Topological Logics
Characterization of Boolean Topological Logics Short Form: Boolean Topological Logics Anthony R. Fressola Denison University Granville, OH 43023 University of Illinois Urbana-Champaign, IL USA 61801-61802
More informationAn Efficient Method for Constructing a Distributed Depth-First Search Tree
An Efficient Method for Constructing a Distributed Depth-First Search Tree S. A. M. Makki and George Havas School of Information Technology The University of Queensland Queensland 4072 Australia sam@it.uq.oz.au
More informationOn the Component Number of Links from Plane Graphs
On the Component Number of Links from Plane Graphs Daniel S. Silver Susan G. Williams January 20, 2015 Abstract A short, elementary proof is given of the result that the number of components of a link
More informationMulti-path Routing for Mesh/Torus-Based NoCs
Multi-path Routing for Mesh/Torus-Based NoCs Yaoting Jiao 1, Yulu Yang 1, Ming He 1, Mei Yang 2, and Yingtao Jiang 2 1 College of Information Technology and Science, Nankai University, China 2 Department
More informationPrefix Computation and Sorting in Dual-Cube
Prefix Computation and Sorting in Dual-Cube Yamin Li and Shietung Peng Department of Computer Science Hosei University Tokyo - Japan {yamin, speng}@k.hosei.ac.jp Wanming Chu Department of Computer Hardware
More informationSparse Hypercube 3-Spanners
Sparse Hypercube 3-Spanners W. Duckworth and M. Zito Department of Mathematics and Statistics, University of Melbourne, Parkville, Victoria 3052, Australia Department of Computer Science, University of
More informationMinimizing Total Communication Distance of a Time-Step Optimal Broadcast in Mesh Networks
Minimizing Total Communication Distance of a Time-Step Optimal Broadcast in Mesh Networs Songluan Cang and Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton,
More informationPOWER DOMINATION OF MIDDLE GRAPH OF PATH, CYCLE AND STAR
Volume 114 No. 5 2017, 13-19 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu POWER DOMINATION OF MIDDLE GRAPH OF PATH, CYCLE AND STAR B. Thenmozhi
More informationA WILD CANTOR SET IN THE HILBERT CUBE
PACIFIC JOURNAL OF MATHEMATICS Vol. 24, No. 1, 1968 A WILD CANTOR SET IN THE HILBERT CUBE RAYMOND Y. T. WONG Let E n be the Euclidean w-space. A Cantor set C is a set homeomorphic with the Cantor middle-third
More informationSubdivided graphs have linear Ramsey numbers
Subdivided graphs have linear Ramsey numbers Noga Alon Bellcore, Morristown, NJ 07960, USA and Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv,
More informationAuthors Abugchem, F. (Fathi); Short, M. (Michael); Xu, D. (Donglai)
TeesRep - Teesside's Research Repository A Note on the Suboptimality of Nonpreemptive Real-time Scheduling Item type Article Authors Abugchem, F. (Fathi); Short, M. (Michael); Xu, D. (Donglai) Citation
More informationHowever, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).
98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationTradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter
Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter M. Bednara, O. Beyer, J. Teich, R. Wanka Paderborn University D-33095 Paderborn, Germany bednara,beyer,teich @date.upb.de,
More informationMultiple Vertex Coverings by Cliques
Multiple Vertex Coverings by Cliques Wayne Goddard Department of Computer Science University of Natal Durban, 4041 South Africa Michael A. Henning Department of Mathematics University of Natal Private
More informationNode-Independent Spanning Trees in Gaussian Networks
4 Int'l Conf. Par. and Dist. Proc. Tech. and Appl. PDPTA'16 Node-Independent Spanning Trees in Gaussian Networks Z. Hussain 1, B. AlBdaiwi 1, and A. Cerny 1 Computer Science Department, Kuwait University,
More informationAn In-place Algorithm for Irregular All-to-All Communication with Limited Memory
An In-place Algorithm for Irregular All-to-All Communication with Limited Memory Michael Hofmann and Gudula Rünger Department of Computer Science Chemnitz University of Technology, Germany {mhofma,ruenger}@cs.tu-chemnitz.de
More informationOpen and Closed Sets
Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.
More informationThe Monge Point and the 3(n+1) Point Sphere of an n-simplex
Journal for Geometry and Graphics Volume 9 (2005), No. 1, 31 36. The Monge Point and the 3(n+1) Point Sphere of an n-simplex Ma lgorzata Buba-Brzozowa Department of Mathematics and Information Sciences,
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationThe Postal Network: A Versatile Interconnection Topology
The Postal Network: A Versatile Interconnection Topology Jie Wu Yuanyuan Yang Dept. of Computer Sci. and Eng. Dept. of Computer Science Florida Atlantic University University of Vermont Boca Raton, FL
More informationUnlabeled equivalence for matroids representable over finite fields
Unlabeled equivalence for matroids representable over finite fields November 16, 2012 S. R. Kingan Department of Mathematics Brooklyn College, City University of New York 2900 Bedford Avenue Brooklyn,
More informationNew Constructions of Non-Adaptive and Error-Tolerance Pooling Designs
New Constructions of Non-Adaptive and Error-Tolerance Pooling Designs Hung Q Ngo Ding-Zhu Du Abstract We propose two new classes of non-adaptive pooling designs The first one is guaranteed to be -error-detecting
More information1 Elementary number theory
Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 160 (2012) 505 512 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam 1-planarity of complete multipartite
More informationFUTURE communication networks are expected to support
1146 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 13, NO 5, OCTOBER 2005 A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast Ariel Orda, Senior Member, IEEE, and Alexander Sprintson,
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationEXTERNAL VISIBILITY. 1. Definitions and notation. The boundary and interior of
PACIFIC JOURNAL OF MATHEMATICS Vol. 64, No. 2, 1976 EXTERNAL VISIBILITY EDWIN BUCHMAN AND F. A. VALENTINE It is possible to see any eleven vertices of an opaque solid regular icosahedron from some appropriate
More informationInterleaving Schemes on Circulant Graphs with Two Offsets
Interleaving Schemes on Circulant raphs with Two Offsets Aleksandrs Slivkins Department of Computer Science Cornell University Ithaca, NY 14853 slivkins@cs.cornell.edu Jehoshua Bruck Department of Electrical
More informationFixed points of Kannan mappings in metric spaces endowed with a graph
An. Şt. Univ. Ovidius Constanţa Vol. 20(1), 2012, 31 40 Fixed points of Kannan mappings in metric spaces endowed with a graph Florin Bojor Abstract Let (X, d) be a metric space endowed with a graph G such
More informationFountain Codes Based on Zigzag Decodable Coding
Fountain Codes Based on Zigzag Decodable Coding Takayuki Nozaki Kanagawa University, JAPAN Email: nozaki@kanagawa-u.ac.jp Abstract Fountain codes based on non-binary low-density parity-check (LDPC) codes
More informationFACES OF CONVEX SETS
FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.
More informationMA651 Topology. Lecture 4. Topological spaces 2
MA651 Topology. Lecture 4. Topological spaces 2 This text is based on the following books: Linear Algebra and Analysis by Marc Zamansky Topology by James Dugundgji Fundamental concepts of topology by Peter
More informationDivision of the Humanities and Social Sciences. Convex Analysis and Economic Theory Winter Separation theorems
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 8: Separation theorems 8.1 Hyperplanes and half spaces Recall that a hyperplane in
More informationMOURAD BAÏOU AND FRANCISCO BARAHONA
THE p-median POLYTOPE OF RESTRICTED Y-GRAPHS MOURAD BAÏOU AND FRANCISCO BARAHONA Abstract We further study the effect of odd cycle inequalities in the description of the polytopes associated with the p-median
More informationCache-Oblivious Traversals of an Array s Pairs
Cache-Oblivious Traversals of an Array s Pairs Tobias Johnson May 7, 2007 Abstract Cache-obliviousness is a concept first introduced by Frigo et al. in [1]. We follow their model and develop a cache-oblivious
More information