Displaying 7 results from an estimated 7 matches for "20n".
Did you mean:
20
2016 Aug 26
10
[RFC] Interprocedural MIR-level outlining pass
...evel, but
may be for an IR level extension of the algorithm.
================================
Challenges
================================
1) MEMORY CONSUMPTION
Given a string of length n, a naive suffix tree implementation can take up
to 40n bytes of memory. However, this number can be reduced to 20n with a
bit of work [2]. Currently, the suffix tree stores the entire program,
including instructions which really ought not to be outlined, such as
returns. These instructions should not be included in the final
implementation, but should rather act as terminators for the strings. This
will likely...
2016 Aug 26
2
[RFC] Interprocedural MIR-level outlining pass
...t; ================================
> > Challenges
> > ================================
> > 1) MEMORY CONSUMPTION
> > Given a string of length n, a naive suffix tree implementation can
> > take up
> > to 40n bytes of memory. However, this number can be reduced to 20n
> > with a
> > bit of work [2]. Currently, the suffix tree stores the entire
> > program,
> > including instructions which really ought not to be outlined, such as
> > returns. These instructions should not be included in the final
> > implementation, but should...
2016 Aug 26
2
[RFC] Interprocedural MIR-level outlining pass
...t; ================================
> > Challenges
> > ================================
> > 1) MEMORY CONSUMPTION
> > Given a string of length n, a naive suffix tree implementation can
> > take up
> > to 40n bytes of memory. However, this number can be reduced to 20n
> > with a
> > bit of work [2]. Currently, the suffix tree stores the entire
> > program,
> > including instructions which really ought not to be outlined, such as
> > returns. These instructions should not be included in the final
> > implementation, but should...
2016 Aug 27
3
[RFC] Interprocedural MIR-level outlining pass
...> > > >
> > >
> >
>
> > > > > > take up
> > > >
> > >
> >
>
> > > > > > to 40n bytes of memory. However, this number can be reduced
> > > > > > to
> > > > > > 20n
> > > >
> > >
> >
>
> > > > > > with a
> > > >
> > >
> >
>
> > > > > > bit of work [2]. Currently, the suffix tree stores the
> > > > > > entire
> > > >
> > &...
2016 Aug 29
2
[RFC] Interprocedural MIR-level outlining pass
...;>>> > ================================
>>>> > 1) MEMORY CONSUMPTION
>>>> > Given a string of length n, a naive suffix tree implementation can
>>>> > take up
>>>> > to 40n bytes of memory. However, this number can be reduced to 20n
>>>> > with a
>>>> > bit of work [2]. Currently, the suffix tree stores the entire
>>>> > program,
>>>> > including instructions which really ought not to be outlined, such as
>>>> > returns. These instructions should not be...
2016 Aug 30
2
[RFC] Interprocedural MIR-level outlining pass
...===================
>>>>>> > 1) MEMORY CONSUMPTION
>>>>>> > Given a string of length n, a naive suffix tree implementation can
>>>>>> > take up
>>>>>> > to 40n bytes of memory. However, this number can be reduced to 20n
>>>>>> > with a
>>>>>> > bit of work [2]. Currently, the suffix tree stores the entire
>>>>>> > program,
>>>>>> > including instructions which really ought not to be outlined, such
>>>>>> as
>&g...
2008 Jun 30
4
Rebuild of kernel 2.6.9-67.0.20.EL failure
Hello list.
I'm trying to rebuild the 2.6.9.67.0.20.EL kernel, but it fails even without
modifications.
How did I try it?
Created a (non-root) build environment (not a mock )
Installed the kernel.scr.rpm and did a
rpmbuild -ba --target=`uname -m` kernel-2.6.spec 2> prep-err.log | tee
prep-out.log
The build failed at the end:
Processing files: kernel-xenU-devel-2.6.9-67.0.20.EL
Checking