search for: gareev

...out.opt.ll’ from 130ms to 67ms and the runtime of 'opt -basicaa -licm out.opt2.ll’ from 117ms to 62ms (out.opt.ll and out.opt2.ll can be found on the following link https://llvm.org/bugs/show_bug.cgi?id=23077). Thank you for the attention! -- Cheers, Roman Gareev. -------------- next part -------------- A non-text attachment was scrubbed... Name: 0001-Mark-unknown-instructions-from-the-AST-parameter.patch Type: application/octet-stream Size: 1813 bytes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20160124/0e29f04e/attach...

...S.UnknownInsts.clear(); > 00064 } > > > > You could insert the current unknown insts into a smallptrset, and then only > append them to UnknownInsts if they aren't in the set. > > This should remove your dupes. > > > > On Sun, Jan 24, 2016 at 5:28 AM, Roman Gareev via llvm-dev > <llvm-dev at lists.llvm.org> wrote: >> >> Dear llvm contributors, >> >> Could you please advise me how to skip >> checks, which are performed in AliasSet::aliasesUnknownInst, of >> unknown instructions from different alias sets of an alias...

...e don't do so in the AliasSetTracker. We're taking advantage here of the fast that AA's getModRefInfo understands (or should understand) enough about memset to accurately answer the queries. Hi Hal, Thank you for the explanation! -- Cheers, Roman Gareev.

...tor register (which probably helps to determine the second parameter) from TargetTransformInfo.h. I would be very grateful for your comments, feedback and ideas. Refs.: [1] - http://www.cs.utexas.edu/users/flame/pubs/TOMS-BLIS-Analytical.pdf -- Cheers, Roman Gareev.

...MemoryLocation class that are created for ‘llvm.memset.*‘ intrinsics. If I’m not mistaken, objects of MemoryLocation class are involved in alias analysis and, in particular, in work of findAliasSetForUnknownInst. Thank you for the attention! -- Cheers, Roman Gareev.

...instructions per clock cycle. 4. Latency of instructions (i.e., the minimum number of cycles between the issuance of two dependent consecutive instructions). 5. Paramaters of cache levels (size of cache lines, associativity degrees, sizes). -- Cheers, Roman Gareev.

...are probably related to this: [1] and [2]. However, maybe I missed something. Refs.: [1] - http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.29.5704&rep=rep1&type=pdf [2] - https://hal.archives-ouvertes.fr/hal-01257316/document -- Cheers, Roman Gareev.

On 01/27/2016 07:53 AM, Daniel Berlin wrote: > > > On Wed, Jan 27, 2016 at 1:27 AM, Roman Gareev <gareevroman at gmail.com > <mailto:gareevroman at gmail.com>> wrote: > > Thank you for the idea! Could you please explain it? > > > Which part are you having trouble with, so i know where to concetrate? > > If I’m not > mistaken, you advise to in...

Sorry for not responding earlier. On 05/20/2016 03:05 PM, Roman Gareev wrote: > Thank you very much for the advices! I could probably try to avoid > using of nonhardware prefetching in the project, if Tobias doesn’t > disagree with it. My understanding is that prefetching isn’t used > explicitly in [1] and, according to [2], in some cases 90% of the > t...

On 05/17/2016 01:47 PM, Michael Kruse wrote: > 2016-05-16 19:52 GMT+02:00 Roman Gareev <gareevroman at gmail.com>: >> Hi Tobias, >> >> could we use information about memory accesses of a SCoP statement and >> def-use chains to determine statements, which don’t contain matrix >> multiplication of the following form? > > Assuming s/don't/d...

