- Boost - lists.preview.boost.org

Re: [boost] [Parallel Algorithms] Queries regarding the Boost.Thread / Parallel algorithms
by Naveen 26 Mar '14

26 Mar '14

Hi, In my previous mail, I was speaking about the compiler optimization dependencies while creating a parallel version of the following code: DO J = 1, 100 DO I = 1, 100 DO K = 1, 100 C(I,J) = C(I,J) + A(I,K) * B(K,J) END DO END DO END DO As you know, the above code is the 2D-Matrix multiplication logic. I tested the above logic using various compiler optimization levels from -o0, -o1, -o2 and -o3. There were no problems due to the compiler optimizations. I have used pthreads to convert the serial code to its parallel version. Initially, the serial version took 72sec to execute and the parallel version with 4 threads took around 16sec. Please have a look at the attachment for the complete working source code. The question now is, I have used the threads as shown in the pseudo code below: int main() { create_pthreads(assign_thread_ID, call the function); join_threads(thread_ID); destroy_threads(); } function_called_by_each_thread(thread_ID) { all_computations; } All thread documentation reaches to some sort of options like this. Is this the correct way to approach the problem for creating parallel algorithms for boost threads. Please clarify, whether there are any alternative approaches available to achieve parallelism using threads. PS: Please have a look at the code for further details Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

2 1

Re: [boost] [Parallel Algorithms] Queries regarding the Boost.Thread / Parallel algorithms
by Naveen 26 Mar '14

26 Mar '14

Hi, Based on understanding the proposal, I'm just curious to know how we are gonna use the compiler optimizations when creating the parallel_xxx functions. Say any normal loop would be optimized by the compiler using any of the loop transformations like loop interchange, loop unrolling, loop fusion etc., let us consider a sample FORTRAN code to : DO J = 1, 100 DO I = 1, 100 DO K = 1, 100 C(I,J) = C(I,J) + A(I,K) * B(K,J) END DO END DO END DO which may or may not be optimized by the compiler into something like this DO K = 1, 100 DO I = 1, 100 DO J = 1, 100 C(I,J) = C(I,J) + A(I,K) * B(K,J) END DO END DO END DO so, when we try to introduce our parallel algorithm in to the loop containing J, it may be interchanged depending upon the compiler properties. So, should we plan for such scenarios. When we try to introduce our parallel functions the only way possible is to make the compiler optimizations temporarily inactive on those tasks. But, by doing so the performance of the application will be affected. Should we really tackle this scenario or am i looking into a completely irrelevant picture? Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

3 2

[bind] BOOST_BIND_NO_PLACEHOLDERS and unspecified-placeholder-type's
by Joaquín Mª López Muñoz 25 Mar '14

25 Mar '14

Hello, The non-documented BOOST_BIND_NO_PLACEHOLDERS macro suppresses the definition of (anonymous namespace)::_1, (anonymous namespace)::_2, etc., presumably to cope with potential clashes with other libs' placeholders such as Boost.Lambda's when in the presence of using directives. The problem with this is that using Boost.Bind without placeholder names requires writing code such as bind(f,boost::arg<1>(),boost::arg<2>()); but boost::arg<> is not documented!! (in fact, Boost.Bind synopsis explicitly defines _1, _2 etc. as having undocumented types unspecified-placeholder-type-1, unspecified-placeholder-type-2 and so on). Maybe Boost.Bind documentation can be changed so that BOOST_BIND_NO_PLACEHOLDERS and boost::arg<> are documented? Thank you, Joaquín M López Muñoz Telefónica Digital ________________________________ Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra política de envío y recepción de correo electrónico en el enlace situado más abajo. This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at: http://www.tid.es/ES/PAGINAS/disclaimer.aspx

4 5

[ANN] CppCon 2014 Call for Submissions
by Boris Kolpackov 25 Mar '14

25 Mar '14

Hi, CppCon is the annual, week-long face-to-face gathering for the entire C++ community. The conference is organized by the C++ community for the community and so we invite you to present. Have you learned something interesting about C++, maybe a new technique possible in C++11? Or perhaps you have implemented something cool related to C++, maybe a new C++ library? If so, consider sharing it with other C++ enthusiasts by giving a talk at CppCon 2014. Submissions deadline is May 15 with decisions sent by June 13. For topic ideas, possible formats, and submission instructions, see the Submissions page: http://cppcon.org/submissions/ Hope to hear you speak! Boris

