00001 00002 // This file is part of SPart, Spatially Located Workload Partitioner. 00003 00004 // Copyright (C) 2011, The Ohio State University 00005 // SPart developed by Erdeniz O. Bas, Erik Saule and Umit V. Catalyurek 00006 00007 // For questions, comments, suggestions, bugs please send e-mail to: 00008 // Umit V. Catalyurek catalyurek.1@osu.edu 00009 00010 // SPart is free software; you can redistribute it and/or modify it under 00011 // the terms of the GNU General Public License as published by the Free 00012 // Software Foundation; either version 2 or (at your option) any later 00013 // version. 00014 00015 // SPart is distributed in the hope that it will be useful, but WITHOUT 00016 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 00017 // FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 00018 // for more details. 00019 00020 // You should have received a copy of the GNU General Public License 00021 // along with SPart; if not, write to the Free Software Foundation, Inc., 00022 // 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 00023 00024 // As a special exception, if other files instantiate templates or use 00025 // macros or inline functions from this file, or you compile this file 00026 // and link it with other works to produce a work based on this file, 00027 // this file does not by itself cause the resulting work to be covered by 00028 // the GNU General Public License. However the source code for this file 00029 // must still be made available in accordance with section (3) of the GNU 00030 // General Public License. 00031 00032 // This exception does not invalidate any other reasons why a work based 00033 // on this file might be covered by the GNU General Public License. 00034 00035 // The full text of the GPL license version 2 is available in "gpl.txt". 00036 00048 /* 00049 * (C) Ohio State University Biomedical Informatics - HPC Lab. http://www.bmi.osu.edu/hpc 00050 * 00051 * 04/04/2010 00052 * load_rec_bisect_2d.h 00053 * 00054 * this is the implementation of 2D relaxed hierarchical 00055 * 00056 */ 00057 00058 #ifndef __REC_BISECT_MINMAX_2D_H__ 00059 #define __REC_BISECT_MINMAX_2D_H__ 00060 00061 #include <util/prefix_sum_tools.hpp> 00062 #include <util/rect_list.hpp> 00063 namespace twod 00064 { 00075 template<typename T, typename Pr, int type=0, bool middle=false> 00076 class HierRelaxed : public PartBase<T,Pr> 00077 { 00078 private: 00079 static T rec_bisect_2d_internal(int procCount, const Pr& prefixSumArray, util::RectList<T,Pr> &parts, util::rectangle r, bool orient); 00080 public: 00081 00082 virtual T part(int procCount, const Pr& prefixSumArray, util::RectList<T,Pr> &parts); 00083 virtual ~HierRelaxed(){} 00084 00086 static const int LOAD=0; 00088 static const int DIST=1; 00090 static const int VERT_ALT=2; 00092 static const int HOR_ALT=3; 00093 00094 }; 00095 00096 } 00097 #include <twod/rec_bisect_relaxed_impl.hpp> 00098 00099 #endif 00100 00101 00102