Displaying 20 results from an estimated 133 matches for "breadth".
Did you mean:
bread
2004 Jan 18
3
xentop, anyone?
...Linux Infrastructure Architect, TerraLuna LLC
stevegt@TerraLuna.Org
http://www.stevegt.com -- http://Infrastructures.Org
-------------------------------------------------------
The SF.Net email is sponsored by EclipseCon 2004
Premiere Conference on Open Tools Development and Integration
See the breadth of Eclipse activity. February 3-5 in Anaheim, CA.
http://www.eclipsecon.org/osdn
_______________________________________________
Xen-devel mailing list
Xen-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/xen-devel
2019 Jul 10
3
Performance tests?
Hey llvm-dev,
What's the best method to test performance of Clang generated executables?
Are the nightly tests in test-suite sufficient?
I'm looking for publicly available tests/suites with a good breadth of
coverage...
Thanks,
Cam
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20190710/f37851b9/attachment.html>
2004 Jan 30
5
Graceful shutdown of a virtual domain
...Linux Infrastructure Architect, TerraLuna LLC
stevegt@TerraLuna.Org
http://www.stevegt.com -- http://Infrastructures.Org
-------------------------------------------------------
The SF.Net email is sponsored by EclipseCon 2004
Premiere Conference on Open Tools Development and Integration
See the breadth of Eclipse activity. February 3-5 in Anaheim, CA.
http://www.eclipsecon.org/osdn
_______________________________________________
Xen-devel mailing list
Xen-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/xen-devel
2011 Oct 11
3
[LLVMdev] ARM Qualification
I think we need to think along two dimensions - Breadth of testing and depth
of testing
1. Breadth: What the best supported ARM ISA versions in LLVM ARM? Say its
armv6 and armv7; We need to
- regression test ARM mode, Thumb-2 and Thumb-1 mode (armv6)
- Performance/code-size test ARM mode, Thumb-2 and Thumb-1 modes
We need to agree on an optimiz...
2010 Nov 03
2
NTLM Authentication against multiple domain comtrollers
...o authenticate users
belonging to the same domain (using NTLM). We have an immediate urgent
requirement to support authentication against multiple Domains which are
using their own Domain controller. There is NO Trust Relation between
these Domain Controllers.
I have searched through length and breadth of all available documents
and discussions, but there doesn't seem to be any solution available.
Please let us know if such a solution exists. I am eager enough to put
in a few changes in the code (if this is what is required), but this
would require a few pointers from this knowledgeable...
2001 Apr 17
4
cannot allocate vector of size 71773 Kb (PR#915)
...wever in my installation: R Version 1.2.2 (2001-02-26)
Installed from the red hat RPM on your site on a Red Hat 7.0 i686
I get the following error when working with large data sets:
> source("/usr/local/genex/rcluster/lib/rcluster/r/hcluster.r");
> breadth.program("uploaded_data.txt", "average", 10)
Read 2 items
Read 8574 items
Error: cannot allocate vector of size 71773 Kb
Execution halted
Is there a way to fix this? This is running as part of the GeneX
installation...
2004 Feb 08
2
xeno-1.2.bk compilation question?
...ke[1]: Leaving directory `/local1/xxen/xeno-1.2.bk/xenolinux-2.4.24/drivers''
make: *** [_dir_drivers] Error 2
---
-------------------------------------------------------
The SF.Net email is sponsored by EclipseCon 2004
Premiere Conference on Open Tools Development and Integration
See the breadth of Eclipse activity. February 3-5 in Anaheim, CA.
http://www.eclipsecon.org/osdn
_______________________________________________
Xen-devel mailing list
Xen-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/xen-devel
2009 Jun 11
0
[LLVMdev] Output to a DLL
"Nicolas Capens" <nicolas at capens.net> writes:
Hello Nicolas.
> I'd like to be able to write JIT-compiled code to a Windows DLL. I have no
> idea where to start though. Does LLVM already offer some support for
> this?
Nope. Don't hold your breadth waiting for it. It is far from trivial to
do.
I don't know your requirements, but mine is to avoid compilation every
time the hosting application starts.
I was thinking on:
1. Compile and spit bitecode from the JIT the first time, load it on
subsequent sessions. Seems doable. Doesn't w...
2009 Dec 04
0
[LLVMdev] hi, Hi, (Preccessors' Number) < MachineBasicBlock's Number < (Successors's Number), Is it really?
...;s Number < (Successors's Number), Is it really?
>
Hi 任坤,
I can't say for sure, though I don't think we make assurances that this is the case. If you want to traverse the CFG, there should be better ways to perform this. What order do you want your traversal to go? Depth-first? Breadth-first? Other?
-bw
2006 Aug 11
1
[LLVMdev] instruction scheduling for stack machines
...jacent positions. On a stack machine, there is no
operand selection and result writeback overhead, so the aim is to avoid stack manipulation; it is thus best to schedule dependant instructions to adjacent positions. The analogue of the simplest scheduling algorithm listed in SelectionDAGISel.cpp - breadth first sequencing - for a stack machine
would probably be depth first sequencing.
Is there a way to configure an existing instruction scheduler to use a policy suitable for a stack machine, or is it best to write target-specific code instead?
TIA,
Yossi
2011 Mar 31
1
[LLVMdev] how to detect if block N is reachable from block M ?
...path in the CFG from block M to
>> block N, but M does not necessarily dominate block N?
>> In other words, if N is reachable from M.
>
> I don't think there's any method built in to LLVM. It's pretty easy
> to write, though.
>
> -Eli
A simple depth-first or breadth-first search is good unless you end up
querying all pairs - each query is O(blocks + edges), and the number
of pairs is O(blocks ^ 2). If you need to answer queries such as "all
blocks reachable from X", especially using several X's in the course
of an analysis, you'll want more...
2017 Oct 27
3
Dominator tree side effect or intentional
Hello,
I was wondering whether or not some behaviour that I am seeing is expected behaviour and that it has been designed like this, or not.
A dominator relation is given by "if A dominates B", then all paths to B go through A.
For example, take the CFG below (which is a directed graph (couldn’t make the arrow heads but ok.):
A
/ \
B C
\ /
D
|
E
We can construct
2011 Oct 11
0
[LLVMdev] ARM Qualification
"Raja Venkateswaran" <rajav at codeaurora.org> writes:
> I think we need to think along two dimensions - Breadth of testing and depth
> of testing
>
> 1. Breadth: What the best supported ARM ISA versions in LLVM ARM? Say its
> armv6 and armv7; We need to
> - regression test ARM mode, Thumb-2 and Thumb-1 mode (armv6)
> - Performance/code-size test ARM mode, Thumb-2 and Thumb-1 modes
>
&...
2006 May 05
3
OT: Require e-mail during sign up process?
Sorry that this thread is a little off topic, but I''m looking for some
varying opinions on the subject and I think this group has a breadth of
experience on this matter :)
A little background info... the registration process for a web application I
am developing will be targeting those ages 13+ with the bulk of the users
being in the 13-25 age range. We are in the process of developing the sign
up/registration and we''re run i...
2004 Sep 07
2
using text on the x axis ticks rather than numbers
...Is this possible?
Thanks,
-------------------------------------------------------------------
Rajarshi Guha <rxg218 at psu.edu> <http://jijo.cjb.net>
GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B87 56EE
-------------------------------------------------------------------
Breadth-first search is the bulldozer of science.
-- Randy Goebel
2004 Sep 07
2
using text on the x axis ticks rather than numbers
...Is this possible?
Thanks,
-------------------------------------------------------------------
Rajarshi Guha <rxg218 at psu.edu> <http://jijo.cjb.net>
GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B87 56EE
-------------------------------------------------------------------
Breadth-first search is the bulldozer of science.
-- Randy Goebel
2009 Jun 11
5
[LLVMdev] Output to a DLL
Hi all,
I'd like to be able to write JIT-compiled code to a Windows DLL. I have no
idea where to start though. Does LLVM already offer some support for this?
Or would it be straightforward to write my own DLL writer (no advanced
features needed)? Or maybe I could use an external linker? All help highly
appreciated!
Cheers,
Nicolas
-------------- next part --------------
An HTML
2009 Dec 04
4
[LLVMdev] hi, Hi, (Preccessors' Number) < MachineBasicBlock's Number < (Successors's Number), Is it really?
Hi, EveryOne:
I am travelling CFG with MachineFunction. So I want to sure it.
(Preccessors' Number) < MachineBasicBlock's Number < (Successors's Number), Is it really?
best regards.
___________________________________________________________
好玩贺卡等你发,邮箱贺卡全新上线!
http://card.mail.cn.yahoo.com/
-------------- next part --------------
An HTML attachment was scrubbed...
2006 Oct 26
3
Measurements of 3000 criminals
Hallo everyone,
excuse me if this is not a genuine R question but I do not know where to
ask else.
Referring to e.g.
https://stat.ethz.ch/pipermail/r-help/2004-December/062114.html
I wonder if these measurements of 3000 criminals (raw data) are
available anywhere. At least I didn't find them in the R datasets
package or by means of Google. What I did find was a table of
frequencies of
2012 Jul 11
1
igraph function "graph.bfs" unavailable
...ome variable names for the purpose of this post, so maybe I broke something):
isolated.subgraph <- function(main.graph, node.name, bfs.dist=2){
# Get vertex id for root node from input graph
node.vid <- V(main.graph)[nodeName==node.name][[1]]
# Traverse graph using breadth-first search
# to distance of 2 from root
node.bfs <- graph.bfs(main.graph, root=node.vid
,callback=function(graph, data, extra){data['dist'] == bfs.dist}
)
# Isolate pe...