1 0

[Fusion] Can repetitive_view support "at" function?
by TONGARI J 25 Mar '14

25 Mar '14

I know it's a bit weird for asking repetitive_view which cannot model BidirectionalSequence to support the functionality of RandomAccessSequence, but it seems quite reasonable to support "at" when the underlying sequence models RandomAccessSequence even though repetitive_view cannot model RandomAccessSequence itself. Thoughts?

2 2

[algorithm] Test failure in C++14
by Ben Pope 25 Mar '14

25 Mar '14

"clang++-3.4" -c -x c++ -std=c++1y -stdlib=libc++ -O0 -g -fno-inline -Wall -g -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_TEST_DYN_LINK=1 -DBOOST_TEST_NO_AUTO_LINK=1 -I".." -o "/home/ben/development/boost/test/build/results/boost/bin.v2/libs/algorithm/test/is_permutation_test1.test/clang-linux-3.4~c14_libc++/debug/is_permutation_test1.o" "../libs/algorithm/test/is_permutation_test1.cpp" In file included from ../libs/algorithm/test/is_permutation_test1.cpp:13: ../boost/algorithm/cxx11/is_permutation.hpp:178:6: error: declaration conflicts with target of using declaration already in scope bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ^ /usr/include/c++/v1/algorithm:1374:1: note: target of using declaration is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, ^ ../boost/algorithm/cxx11/is_permutation.hpp:104:12: note: using declaration using std::is_permutation; // Section 25.2.12 ^ ../boost/algorithm/cxx11/is_permutation.hpp:205:6: error: declaration conflicts with target of using declaration already in scope bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ^ /usr/include/c++/v1/algorithm:1361:1: note: target of using declaration is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, ^ ../boost/algorithm/cxx11/is_permutation.hpp:104:12: note: using declaration using std::is_permutation; // Section 25.2.12 ^ 2 errors generated. I haven't looked in detail, but it looks like those two overloads were added in C++14 and need guarding with a suitable #if __cplusplus >= C++1Y_version_here Ben

3 5

[GSoC 14] Request community to rank proposals
by Niall Douglas 24 Mar '14

24 Mar '14

Dear Boost Community, The Google Summer of Code 2014 proposals for Boost are in, and we would deeply appreciate the community's help in ranking the proposals according to merit before the 1st of April. To vote, the process is easy: 1. Go to this page https://www.google-melange.com/gsoc/homepage/google/gsoc2014 and click the "Log in" button under Mentors and Administrators. 2. Now click "Create Profile" on the same page. Note that even if you registered last year, you must register again in 2014. Fill in the form. Note that after submitting it drops you at "Edit Profile", which is confusing. 3. Click "My Dashboard", then "Connect with organisations". 4. Choose "Boost C++ Libraries". 5. In the message box, write this: "I am a member of the Boost community and the email(s) I normally post to boost mailing lists with is <email>" filling in the email address(es) you normally use to post to boost mailing lists. This lets us verify that you are indeed a long standing member of the Boost community. 6. Once we approve your request, you will get an email with the subject "Welcome as organisation member". You can now return to the Dashboard on the GSoC website where there will be a new item "Proposals". 7. Work your way through as many of the 42 proposals as you can. You can score them using the stars at the bottom of each proposal page, taking care to read any comments by the mentors and students if present. PLEASE try to rank some of the lowest scored proposals, every year we get a lot of people who only rank the top five and don't bother with the rest. Try to score on the basis of (i) proposal quality and your best estimate of the student's capability (ii) if the student came early to the mailing lists to ask for help writing the proposal (the mentors who helped them with their proposals have usually indicated this in the private comments) (iii) usefulness/appropriateness of the feature or work being proposed. Remember a good GSoC is more about getting promising new engineers into Boost and C++ than necessarily getting code to pass Boost peer review in a single summer. 8. Optional: If a proposal looks especially great to you and you feel able to mentor a student this year, please slide the "wish to mentor" button. Just because a proposal already has willing mentors does NOT mean you should not add yourself - we have at least two mentors with many attached very highly ranked proposals and we really don't want to have to reject an outstanding proposal just because we can't find the mentors for it as no mentor can realistically mentor more than two projects simultaneously. As you know, Google Summer of Code is usually worth $35,000 - $50,000 to Boost each year, and a successful GSoC raises our visibility and reputation in the wider open source community. Our thanks to you in advance for taking the time to vote. Niall Douglas Boris Schäling --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

