Dynamic Memory and Data Deduplication

Hi,
I'm currently testing W2K12 Deduplication feature on some servers, and I was wondering if I could enable "Dynamic Memory" on the VM in Hyper-V? Because the job only uses percentage of memory for the dedup job, I guess it's not possible.
Thanks in advance!

I know it old thread, but I ran into this and could not find anything on it but here, so I am adding my experience.
I can concur with 3magroup...
In my environment Windows Server 2012 with Dynamic Memory and Deduplication enabled, the HyperV does not release the driver locked ram for the dedup optimization. What resulted was an insane amount of paging and a painfully slow VM. Increasing the memory
buffer for the dynamic memory did not cause the HyperV to release the memory for the dedup. Instead, it still "driver locked" nearly all of the ram, which did not make sense to me based on my understanding of the Memory Buffer setting.
I can verify the VM poor performance and dedup using the paging file with the Resource Monitor, disk section, and the Driver locked RAM with RamMap.

Similar Messages

How can we get Dynamic columns and data with RTF Templates in BI Publisher

How can we get Dynamic columns and data with RTf Templates.
My requirement is :
create table xxinv_item_pei_taginfo(item_id number,
Organization_id number,
item varchar2(4000),
record_type varchar2(4000),
record_value CLOB,
State varchar2(4000));
insert into xxinv_item_pei_taginfo values( 493991 ,224, '1265-D30', 'USES','fever','TX');
insert into xxinv_item_pei_taginfo values( 493991 ,224, '1265-D30', 'HOW TO USE','one tablet daily','TX');
insert into xxinv_item_pei_taginfo values( 493991 ,224, '1265-D30', 'SIDE EFFECTS','XYZ','TX');
insert into xxinv_item_pei_taginfo values( 493991 ,224, '1265-D30', 'DRUG INTERACTION','ABC','TX');
insert into xxinv_item_pei_taginfo values( 493991 ,224, '1265-D30', 'OVERDOSE','Go and see doctor','TX');
insert into xxinv_item_pei_taginfo values( 493991 ,224, '1265-D30', 'NOTES','Take after meal','TX');
select * from xxinv_item_pei_taginfo;
Item id Org Id Item Record_type Record_value State
493991     224     1265-D30     USES     fever     TX
493991     224     1265-D30     HOW TO USE     one tablet daily     TX
493991     224     1265-D30     SIDE EFFECTS     XYZ     TX
493991     224     1265-D30     DRUG INTERACTION     ABC     TX
493991     224     1265-D30     OVERDOSE      Go and see doctor     TX
493991     224     1265-D30     NOTES     Take after meal     TX
Above is my data
I have to fetch the record_type from a lookup where I can have any of the record type, sometime USES, HOW TO USE, SIDE EFFECTS and sometimes some other set of record types
In my report I have to get these record typpes as field name dynamically whichever is available in that lookup and record values against them.
its a BI Publisher report.
please suggest

if you have data in db then you can create xml with needed structure
and so you can create bip report
do you have errors or .... ?

Dynamic SQL and Data with Single Quotes in it.