On 06/28/2016 10:53 AM, Roman Gareev wrote: > 2016-06-27 15:52 GMT+05:00 4lbert C0hen <4lbert.h.c0hen at gmail.com>: >> Dear Roman and all, >> >> Such features would be extremely useful to implement array expansion (scalar >> and array renaming, privatization with new subscript expressions of higher &g...

...l, if I'm not mistaken, an ability to change memory access functions to change the arrays a memory access is referencing can be useful for your DE-LICM work. I would be very grateful, if you or someone else could share ideas and patches which can be used as a starting point. -- Thanks, Roman Gareev

Hi Roman, On Tue, May 31, 2016 at 9:57 AM, Roman Gareev <gareevroman at gmail.com> wrote: > Hi Tobias, > > I think that we could split a patch that contains an implementation of > tiling, interchanging and unrolling of specific loops into three > separate patches: > > 1. The first one adds a class that describes a processor m...

...d can be safely optimized with a generation of specific code, which takes into account information about usage of SIMD registers. I have one more question. Are memory accesses of MemAccs from the ScopStmt class ordered by their sequence order? -- Cheers, Roman Gareev.

...ementation. Refs: [1] - http://www.cs.utexas.edu/users/flame/pubs/TOMS-BLIS-Analytical.pdf [2] - http://wiki.cs.utexas.edu/rvdg/HowToOptimizeGemm [3] - https://github.com/flame/blis/blob/master/kernels/x86_64/sandybridge/3/bli_gemm_int_d8x4.c -- Cheers, Roman Gareev. -------------- next part -------------- A non-text attachment was scrubbed... Name: gemm_C_SIMD.c Type: text/x-csrc Size: 5697 bytes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20160520/16edb8dc/attachment.c>

...://github.com/flame/blis/tree/master/kernels/x86_64/sandybridge/3 [4] - https://github.com/flame/blis/blob/master/kernels/x86_64/sandybridge/3/bli_gemm_int_d8x4.c [5] - https://github.com/flame/blis/blob/master/frame/3/gemm/bli_gemm_blk_var3f.c -- Cheers, Roman Gareev. -------------- next part -------------- A non-text attachment was scrubbed... Name: gemm_SIMD.c Type: text/x-csrc Size: 5715 bytes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20160502/ae26ee5e/attachment.c>

>>>> Maybe it could be a temporary solution. I think that if the checks are >>>> successfully passed and the basic block of the statement has exactly >>>> 14 instructions, the statement contains matrix multiplication and can >>>> be safely optimized with a generation of specific code, which takes >>>> into account information about usage

...chael Kruse, Matthias Reisinger,Maximilian Falkenstein, Nakamura Takumi, Nandini Singhal, NicolasBonfante, Patrik Hägglund, Paul Robinson, Philip Pfaffe, Philipp Schaad,Peter Conn, Pratik Bhatu, Rafael Espindola, Raghesh Aloor, ReidKleckner, Roal Jordans, Richard Membarth, Roman Gareev, SaleemAbdulrasool, Sameer Sahasrabuddhe, Sanjoy Das, Sameer AbuAsal, SamNovak, Sebastian Pop, Siddharth Bhat, Singapuram Sanjay Srivallabh,Sumanth Gundapaneni, Sunil Srivastava, Sylvestre Ledru, Star Tan, TanyaLattner, Tim Shen, Tarun Ranjendran, Theodoros Theodoridis, Utp...

...s this bot (afaiu). Best, Tobias ---------- Forwarded message ---------- From: ** <llvm.greendragon at gmail.com <mailto:llvm.greendragon at gmail.com>> Date: 2016-01-13 0:00 GMT+05:00 Subject: Clang Stage 1: cmake, RA, using system compiler (Check) - Build # 9557 - Failure! To: Roman Gareev <gareevroman at gmail.com <mailto:gareevroman at gmail.com>>, Simon Atanasyan <simon at atanasyan.com <mailto:simon at atanasyan.com>>, Teresa Johnson <tejohnson at google.com <mailto:tejohnson at google.com>>, Sanjay Patel <spatel at rotateright.com <mailt...

All, What would be the most efficient way to load the data at the following address into a dataframe? http://ratings.fide.com/top.phtml?list=men Thanks, David -- View this message in context: http://r.789695.n4.nabble.com/Loading-Chess-Data-tp4642006.html Sent from the R help mailing list archive at Nabble.com.