Search Results

Search found 235 results on 10 pages for 'l2'.

Page 1/10 | 1 2 3 4 5 6 7 8 9 10  | Next Page >

• L2 cache memory

  - by paragjain16

  What's the difference between 2*512 KB L2 cache and 1 MB L2 cache?

  Read the article

• Programmatically measure size and way-order of L1 and L2 caches

  - by osgx

  How can I measure programmatically (not query the OS, but measure) the size and order of associativity of L1 and L2 caches (data caches)? Assumptions about system: It has L1 and L2 cache (may be L3 too, may be cache sharing), It may have a hardware prefetch unit (just like P4+), It has a stable clocksource (tickcounter or good HPET for…

  Read the article

• Shark L2 cache profiling won't take samples

  I'm trying to use Shark to check for L2 cache misses, but it won't work. All of the other Shark sampling modes work fine.

  Read the article

• Programicaly measure size and way-order of L1 and L2 caches

  - by osgx

  Hello How can I measure programicaly (not query the OS, but measure) the size and order of associativity of L1 and L2 caches (data caches)? Assumtions about system: It has L1 and L2 cache (may be L3 too, may be cache sharing), It may have a hardware prefetch unit (just like P4+), it has a stable clocksource (tickcounter or good HPET for…

  Read the article

• NHibernate L2 Cache - fluent nHibernate configuration

  - by AWC

  I've managed to configure the L2 cache for Get\Load in FHN, but it's not working for queries configured using the ICriteria interface - it doesn't cache the results from these queries. Does anyone know why? The configurations are as follows: ICriteria: return unitOfWork .CurrentSession .CreateCriteria(typeof(Country))…

  Read the article

• Why there is no scoped locks for multiple mutexes in C++0x or Boost.Thread?

  - by Vicente Botet Escriba

  C++0x thread library or Boost.thread define non-member variadic template function that lock all lock avoiding dead lock. template <class L1, class L2, class... L3> void lock(L1&, L2&, L3&...); While this function avoid help to deadlock, the standard do not includes the associated scoped lock to write exception safe…

  Read the article

• Switch case assembly level code

  - by puffadder

  Hi All, I am programming C on cygwin windows. After having done a bit of C programming and getting comfortable with the language, I wanted to look under the hood and see what the compiler is doing for the code that I write. So I wrote down a code block containing switch case statements and converted them into assembly using: gcc…

  Read the article

• tc u32 --- how to match L2 protocols in recent kernels?

  - by brownian

  I have a nice shaper, with hashed filtering, built at a linux bridge. In short, br0 connects external and internal physical interfaces, VLAN tagged packets are bridged "transparently" (I mean, no VLAN interfaces are there). Now, different kernels do it differently. I can be wrong with exact kernel verions ranges, please forgive me.…

  Read the article

• Using recursion an append in prolog

  - by Adrian

  Lets say that I would like to construct a list (L2) by appending elements of another list (L) one by one. The result should be exactly the same as the input. This task is silly, but it'll help me understand how to recurse through a list and remove certain elements. I have put together the following code: create(L, L2) :- (\+ (L ==…

  Read the article

• substitute in a nested list (prolog)

  - by linda

  /* substitute(X,Y,Xs,Ys) is true if the list Ys is the result of substituting Y for all occurrences of X in the list Xs. This is what I have so far: subs(_,_,[],[]). subs(X,Y,[X|L1],[Y|L2]):- subs(X,Y,L1,L2). subs(X,Y,[H|L1],[H|L2]):- X\=H, not(H=[_|_]), subs(X,Y,L1,L2). subs(X,Y,[H|_],[L2]):- X\=H, H=[_|_], subs(X,Y,H,L2). My…

  Read the article

• Using recustion an append in prolog

  - by Adrian

  Lets say that I would like to construct a list (L2) by appending elements of another list (L) one by one. The result should be exactly the same as the input. This task is silly, but it'll help me understand how to recurse through a list and remove certain elements. I have put together the following code: create(L, L2) :- (\+ (L…

  Read the article

• Comparing lists in Standard ML

  - by user1050640

  I am extremely new to SML and we just got out first programming assignment for class and I need a little insight. The question is: write an ML function, called minus: int list * int list -> int list, that takes two non-decreasing integer lists and produces a non-decreasing integer list obtained by removing the elements from…

  Read the article

• [C++] My First Go With Function Templates

  - by bobber205

  Thought it was pretty straight forward. But I get a "iterator not dereferencable" errro when running the below code. What's wrong? template<typename T> struct SumsTo : public std::binary_function<T, T, bool> { int myInt; SumsTo(int a) { myInt = a; } bool operator()(const T& l, const…

  Read the article

• Finding 'free' times in MySQL

  - by James Inman

  Hi, I've got a table as follows: mysql> DESCRIBE student_lectures; +------------------+----------+------+-----+---------+----------------+ | Field | Type | Null | Key | Default | Extra | +------------------+----------+------+-----+---------+----------------+ | id | int(11) | NO | PRI…

  Read the article

• segmentation fault when using pointer to pointer

  - by user3697730

  I had been trying to use a pointer to pointer in a function,but is seems that I am not doing the memory allocation correctly... My code is: #include<stdio.h> #include<math.h> #include<ctype.h> #include<stdlib.h> #include<string.h> struct list{ int data; struct list *next; };…

  Read the article

• Java JPanel not showing up....

  - by user69514

  I'm not sure what I am doing wrong, but the text for my JPanels is not showing up. I just get the question number text, but the question is not showing up. Any ideas what I am doing wrong? import java.awt.*; import java.awt.event.*; import javax.swing.*; import javax.swing.event.*; class NewFrame extends JFrame { JPanel…

  Read the article

• TcpListener problem - re-binding to same port with different local addresses

  - by Zvika

  I'm trying to do the following: listen on some port for loopback connections only, and then start listening on any IP address. Here is the code: TcpListener l1 = new TcpListener(new IPEndPoint(IPAddress.Loopback, 12345)); l1.Start(); Socket s = l1.AcceptSocket(); Console.ReadKey(); //s.Close(); l1.Stop(); TcpListener l2 =…

  Read the article

• Generate Permutations of a List

  - by Eric Mercer

  I'm writing a function that takes a list and returns a list of permutations of the argument. I know how to do it by using a function that removes an element and then recursively use that function to generate all permutations. I now have a problem where I want to use the following function: (define (insert-everywhere…

  Read the article

• list within a list

  - by atm atm

  I'm working on this problem, but I cannot figure out the second part. I tried using reverse list but it did not work out how I planned it. Given a list L (e.g. [1,2,3,4]), write a program that generates the following nested lists: L1 = [[1],[1,2],[1,2,3],[1,2,3,4]], L2 = [[4],[3,4],[2,3,4],[1,2,3,4]]. …

  Read the article

• T4 Performance Counters explained

  - by user13346607

  Now that T4 is out for a few month some people might have wondered what details of the new pipeline you can monitor. A "cpustat -h" lists a lot of events that can be monitored, and only very few are self-explanatory. I will try to give some insight on all of them, some of these "PIC events" require an in-depth…

  Read the article

• how to copy one linked list contents to another linked list

  - by Zeeshan Raja

  Hi, I have been given list L1, L2. L1 contains 1,2,3 and L2 contains 4,5,6. how do i copy the contents from L2 to the end of L1 so in the end L1 contains 1,2,3,4,5,6. any suggestions?

  Read the article

• Tail-recursive merge sort in OCaml

  - by CFP

  Hello world! I’m trying to implement a tail-recursive list-sorting function in OCaml, and I’ve come up with the following code: let tailrec_merge_sort l = let split l = let rec _split source left right = match source with | [] -> (left, right) | head :: tail -> _split tail right…

  Read the article

• custom C++ boost::lambda expression help

  - by aaa

  hello. A little bit of background: I have some strange multiple nested loops which I converted to flat work queue (basically collapse single index loops to single multi-index loop). right now each loop is hand coded. I am trying to generalized approach to work with any bounds using lambda expressions: For…

  Read the article

• Java assert nasty side-effect - compiler bug?

  - by Alex

  This public class test { public static void main(String[] args) { Object o = null; assert o != null; if(o != null) System.out.println("o != null"); } } prints out "o != null"; both 1.5_22 and 1.6_18. Compiler bug? Commenting out the assert fixes it. The byte…

  Read the article

• Problem with Closure properties of context free languages

  - by altius

  hello i have the following sentence a language L1={a^n * b^n : n=0} and L2={b^n * a^n : n=0} are context free languages so they are close a=under the L1L2 so L={a^n * b^2n A^n : n=0} must be context free too because it is generated by a close property I have to prove if this sentence is true or not so i…

  Read the article

1 2 3 4 5 6 7 8 9 10  | Next Page >