Hi There,
I have a problem in that I am using dynamic SQL and it happens that one of the columns does contain single quotes (') in it as part of the data. This causes the resultant dynamic SQL to get confused as the single quote that is part of the data is taken to mean end of sting, when in fact its part of the data. This leaves out a dangling single quote that was meant to enclose the string. Here is my dynamic SQL and the result of the parsed SQL that I have captured:
****Dynamic SQL*****
l_sql:='select NOTE_TEMPLATE_ID '||
'FROM TMP_NOTE_TEMPLATE_VALUES '||
'where TRIM(LEGACY_NOTE_CODE)='''||trim(fp_note_code)||''' '||
'and TRIM(DISPLAY_VALUE)='''||trim(fp_note_text)||''' ';
execute immediate l_sql INTO l_note_template_id;
Because the column DISPLAY_VALUE contains data with single quotes, the resultant SQL is:
******PARSED SQL************
select NOTE_TEMPLATE_ID
FROM TMP_NOTE_TEMPLATE_VALUES
where TRIM(LEGACY_NOTE_CODE)='INQ' and TRIM(DISPLAY_VALUE)='Cont'd'
And the problem lies with the single quote between teh characters t and d in the data field for DISPLAY_ITEM. How can I handle this?
Many thanks,

I have been reliably informed that if one doesn't enclose char/varchar2 data items in quotes, the right indices may not be usedI am into oracle for past 4 years and for the first time i am hearing this.
Your reliable source is just wrong. Bind variables are variables that store your value and which are used in SQL. They are the proper way to use values in your SQL. By default all variables in PL/SQL is bind variable.
When you can do some thing in just straight SQL just do it. Dynamic SQL does not make any sense to me here.
Thanks,
Karthick.

Dynamic Tables and Data Service

hi :)
i have a dynamic table (with add/delete row) buttons,
one of the fields in each row, needs to populate the rest of the fields with first/last/address information.
i understand how the data service works for a single fields, is there a way to do this by adding/deleting rows?
how can i bind them? and how do i ensure that the proper row is populating?
Thanks!

To get the instance of the subform that you are working on you can use this.parent.index. Now when addressing the field the occurance number is on the container subform and not on the field itself. So if you had a Page1 - Subform1 - Row - Object you would use Page1.Subform1.Row[instancenumber].object.rawValue
The only issue is the the [] are illegal in javascript so you can use the syntax:
xfa.resolveNode("Page1.Subform1.Row[" + this.parent.index + "]").object.rawValue
Make sense?

Dynamic memory and GC.

Hi,
I have bad memory problems and I would like to
know what is the proper way to handle the following
scenario (The object that will be created will be called
Obj1and each time before using this object I need to
call his constructor ):
1.a. There is a global declaration in main class
Obj1 ObjectItem;
b. When I want to use ObjectItem I do:
ObjectItem = new Obj1();
c. When I finished working with ObjectItem object:
ObjectItem = null;
My question is:
1.1 Is the GC will perform the cleanup of ObjectItem
object ?
1.2 What will happened if before the GC activation
There will be another use in this object and we
call the constructor again ? will the old object
memory will be free ?
1.3 What will happened if I will not write null in
object ? Is every constructor call will increase
the memory usage even though we have only
one object?
1.4 Will there be any problems if the object is
declared in local procedure.
Thanks a lot,
Lior Cohen.

Hi,
I have bad memory problems and I would like to
know what is the proper way to handle the following
g
scenario (The object that will be created will be
e called
Obj1and each time before using this object I need to
o
call his constructor ):
1.a. There is a global declaration in main class
Obj1 ObjectItem;
b. When I want to use ObjectItem I do:
ObjectItem = new Obj1();
c. When I finished working with ObjectItem object:
ObjectItem = null;
My question is:
1.1 Is the GC will perform the cleanup of
up of ObjectItem
object ?ObjectItem is a variable (really a field) and not an object. However, any object that is no longer reachable will be available for garbage collection. So, after you set ObjectItem to null, that object is available for GC.
1.2 What will happened if before the GC
he GC activation
There will be another use in this object
this object and we
call the constructor again ? will the old
will the old object
memory will be free ?You are confusing variables and objects. variables are slots into which references to objects can be placed. Variables only hold the reference, not the storage associated with the object and its fields. If you create a new object it uses some bit of the heap that is distinct from any other live object. Exactly when a garbage collector will identify an object as unreachable and therefore collectable and when the storage will be releases is not controllable or knowable by you. It will occur before out of memory errors will be thrown so don't worry with it.
1.3 What will happened if I will not write null
null in
object ? Is every constructor call will
r call will increase
the memory usage even though we have only
e have only
one object?Again you are confusing different concepts. Ys, every time you consruct an object it will consume a new bit of the heap. Reuse of heap storage only occurs after garbage collection. But don't worry about that. The JVM only needs space for all live, reachable objects. Other will be GC'ed before the JVM refuses to honor your request to construct an object.
If you do not set the variable to null, the the object will remain referenced until the variable goes out of scope or the object that owns it (assuming it is a field) is no longer reachable. You need not set variable to null except for in unusual cases where large nets of objects would remain referenced and thus consume heap space for much longer than desired and that cause heap size problems. Most of the time scope is sufficiently small to handle it for you.
1.4 Will there be any problems if the object is
ect is
declared in local procedure.
Objects are not declared, they are constructed. Variables (fields, arguments, locals) are declared, but no constructed. You can construct an object anywhere you'd like to and associate it with what ever variable of any scope you can reach at the time of assignment.
Thanks a lot,
Lior Cohen.

Dynamic memory allocation failure

Dear reader,
We sometimes have a problem where our windows 2012 r2 RDS virtual servers, that reside on windows 2012r2 hyper-v hosts, loose their dynamic memory and only have their startup memory left to work with. Users start complaining that things are very slow etc.
If I check several screens (RDS Broker load balancing, hyper-v manager, cluster manager and the vm's task manager) it's clear that the vm only has its startup memory allocated. I'm not sure if this happens instantly or immidiatly after the nightly reboot.
To resolve the problem we have to call all users on the vm where it happens and ask them to logoff (if they are even able to), and then we reboot the machine.
I have checked the logs from the machine where the VM resides on and the logs from the vm itself. But I cannot find anything. We also have alot of windows 2008r2 vm's with dynamivc memory, but none of those have ever had this problem.
Searched the internet, but so far it seems we are only.
Can anyone give me a lead to troubleshoot this?
Best regards,
Ruud Boersma
MCITP Enterprise administrator

Hi all,
I'm going to be "one of those people" who revives dead posts for something that is relevant but obviously not fixed... sorry in advance!
We have the exact same situation, a bunch of RDSH guests with Dynamic memory turned on (60+ of them). every day between 1-8 of them will fail to allocate Dynamic memory and will be stuck on their startup RAM amount. This really hurts our users at peak
times.
I have engaged our TAM and have raised a case with PSS, Usual story "your the only one with this problem". Which obviously isn't true.
So, we have tons of free RAM on the hosts, 600GB+ on most of them, the issue affects RDSH hosts at random, across multiple hosts and clusters.
The screen shots attached are of one of our hosts from this morning. it has 8GB startup, 8GB minimum, 32GB Maximum RAM configured, with a 23% buffer. the host has 752GB RAM FREE. Notice how the perf counter "Hyper-V Dynamic Memory Integration Service"
is reporting "0", it should be reporting "32768". also under task manager on the VM we are missing "Maximum memory" which should be just below "Hardware reserved" in the bottom right hand corner.
Looks like the balloon driver is being delayed at boot time, we are going to XPerf all the servers in the hope that we can catch the critter. It's an unusual problem.
We only have Acrobat PDF viewer, word viewer, excel viewer and two custom dot.NET applications installed on the guests. Some of the servers are also just dumb RDSH hosts, with not connection broker configured, using an F5 loadbalancer for load distribution
and session management. All guests are 2012R2 patched up to March 2015, integration Services are installed and up to date (its an enlightened OS remember).

Relationship between Dynamic Memory Heap and Heap Data Structure

This question is not strictly related to Java, but rather to programming in general, and I tend to get better answers from this community than any where else.
Somehow, my school and industry experience have somehow not given me the opportunity to explore and understand heaps (the data structure), so I'm investigating them now, and in particular, I've been looking at applications. I know they can be used for priority queues, heap sorts, and shortest path searches. However, I would have thought that, obviously, there must be some sort of relationship between the heap data structure, and the dynamic memory heap. Otherwise, I can think of no good reason why the dynamic memory heap would be named "heap". Surprisingly, after searching the web for 90 minutes or so, I've seen vague references, but nothing conclusive (trouble seems to be that it's hard to get Google to understand that I'm using the word "heap" in two different contexts, and similarly, it would not likely understand that web authors would use the word in two different contexts).
The Java Virtual Machine Spec is silent on the subject, as "The Java virtual machine assumes no particular type of automatic storage management system, and the storage management technique may be chosen according to the implementor's system requirements."
I've seen things like:
[of dynamic memory] "All the blocks of a particular size are kept in a sorted linked list or tree (I extrapolate that sorted tree could imply heap)"
[of dynamic memory] "The free and reserved areas of memory are maintained in a data structure similar to binary trees called a heap"
[of dynamic memory] "This is not related to the heap data structure"
[of dynamic memory] "Not to be confused with the data structure known as a "heap"
[of data structure] "Not to be confused with the dynamic memory pool, often known as TheHeap"
At this point, I've come to surmise that some (but not all) memory management algorithms use heaps to track which (pages? blocks? bytes?) of memory are used, and which are not. However, the point of a heap is to store data so that the max (or min) key is at the root of the heap. But we might want to allocate memory of different sizes at different times, so it wouldn't make sense to key on the amount of available memory in a particular region of the free store.
I must assume then that there would be a different heap maintained for each size of memory block that can be allocated, and the key must have something to do with the attractiveness of the particular memory block in the heap (perhaps the lowest address, resulting, hopefully, in growing the free store space less often, leaving more space for the stack to grow, or perhaps keyed based on the fragmentation, to hopefully result in less fragmentation, and therefore more efficient use of the memory space, or perhaps based on page boundaries, keeping as much data in the same page as possible, etc).
So at this point, I have a few questions I've been unable to resolve completely:
1. Am I correct that the heap was so named because (perhaps at one point in time), a heap is/was commonly used to track the available memory in the free store?
2. If so, would it be correct that there would be a heap per standard block size?
3. Also, at what level of granularity would a heap typically be used (memory page, memory blocks, individual words (4-bytes))?
4. What would be the most likely property one would use as a key. That is, what makes the root item on the heap ideal?
5. Would a industrial strength system like the jvm use a (perhaps modified or tuned) heap for this sort of task, or would this typically be too naive for an real world solution today?
Any insight would be awesome!
Thanks,
A.

jschell wrote:
I think you are not only mixing terms but domains.
For starters the OS allocs memory. Applications, regardless of language, request memory from the OS and use it in various ways.
There are many variations of the term "heap" like the following.
[http://en.wikipedia.org/wiki/Heap_(data_structure)]
[http://en.wikipedia.org/wiki/Dynamic_memory_allocation]
A java VM will request memory from the OS (from a 'heap') and use it in its application 'heap' (C/C++) and then create the Java 'heap'. There can be variations of that along the way that can and likely will include variations of how each heap is used, potentially code that creates its own heap, and potentially other allocators which use something which is not a heap.This last part, I find a bit confusing. By "use something which is not a heap", do you mean the heap data structure, or the dynamic memory pool meaning of heap? If the former, then you would be implying that it would be common for a heap data structure to be used to manage the heap dynamic memory pool. If the latter, what would this "something which is not a heap" be? The best definition of "heap" I've found simply states that it is a pool of memory that can be dynamically allocated. If there is some other way of allocating dynamic memory, then it would suggest that the previous definition of "heap" is incomplete.
>
So to terms.
1. Am I correct that the heap was so named because (perhaps at one point in time), a heap is/was commonly used to track the available memory in the free store?Which 'heap'? The VM one? It is probably named that because the implementors of the Sun VM were familar with how C++ and Smalltalk allocated memory.Okay, but that begs the question, was the heap in C++ and/or Smalltalk so named for the above queried reason?
>
2. If so, would it be correct that there would be a heap per standard block size?Not sure what you are referring to but probably a detail of the implementation. And since there are different levels the question doesn't mean much.
However OS allocations are always by block if that helps. After that it requires making the question much, much more specific.
3. Also, at what level of granularity would a heap typically be used (memory page, memory blocks, individual words (4-bytes))?Again not specific enough. A typical standard implementation of heap could not be at the word level. And it is unlikely, but not impossible, that variations would support word size allocations.
The VM heap might use word boundaries (but not size), where the application heap certainly does (word boundary.)My understanding of it is that the application would request blocks from the OS, and then something like malloc would manage the memory within the allocated blocks. malloc (or whatever equivalent Java uses) would have to keep track of the memory it has allocated somehow, and I would think it would have to do this at the word level, since it's most commonly going to allocate memory at the word level to be references to other objects, etc.
So I guess my question here would really be, if the dynamic memory heap is so named because there has been a memory management strategy that relied upon a heap data structure (which I've found no proof, but have found some suggestive literature), then would that probably have applied at the OS Page Fault level, tracking allocated blocks, or would that have applied at the malloc level, allocating individual words as necessary?
>
4. What would be the most likely property one would use as a key. That is, what makes the root item on the heap ideal?"Key" is not a term that will apply in this discussion.
You appear to be referring to strategies for effective allocation of memory such as allocations from different regions by size comparison.
It is possible that all levels might use such an allocator. General purpose applications do not sort allocations though (as per your one reference that mentions 'key'.) Sorry, I got the term "key" from an article I read regarding heaps, that indicates that a "key" is used to sort the elements, which I guess would be a more generalized way to make a heap than assuming a natural ordering on the elements in the heap. I'm not sure if the terminology is standard.
>
5. Would a industrial strength system like the jvm use a (perhaps modified or tuned) heap for this sort of task, or would this typically be too naive for an real world solution today?Again too indefinite. The Sun VM uses a rather complicated allocator, the model for which originated after years of proceeding research certainly in Smalltalk and in Lisp as well, both commercially and academically.
I am sure the default is rules driven either explicitly or implicitly as well. So it is self tuning.
There are command line options that allow you to change how it works as well.I guess perhaps I could attempt to clarify my initial question a bit.
There is a 1:1 correspondence between the runtime stack, and a stack data structure. That is, when you call a function, it pushes a stack frame onto the runtime stack. When you return from a function, it pops a stack frame from the runtime stack. This is almost certainly the reasons the runtime stack is named as it is.
The question is, is there or has there ever been a 1:1 correspondence between some aspect of the dynamic memory heap or how it is managed, and a heap data structure? If so, it would explain the name, but I'm a bit puzzled as to how a heap data structure would be of assistance in creating or managing the dynamic memory heap. If not, on the other hand, then does anybody know where the name "heap" came from, as it applies to the dynamic memory pool?
A.

Templates and Dynamic Memory Allocation Templates

Hi , I was reading a detailed article about templates and I came across the following paragraph
template<class T, size_t N>
class Stack
T data[N]; // Fixed capacity is N
size_t count;
public:
void push(const T& t);
};"You must provide a compile-time constant value for the parameter N when you request an instance of this template, such as *Stack<int, 100> myFixedStack;*
Because the value of N is known at compile time, the underlying array (data) can be placed on the run time stack instead of on the free store.
This can improve runtime performance by avoiding the overhead associated with dynamic memory allocation.
Now in the above paragraph what does
"This can improve runtime performance by avoiding the overhead associated with dynamic memory allocation." mean ?? What does template over head mean ??
I am a bit puzzled and i would really appreciate it if some one could explain to me what this sentence means thanks...

The run-time memory model of a C or C++ program consists of statically allocated data, automatically allocated data, and dynamically allocated data.
Data objects (e.g. variables) declared at namespace scope (which includes global scope) are statically allocated. Data objects local to a function that are declared static are also statically allocated. Static allocation means the storage for the data is available when the program is loaded, even before it begins to run. The data remains allocated until after the program exits.
Data objects local to a function that are not declared static are automatically allocated when the function starts to run. Example:
int foo() { int i; ... } Variable i does not exist until function foo begins to run, at which time space for it appears automatically. Each new invocation of foo gets its own location for i independent of other invocations of foo. Automatic allocation is usually referred to as stack allocation, since that is the usual implementation method: an area of storage that works like a stack, referenced by a dedicated machine register. Allocating the automatic data consists of adding (or subtracting) a value to the stack register. Popping the stack involves only subtracting (or adding) a value to the stack register. When the function exits, the stack is popped, releasing storage for all its automatic data.
Dynamically allocated storage is acquired by an explicit use of a new-expression, or a call to an allocation function like malloc(). Example:
int* ip = new int[100]; // allocate space for 100 integers
double* id = (double*)malloc(100*sizeof(double)); // allocate space for 100 doublesDynamic storage is not released until you release it explicitly via a delete-expression or a call to free(). Managing the "heap", the area from where dynamic storage is acquired, and to which it is released, can be quite time-consuming.
Your example of a Stack class (not to be confused with the program stack that is part of the C or C++ implementation) uses a fixed-size (that is, fixed at the point of template instance creation) automatically-allocated array to act as a stack data type. It has the advantage of taking zero time to allocate and release the space for the array. It has the disadvantages of any fixed-size array: it can waste space, or result in a program failure when you try to put N+1 objects into it, and it cannot be re-sized once created.

Data Deduplication - max memory allocation

Hi
i encountered this issue on a server:
2012R2
https://support.microsoft.com/en-us/kb/2891882/
i have configured the value from the KB, but i still get:
Data Deduplication detected job type "Optimization" on volume "\\?\Volume{8ce5ac3c-46df-4a37-8a9e-c4b28f1354d1}\" uses too much memory. 3179 MB is assigned. 3870 MB is used.
Data Deduplication cancelled job type "Optimization" on volume "\\?\Volume{8ce5ac3c-46df-4a37-8a9e-c4b28f1354d1}\". It uses too much memory than the amount assigned to it.
for the volume with most data.
can the value be increased?

Hi,
Please try to attempt a workaround by adding the following registry key with value 1000 to resolve the issue.
HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Services\ddpsvc\Settings\WlmMemoryOverPercentThreshold
Best Regards,
Mandy
Please remember to mark the replies as answers if they help and unmark them if they provide no help. If you have feedback for TechNet Subscriber Support, contact [email protected]

Data Deduplication and File Backup

Hello all,
This is my first question here in the forum. I just migrated one of our server from Server 2008 R2 to Server 2012 Standard R2. I use Freefilesync to backup a couple of network storages that was attached to the server 2008 and now it is attached to the Server
2012. I would like to know if I apply data deduplication on the network storage that are now attached to the Server 2012 would that affect the files on my backups? How would that work? Thanks

Thank you again. One last question: So, the storage savings I will have with dedupe won't be carried out to my backups? Thanks?
Space would be preserved it's just your data MSFT would "unpack" in the middle of the migration process. So sequence of actions looks like this:
1) Data generation tools puts bunch of files on dedupe-enabled volume.
2) MSFT scrubber process kicks in and "packs" data from 1) to now smaller amount of used blocks.
3) Copy process takes data from 2) and "unpacks" it in memory and copies it to destination volume, UNPACKED.
4) MSFT scrubber process kicks in on a destination volume to do basically the same it did in 2) for source volume.
So smart implementations like one done by HP and their StoreOnce would skip steps 3) and 4) as copy process would move indexes and hash<->data pairs. MSFT cannot do this (at least for now).
For reference:
HP StoreOnce Global Deduplication
http://h18006.www1.hp.com/storage/pdfs/hpstoreonce.pdf
Global Data Dedupe HOWTO
http://searchdatabackup.techtarget.com/definition/global-data-deduplication
Hope this helped :)
P.S. I'm NOT working for HP or whatever :)
StarWind VSAN [Virtual SAN] clusters Hyper-V without SAS, Fibre Channel, SMB 3.0 or iSCSI, uses Ethernet to mirror internally mounted SATA disks between hosts.

Does anyone know how to display (in LabVIEW) the memory use during execution of an image and data acquisition VI to predict when it is time to cease the acquisition to prevent the program crashing?

Does anyone know how to display (in LabVIEW) the memory use during execution of an image and data acquisition VI to predict when it is time to cease the acquisition to prevent the program crashing?
I am acquiring images and data to a buffer on the edge of the while loop, and am finding that the crashing of the program is unpredictable, but almost always due to a memory saturation when the buffers gets too big.
I have attached the VI.
Thanks for the help
Attachments:
new_control_and_acquisition_program.vi ‏946 KB

Take a look at this document that discusses how to monitor IMAQ memory usage:
http://digital.ni.com/public.nsf/websearch/8C6E405861C60DE786256DB400755957
Hope this helps -
Julie

Does anyone know how to display (in LabVIEW) the memory use during execution of an image and data acquisition VI to predict when it is time to cease the acquisition to prevent the program crashing?

Does anyone know how to display (in LabVIEW) the memory use during execution of an image and data acquisition VI to predict when it is time to cease the acquisition to prevent the program crashing?
I am acquiring images and data to a buffer on the edge of the while loop, and am finding that the crashing of the program is unpredictable, but almost always due to a memory saturation when the buffers gets too big.
I have attached the VI.
Thanks for the help
Attachments:
new_control_and_acquisition_program.vi ‏946 KB

got these vi's off ni site a while ago - see if they help
Attachments:
Memory_Monitor.zip ‏132 KB

Dynamic loading tree and data grid

Hi All,
I new to java as well as JSF. I am very impressed with the jsf and Sun Java Creator IDE. I made a sample project.
Now I want to load tree and data grid with dynamic values how can I achieve this.
Please help to find out some examples.
Also I need to know who I can use SOAP call using JSF.
Thanks
CSCS

To dynamically load a Basic Table (ui:table) from a database, see http://developers.sun.com/prodtech/javatools/jscreator/learning/tutorials/2/databoundcomponents.html
To dynamically load a Basic Table from other sources of data that are loaded into an array or such, see http://blogs.sun.com/roller/page/divas?entry=table_component_sample_project
To dynamically CREATE a Basic Table, see http://developers.sun.com/prodtech/javatools/jscreator/reference/tips/2/createTableDynamically.html and http://developers.sun.com/prodtech/javatools/jscreator/reference/tips/2/add_component_to_table.html
To dynamically create an HTML table on the fly, see section 7.5 in Chapter 7 of the Field Guide at http://developers.sun.com/prodtech/javatools/jscreator/learning/bookshelf/index.html
To dynamically create a tree, see Dynamic Tree example at http://developers.sun.com/prodtech/javatools/jscreator/reference/index.jsp.
A tutorial for dynamically creating a tree from a database is work in progress.
Hope this helps,
Chris

Exporting snapshotted VMs and dynamic memory

We have a production VM which uses dynamic memory. Unfortunately, someone decided to snapshot this machine and now we cannot export the VM using the hyper-v "Export" facility.
Export gives a warning message indicating that VMs and snapshots cannot be imported into Server 2008R2 and that dynamic memory must be turned off prior to exporting. Here's the message:
I can turn off dynamic memory in the main VM but each snapshot has its own setting for dynamic memory. I can see the setting, dynamic memory is on but it is grayed out.
As a backup, I want to export the VM prior to merging the snapshots. How can I do this?
Thanks,
Alan
[email protected]
Alan MacKenzie [email protected]

Yes, you cannot import to Server 2008 R2, you can only import to Server 2008 R2 SP1 or newer.
You cannot go backward in the version of the hypervisor, that is what it is warning about. It is not a block, it is just information. You can still Export and Import (if necessary) to a 2008 R2 SP1 or 2012 machine.
In regards to the snapshot. That is a different issue. Simply delete the saved state portion (the running memory part) of the snapshot.
Brian Ehlert
http://ITProctology.blogspot.com
Learn. Apply. Repeat.
Disclaimer: Attempting change is of your own free will.

I want to know memory manament and data display algorithm in LabViEW.Where can I get some materials about them?

I want to know memory manament and data display algorithm in LabViEW.Where can I get some materials about them? I need them to complete my essay .Thank you for your help.

Memory menagement:
http://zone.ni.com/devzone/conceptd.nsf/2d17d611efb58b22862567a9006ffe76/732cec772aa4fbe586256a37005541d3?OpenDocument
About data display: what type of data you wat display?

Dynamic Memory and Data Deduplication

Similar Messages

Maybe you are looking for