1 0

[build][testing] Auto-generated tests not present in reports
by Andrey Semashev 24 Mar '14

24 Mar '14

Hi, Recently I added auto-generation of compile tests which basically check that every Boost.Log public header is self-contained (i.e. can be included on its own, does not have any missing includes etc.) This is done in the test/Jamfile.v2 as follows: rule test_all { local all_rules = ; local file ; local headers_path = [ path.make $(BOOST_ROOT)/libs/log/include/boost/log ] ; for file in [ path.glob-tree $(headers_path) : *.hpp ] { local rel_file = [ path.relative-to $(headers_path) $(file) ] ; if ! [ MATCH "detail/(.*)" : $(rel_file) ] { #ECHO $(rel_file) ; all_rules += [ compile compile/self_contained_header.cpp : <define>"BOOST_LOG_TEST_HEADER=$(rel_file)" : self_contained_header/$(rel_file) ] ; } } ... other test targets are also generated here return $(all_rules) ; } This rule also generates targets for other tests, including compile tests. It works locally, I can see the generated tests for all headers being compiled. However, I made this change quite some time ago but still I don't see these tests in the test reports table. I can see other tests which are generated by the same test_all rule, so it works. What could be the problem? Any ideas? Thanks.

2 3

[Boost][Range] Non-mutating algorithm on non const qualified range
by Albert Yiamakis 24 Mar '14

24 Mar '14

Hello, In the users mailing list I have remarked that this piece of code: https://gist.github.com/Kojirion/9714131 will fail to compile, without providing 'mutable' iterators. I have since found out it will also compile by simply const qualifying the dummy object. (ie const Dummy dummy;) The reason is that without it this: is_const<Dummy> gets evaluated to false, resulting in boost::mpl::eval_if_c<false, boost::range_const_iterator<Dummy>, boost::range_mutable_iterator<Dummy> > Surely this is not intended behavior and it should be possible to use a range that has only const iterators in a non-mutating algorithm without const qualifying it? Albert

2 1

[GSoC 2014] Boost.Binaries Proposal (was " Boost.Binaries")
by Antony Polukhin 23 Mar '14

23 Mar '14

2014-03-21 16:31 GMT+04:00 Flavius Condrea <flavius.condrea(a)gmail.com>: > Hi everyone, > > I am very excited to have the opportunity to contribute to Boost C++ > Libraries. This is my proposal for GSoC 2014: > > https://docs.google.com/file/d/0B93eH9bi8ER0UHQtdDdFNFNoRGc/edit > I'd like to mention that Flavius Condrea has successfully done the test task for that that project and has shown a good knowledge of a problem domain. I've already recommended to make optional the "implement specific encrypt/decrypt algo" part of proposal, put more efforts into work with binaries and thinking of additional functionality. I have enough free time to mentor student during this GSOC. I wish to mentor this project if there'll be no objections. Any ideas,comments and additions to proposal are welcomed. -- Best regards, Antony Polukhin

3 2

[config] std::regex unusable on gcc?
by Andrey Semashev 23 Mar '14

23 Mar '14

Hi, I'm trying to use std::regex and it's failing with even the simplest patterns: #include <regex> int main(int, char* argv[]) { std::regex rex("\\d"); return std::regex_match("1", rex); } g++ -std=c++11 rex_test.cpp -o rex_test ./rex_test terminate called after throwing an instance of 'std::regex_error' what(): regex_error Aborted (core dumped) GCC version: gcc version 4.8.1 (Ubuntu/Linaro 4.8.1-10ubuntu9). GCC 4.7.3 exhibits the same behavior. Replacing "\\d" pattern with "[0-9]" results in the same failure. It works with Boost.Regex, Boost.Xpressive and with clang 3.4 & libc++. Am I doing something wrong? If my use of std::regex is correct then for me this basically means that std::regex is unusable. In this case, could we define BOOST_NO_CXX11_HDR_REGEX in Boost.Config for all versions of libstdc++?

3 3

[algorithm] How to contribute?
by Maciej Poleski 23 Mar '14

23 Mar '14

Hello I want to spend some time working on Boost. I saw this: https://svn.boost.org/trac/boost/wiki/SoC2014#Algorithms. I have some "algorithms and data structures" knowledge and I think about implementing something that would be valuable to Boost users and give me opportunity to dig a bit into Boost. I think about something simple to start with (like Radix sort). If everything go ok, I will try something more complex (parallel algorithms?). Let me know if this piece of work would make sense. Feel free to give another propositions if something different is more important. Maciej Poleski

2 1

[GSoC 2014] Boost.Fixed-Point Proposal
by Nikhar Agrawal 22 Mar '14

22 Mar '14

Hello everyone, Kindly find my proposal for Boost.Fixed-Point on the following link. http://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014/… I have been in touch with the potential mentors of this project for quite some time now. The proposal is a result of my discussions with them. Do let me know what you think of it. Any feedback would be invaluable. If there are any visibility issues, kindly let me know. Thank you. Nikhar

6 10

Boost.Binaries
by Flavius Condrea 21 Mar '14

21 Mar '14

Hi everyone, I am very excited to have the opportunity to contribute to Boost C++ Libraries. This is my proposal for GSoC 2014: https://docs.google.com/file/d/0B93eH9bi8ER0UHQtdDdFNFNoRGc/edit Best regards, Flavius Condrea

1 0

Teeks GCC test failures - multiprecision, spirit and others
by John Maddock 21 Mar '14

21 Mar '14

There are a lot of inscrutable failures from the Teeks machines running GCC on linux that I'm unable to reproduce (and aren't reproduced by other testers), for example: http://www.boost.org/development/tests/develop/developer/output/teeks99-03d… All the failures refer to is_convertible, and have an instantiation back trace that leads nowhere (a line that doesn't instantiate anything, and which refers to Boost.Range which multiprecision doesn't use). I see similar failures in the spirit tests as well. Is anyone able to reproduce these? Any ideas what may be going on? The failures are on the master branch as well if that helps. Many thanks, John.

5 5

[mpl] Merging 'develop' to 'master'
by Edward Diener 21 Mar '14

21 Mar '14

I would like to merge the mpl 'develop' changes to mpl 'master'. The develop changes have cycled long enough IMO for the merge to take place, without any problems showing up in the changes. There are two changes of my own and a number of Stephen Kelly eliminating support for very old compiler versions. The changes will clean up many obsolete workarounds for older versions of compilers that no one doing template metaprogramming should seriously use anymore. My own two changes fix some minor problems I ran into when testing clang with VC++ RTL on Windows. The changes make the MPL easier to understand. If there are no objections to the merge I will be glad to carefully do it myself, or Dave Abrahams/Alex Gurtovoy or others who have write access to MPL can do it. But I think it is important to get these changes into 'master', and tested in the 'master' regression tests, before the next Boost release.

3 6

Re: [boost] Boost.Binaries Project
by Antony Polukhin 21 Mar '14

21 Mar '14

Good! Now look, you need to write an officail proposal. here's a template: https://svn.boost.org/trac/boost/wiki/SoCSubmissionTemplate Send it to the boost(a)lists.boost.org. After that I'll tell the list that you have the qualification, finished test task and I'm willing to mentor you. Get hurry! March 21 is a deadline for student application. A few thoughts about the Binary project: Signing/shifrating a whole section is good idea, I like it. The very initial idea was to allow user specify code block or variable location to shifrate/checksum. That's what for the task with PUT_HELLO_THERE_IN_BINARY was meant for. Inserting markers into binary we'll be able to find code blocks later (find(binary, "Hello there!")). As you've mentioned compiler eliminates dead code, however there is a way to bypass it: if we put the jmp instruction directly in assembly block, compiler will not eliminate it (at least 3 years ago it was not eliminating). Binary library must consist of two parts: postprocessing: tools to find markers, modify marked variables, change sections and entry point... core: markers for code, markers for variables, functions to do something at code block enter/leave. 2014-03-20 20:43 GMT+04:00 Flavius Condrea <flavius.condrea(a)gmail.com>: > Hi Antony, > > > I solved the task you gave me. I attached the source code where you will > find a comment, too. > > I worked last summer at Bitdefender as a full-time Malware Researcher. I > studied a lot of reverse engineering, Windows API and basic Python. While > working there, I made researches on several malwares, developing detection > and cleaning algorithms. > > Also, using Pin library, developed by Intel, I created a C++ > information-revealing application when running a binary file, such as: > > - For each call it obtains information about the instruction > call address , the procedure address, the procedure parameters including > the parameters values. > > - It shows if the function writes in memory and in case it does > the application obtains these information from memory > > - It reveals if a new process or thread is created > > Then I developed a plugin (written in Python) for IDA Disassembler > Application. The plugin inserts strategically-placed comments with the > information mentioned in above. This way, it can be done an easier > binary-file analysis. I attached a few print screens for seeing clearly > what actually my tool does. > > In the same time, if a binary file has encrypted code (most of the > malwares have this), the developed application dumps the image from memory > (in the memory the code is decrypted) and restore the PE Header and > imported functions for an easier IDA analysis of the malware. > > > Best regards, > > Flavius Condrea > > > PS: About this task: should I include it in the application form? > > > 2014-03-20 9:13 GMT+02:00 Antony Polukhin <antoshkka(a)gmail.com>: > > 2014-03-19 21:17 GMT+04:00 Flavius Condrea <flavius.condrea(a)gmail.com>: >> >>> Hi Antony, >>> >> >> Hi and welcome! >> >> >>> I was thinking to apply for Boost.Binaries project. Therefore lately >>> I made researches about what does this involve. I thought of a way to >>> encrypt an executable file and decrypt itself at runtime. I have the >>> following solution for this: >>> >>> 1. Create an encryption key and a decryption key (public or >>> private) >>> >>> 2. Iterate each section and see if it contains executable code and >>> then encrypt that section with the key from point one. >>> >>> 3. Create a new section that will contain the Original Entry >>> Point(OEP) and decryption algorithm that will be executed at runtime. The >>> decryption algorithm will contain (at the end) a jmp to the Original Entry >>> Point. The decryption key will be delivered separately. >>> >>> 4. Change the executable header (PE Header) so that makes it valid >>> after the effectuated changes (this involves modifying the entry point to >>> point to the decryption algorithm and other things) >>> >> Sounds pretty good. Looks like you've done some investigations and know >> what you are talking about. >> >> >> >>> Besides these things I am willing to add other features according to >>> your wishes. >>> >>> I am waiting for your opinion. >>> >> >> You've got a good start, but there is a requirement in community to give >> some small tasks for the student. >> If you are willing to start Boost.Binary project, then you need to make >> a main.cpp file, that contains the following >> >> #include <iostream> >> >> int main() { >> std::cout << "Hello "; >> goto foo; >> PUT_HELLO_THERE_IN_BINARY >> foo: >> std::cout << "World"; >> } >> >> There you must define PUT_HELLO_THERE_IN_BINARY macro to some code, that >> will put the "Hello there!" string between two calls to operator << in >> binary file. In disassembly there must be something like this: >> >> ... >> call basic_ostream::operator<< >> jmp foo >> 48 65 6c 6c 6f 20 74 68 65 72 65 21 ; 'Hello there!' in raw view >> foo: >> ... >> call basic_ostream::operator<< >> >> If you'll make your solution portable between MSVC and GCC compilers - >> you're almost certanly in :) >> >> >> -- >> Best regards, >> Antony Polukhin >> > > -- Best regards, Antony Polukhin

1 0

[git] Jamfile in repository
by Karsten Ahnert 20 Mar '14

20 Mar '14

Hi, can we put a Jamfile and/or a Jamroot in git repository of a boost library? We develop odeint in a separate github repository and we have a Jamroot there to build the library without the boost super-project. To merge our changes into the official boost odeint repository we want to pull from the development repository. I am a bit afraid that this Jamfile/Jamroot might disturb the build process of boost.

2 1

[Range] Are pull request in github being considered?
by Gonzalo BG 20 Mar '14

20 Mar '14

There are 3 pull-request in github with zero comments, none closed, and the oldest is 3 months old (one is from me). Are they being considered or should one submit patches for Boost.Range over trac? The FAQ doesn't say anything about the preferred way to submit patches and the modular boost documentation mentions pull-request as valid options, but I would like to be sure that I sent my patch through the preferred channel. Bests, Gonzalo BG

3 3

Standard c++ XML parser API (Boost.XML)
by Saksham Maheshwari 20 Mar '14

20 Mar '14

Hey guys, As part of this year's GSOC, I am interested in developing a Standard c++ XML parser for Boost (Boost.XML project in Ideas Page). What I have encountered till now, there are many libraries which could be used for parsing XML file, but there is no Standard XML API in c++ to do the same, contrary to other languages like Java or python. I think this is an appropriate place to discuss about this API and then develop it. Since a past couple of days, I have been reading and understanding the existing Boost.xml (sandbox project) and Arabica project. What I think now is that there is no need to develop such an API from scratch, it would just be a wastage of our resources, else we could use the existing codes to develop such an API. We can use multiple backends supported in Arabica API and merge it with out existing Boost.XML to make such a standard API, so that it can adapted to a wide range of existing XML libraries. Also, the SAX implementation of Boost.XML has to be changed and it has to be implemented/modified (i.e. reader API), comparing it with Arabica::SAX. DOM API is working very fine. So, according to me, the possible tasks will be 1. To enhance or change the SAX implementation of Boost.XML 2. To provide multiple backends to this API. But for now, I want to know what you guys think about the idea. Thanks, Saksham Maheshwari PS: I want to develop an API, not a library :-)

5 10

GSoC14: Projects currently needing potential mentors
by Niall Douglas 20 Mar '14

20 Mar '14

Dear Boost, The following GSoC 14 project proposals are currently lacking potential mentors. If you'd like to mentor one of these proposals, please go to https://www.google-melange.com/gsoc/homepage/google/gsoc2014, register as a mentor using the bottom link and ask the Boost C++ org for a role. 1. Suffix array Data Structure by Prabhat Kumar 2. Path Planner Library by Pritam Khan 3. Boost.Fixed-Point by Nikhar Agrawal Thanks, Niall --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

2 2

Boost.Odeint Proposal GSoC 2014
by Animesh Gaitonde 20 Mar '14

20 Mar '14

Hi everyone, I have added my proposal on melange.Kindly have a look at it.I will be glad to receive a feedback regarding my proposal Here is a link to my proposal :-https://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014/animesh371/5629499534213120 Let me know if there are any visibility issues. Regards & Thanks Animesh Gaitonde 4th year Undergraduate Bits-Pilani Goa Campus

1 0

[admin] Communicating with other write access contributors to a library
by Edward Diener 19 Mar '14

19 Mar '14

What is the proper way to communicate with other contributors of a library with write access under modular-boost in GitHub ? Is there a list of all write access members for a particular Boost library ?

2 2

[Parallel Algorithms] Queries regarding the Boost.Thread / Parallel algorithms
by NAVEEN NAMASHIVAYAM 19 Mar '14

19 Mar '14

Hi, I am interested in the implementation of parallel algorithms. From given documentation in http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2012/n3429.pdf I could understand the basic crux of the project. But the part which I was not able to figure from the documentation are these; 1. The type of network layer or the communication layer to be used. Can we make use of GASNet or ARMCI as the communication layer and build of ideas on it? Or do we have any specific library to work on this? 2. And the implementation of parallel_for and parallel_for_each, are we trying to mimic the available functionality from the parallel programming models like OpenMP? How far are these functions different from them. 3. Should we analyze about compiler optimizations. Because once these external parallel libraries are called; this necessarily means all the compiler optimizations within this parallel region should be excluded or else the complexity of the parallel library would be increased. Please confirm whether, my understanding is correct or am i looking at the project in a completely unrelated way. Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

2 1

Boost.BLAS
by Ashrith H Chinivar 19 Mar '14

19 Mar '14

Hey, This is Ashrith and I have a few queries related to the development of Boost.uBLAS library. I am currently undergoing a course on Linear Algebra and Matrices in my 3rd year of college and I would like to apply this in making kernel subroutines for Basic Linear Algebra under Boost.uBLAS. I hope to contribute by adding matrix multiplication, inversion algorithms and various other operations into the Boost. Please do let me know if I am missing something. I feel I may have over-seen some obvious prerequisites. Thank you, Ashrith

2 1