Query on Physical Architecture,Logical Architecture and Model

Hi Experts,
I have a confusion regarding Physical Architecture,Logical Architecture and Model.Please tell me what type of information or data these above three hold.
Thanks

Physical architecture contains information on the physical setup of your environment i.e. server names, jdbc connection strings, usernames, Passwords etc.
The logical architecture provides a layer of abstraction that allows you to group via contexts similar Physical architecture components which reside in different locations/environments.
Models are the reversed representations of the objects in your physical architecture i.e. tables, flat files etc. Models are used as sources and targets in your interface design

Similar Messages

Heatsink, logic board and physical architecture

Want to ask anyone who knows the macbook physical architecture:
How's the heatsink related to logic board? Is it etched to the logic board or are they seperated? Does a replacement of logic board also replace the heatsink?
Thank you!

So according to what you say, my RSD problem is still not solved.
That's jumping to conclusions.
There are many possible reasons why a computer might suddenly shut down.
With the first version of the MacBook many people reported the following:
a) The computer would shut down many times, seemingly at random.
b) After waiting a while they were able to turn the computer back on again.
c) Either replacing the heat sink assembly or installing the SMC firmware update fixed the problem.
But I see from one of your other posts that in your case:
a) You had only one shut down.
b) Your MacBook would not start up at all afterwards.
c) The shut down occurred after you'd installed the SMC firmware update.
This suggests that in the case of your MacBook the shutdown had a different cause and would therefore require a different remedy.
I recommend you just use your MacBook normally. After a while you will be able to judge whether the shop has correctly diagnosed and fixed the problem.

Unable to compile T1 Architecture and Simulation modelling tool

Hello,
I am trying to compile the T1 Simulation and Architecture modelling tool. The whole package is downloaded from opensparc.net
As a requirement, i am using Solaris 10 on SPARC based machine with Solaris Studio 12.3 as the compiler.
When i am running the "build_sas.sh full" script, it gives me an error:
--- Building n1 in strand ---
/opt/solarisstudio12.3//bin/CC -G -KPIC -fast -xO5 -DNDEBUG -DRS_INLINE=inline -DRS_MPSAS_COMPATIBLE    -xarch=v9a -DHOST64BIT=1    -DN1_BOOTS10 -DMEMORY_SPARSE -I../../include/strand -I../../include/fw -I../../include/mmu -I../../include/asi -I../../include/core -I../../include/cpu -I../../include/system -I../../include/trap -I../../include/register -I/scratch//sam-t1/devtools/64/shade/inc -c -o obj64opt_n1/V9/V9_AsiReg.o V9/V9_AsiReg.cc
CC: Warning: -xarch=v9a is deprecated, use -m64 -xarch=sparcvis instead
"../../include/fw/Callee.h", line 98: Error: 'Riesling::operator new(unsigned long, Riesling::CalleeAllocator&)' may not be declared within a namespace.
1 Error(s) detected.
*** Error code 2
make: Fatal error: Command failed for target `obj64opt_n1/V9/V9_AsiReg.o'
Current working directory /scratch/sam-t1/src/riesling-cm/riesling/src/strand
*** Error code 1
make: Fatal error: Command failed for target `strand'
the Callee.h file has the following declaration for line#97:
inline void* operator new( size_t size, CalleeAllocator& a )/*{{{*/
// This new() function is called for code written as
// new(CalleeAllocator::allocator) Callee0<void>(f);
// and allocates size bytes from the CalleeAllocator
return a.alloc(size);
I did some Google search, and found that, "An allocation function shall be a class member function or a global function; a program is ill-formed if an allocation function is declared in a namespace scope other than global scope or declared static in global scope. [..]" (c++ - operator new inside namespace - Stack Overflow).
Would appreciate any help or suggestion.

I tried you last suggestion, by simply moving the "new" function before the namespace, but it gave me the following Error: The prior declaration for operator new(unsigned long) has no exception specification.
So, I naively just defined the new as below, just to see what happens:
41 inline void* operator new( size_t size, CalleeAllocator& a) throw()
    42 {return a.alloc(size);
    43 }
which, after compilation gives the following error:
Error: std::bad_alloc is not in the prior exception specification
The download link to the whole package is here: OpenSPARC T1
At the end of the page, there is the download link to the OpenSPARC T1 Processor for Architecture and Performance Modeling Tools.
below is the original Callee.h file: Line 97 is where the operator new is defined which appears to be outside of namespace Riesling.
* ========== Copyright Header Begin ==========================================
* OpenSPARC T1 Processor File: Callee.h
* Copyright (c) 2006 Sun Microsystems, Inc. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES.
* The above named program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public
* License version 2 as published by the Free Software Foundation.
* The above named program is distributed in the hope that it will be
* useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
* You should have received a copy of the GNU General Public
* License along with this work; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
* ========== Copyright Header End ============================================
#ifndef __Callee_h__
#define __Callee_h__
** Copyright (C) 2002, Sun Microsystems, Inc.
** Sun considers its source code as an unpublished, proprietary
** trade secret and it is available only under strict license provisions.
** This copyright notice is placed here only to protect Sun in the event
** the source is deemed a published work. Disassembly, decompilation,
** or other means of reducing the object code to human readable form
** is prohibited by the license agreement under which this code is
** provided to the user or company in possession of this copy."
#include "DataTypes.h"
namespace Riesling {
class CalleeAllocator/*{{{*/
// CalleeAllocator is a helper class for implementing the callee_method() and
// callee_function() functions that dynamically allocate a Callee object. This
// class takes the burden of the coder for having to manage those dynamically
// allocated objects and also avoids many calls to malloc().
public:
    CalleeAllocator() : page(0), free((void**)1), full(0) {}
    ~CalleeAllocator()
      while (page)
    Page* help = page;
    page = page->next;
    delete help;
    void* alloc( uint_t size )
      void* cell;
      size = (size + sizeof(void*) - 1) / sizeof(void*);
      if ((free + size) > full)
    page = new Page(page);
    free = page->page;
    full = page->page + Page::SIZE;
      cell = free;
      free = free + size;
      return cell;
    static CalleeAllocator allocator;
private:
    class Page
      public:
    enum { SIZE = 4096 };
    Page( Page* pntr ) : next(pntr) {}
    Page* next;
    void* page[SIZE];
    Page* page;
    void** free;
    void** full;
inline void* operator new( size_t size, CalleeAllocator& a )/*{{{*/
// This new() function is called for code written as
// new(CalleeAllocator::allocator) Callee0<void>(f);
// and allocates size bytes from the CalleeAllocator
return a.alloc(size);
#ifndef COMPILER_ABI_CHANGED
inline void* gnu_vtbl_lookup( void* object, void* method )/*{{{*/
// The GNU compiler makes a virtual method into an integer index into the
// virtual table. It indicates this through bit 0 of the method being 1. If that
// bit is set then we get the virtual table and index for the method. If the bit 0
// is 0 then the method is a pointer to a function already.
#ifdef __GNU__
if (int(method) & 1)
    return (*(void***)object)[int(method) / sizeof(void*)];
else
#endif
    return method;
template<class Object, class Return> union MethodToFunction0/*{{{*/
// The templated union MethodToFunction0 converts a method pointer
// to a function pointer. The SparcWorks compiler already transforms
// method pointers to function pointers. For the GNU C++ compiler we
// need to check for virtual functions and do a virtual table lookup.
MethodToFunction0<Object,Return>( Object* object, Return (Object::*_method)() )
    method(_method)
    (void*&)function = gnu_vtbl_lookup(object,(void*)function);
Return (Object::*method)();        // The method to convert to a function
Return (*function)(void*);        // The converted function, the first argument is the this pointer
template<class Return> class Callee0/*{{{*/
// The Callee class holds the function pointer or method pointer that
// represents the callee. The caller is a pointer to the Callee class.
public:
    typedef Return (*Function)();
    typedef Return (*Method)(void*);
    Callee0<Return>( Function f )
      object(0),
      function(f)
    template<class Object> Callee0<Return>( Object* o, MethodToFunction0<Object,Return> m )
      object(o),
      method(m.function)
    Return call()
      return object ? (*method)(object) : (*function)();
protected:
    void*      object;        // If object is 0 (NULL) then we have a function to call
    union             // Else a method need to be called.
      Method   method;
      Function function;
template<class Return> Callee0<Return>* callee_function( Return (*f)() )/*{{{*/
// callee_function() creates a Callee object of the function. The compiler
// helps in figuring out the type signature ... hurra for templates:
// Callee<void>* c = calee_function(f);
return new(CalleeAllocator::allocator) Callee0<Return>(f);
template<class Object, class Return> Callee0<Return>* callee_method( Object* o, Return (Object::*m)() )/*{{{*/
// callee_method() creates a Callee object of the method. The compiler
// helps in figuring out the type signature. The function requires an
// object and the template enforces that the object and method are of the
// same type. Don't cast object pointers. The method must exists, e.g.
// inherited methods need to be replicated (fat interface). Virtual methods
// are eradicated.
return new(CalleeAllocator::allocator) Callee0<Return>(o,MethodToFunction0<Object,Return>(o,m));
template<class Object, class Return, class Arg1> union MethodToFunction1/*{{{*/
MethodToFunction1<Object,Return,Arg1>( Object* object, Return (Object::*_method)(Arg1) )
    method(_method)
    (void*&)function = gnu_vtbl_lookup(object,(void*)function);
Return (Object::*method)(Arg1);
Return (*function)(void*,Arg1);
template<class Return, class Arg1> class Callee1/*{{{*/
public:
    typedef Return (*Function)(Arg1);
    typedef Return (*Method)(void*,Arg1);
    Callee1<Return,Arg1>( Function f ) : object(0), function(f) {}
    template<class Object> Callee1<Return,Arg1>( Object* o, MethodToFunction1<Object,Return,Arg1> m )
      object(o),
      method(m.function)
    Return call( Arg1 a1 )
      return object ? (*method)(object,a1) : (*function)(a1);
protected:
    void*    object;
    union
      Method   method;
      Function function;
template<class Return, class Arg1> Callee1<Return,Arg1>* callee_function( Return (*f)(Arg1) )/*{{{*/
return new(CalleeAllocator::allocator) Callee1<Return,Arg1>(f);
template<class Object, class Return, class Arg1> Callee1<Return,Arg1>* callee_method( Object* o, Return (Object::*m)(Arg1) )/*{{{*/
return new(CalleeAllocator::allocator) Callee1<Return,Arg1>(o,MethodToFunction1<Object,Return,Arg1>(o,m));
template<class Object, class Return, class Arg1, class Arg2> union MethodToFunction2/*{{{*/
MethodToFunction2<Object,Return,Arg1,Arg2>( Object* object, Return (Object::*_method)(Arg1,Arg2) )
    method(_method)
    (void*&)function = gnu_vtbl_lookup(object,(void*)function);
Return (Object::*method)(Arg1,Arg2);
Return (*function)(void*,Arg1,Arg2);
template<class Return, class Arg1, class Arg2> class Callee2/*{{{*/
public:
    typedef Return (*Function)(Arg1,Arg2);
    typedef Return (*Method)(void*,Arg1,Arg2);
    Callee2<Return,Arg1,Arg2>( Function f ) : object(0), function(f) {}
    template<class Object> Callee2<Return,Arg1,Arg2>( Object* o, MethodToFunction2<Object,Return,Arg1,Arg2> m )
      object(o),
      method(m.function)
    Return call( Arg1 a1, Arg2 a2 )
      return object ? (*method)(object,a1,a2) : (*function)(a1,a2);
protected:
    void*    object;
    union
      Method   method;
      Function function;
template<class Return, class Arg1, class Arg2> Callee2<Return,Arg1,Arg2>* callee_function( Return (*f)(Arg1,Arg2) )/*{{{*/
return new(CalleeAllocator::allocator) Callee2<Return,Arg1,Arg2>(f);
template<class Object, class Return, class Arg1, class Arg2> Callee2<Return,Arg1,Arg2>* callee_method( Object* o, Return (Object::*m)(Arg1,Arg2) )/*{{{*/
return new(CalleeAllocator::allocator) Callee2<Return,Arg1,Arg2>(o,MethodToFunction2<Object,Return,Arg1,Arg2>(o,m));
template<class Object, class Return, class Arg1, class Arg2, class Arg3> union MethodToFunction3/*{{{*/
MethodToFunction3<Object,Return,Arg1,Arg2,Arg3>( Object* object, Return (Object::*_method)(Arg1,Arg2,Arg3) )
    method(_method)
    (void*&)function = gnu_vtbl_lookup(object,(void*)function);
Return (Object::*method)(Arg1,Arg2,Arg3);
Return (*function)(void*,Arg1,Arg2,Arg3);
template<class Return, class Arg1, class Arg2, class Arg3> class Callee3/*{{{*/
public:
    typedef Return (*Function)(Arg1,Arg2,Arg3);
    typedef Return (*Method)(void*,Arg1,Arg2,Arg3);
    Callee3<Return,Arg1,Arg2,Arg3>( Function f ) : object(0), function(f) {}
    template<class Object> Callee3<Return,Arg1,Arg2,Arg3>( Object* o, MethodToFunction3<Object,Return,Arg1,Arg2,Arg3> m )
      object(o),
      method(m.function)
    Return call( Arg1 a1, Arg2 a2, Arg3 a3 )
      return object ? (*method)(object,a1,a2,a3) : (*function)(a1,a2,a3);
protected:
    void*    object;
    union
      Method   method;
      Function function;
template<class Return, class Arg1, class Arg2, class Arg3> Callee3<Return,Arg1,Arg2,Arg3>* callee_function( Return (*f)(Arg1,Arg2,Arg3) )/*{{{*/
return new(CalleeAllocator::allocator) Callee3<Return,Arg1,Arg2,Arg3>(f);
template<class Object, class Return, class Arg1, class Arg2, class Arg3> Callee3<Return,Arg1,Arg2,Arg3>* callee_method( Object* o, Return (Object::*m)(Arg1,Arg2,Arg3) )/*{{{*/
return new(CalleeAllocator::allocator) Callee3<Return,Arg1,Arg2,Arg3>(o,MethodToFunction3<Object,Return,Arg1,Arg2,Arg3>(o,m));
#else
template<class Return> class Callee0/*{{{*/
public:
    Callee0<Return>() {}
    virtual ~Callee0() {}
    virtual Return call      () = 0;
template<class Return> class CalleeFunction0 : public Callee0<Return>/*{{{*/
public:
    typedef Return (*Function)();
    CalleeFunction0<Return>( Function f ) : Callee0<Return>(), function(f) {}
    Return call      () { return (*function)(); }
protected:
    Function function;
template<class Object, class Return> class CalleeMethod0 : public Callee0<Return>/*{{{*/
public:
    typedef Return (Object::*Method)();
    CalleeMethod0<Object,Return>( Object* o, Method m ) : Callee0<Return>(), object(o), method(m) {}
    Return call      () { return (object->*method)(); }
protected:
    Object* object;
    Method method;
template<class Return> CalleeFunction0<Return>* callee_function( Return (*f)() )/*{{{*/
return new(CalleeAllocator::allocator) CalleeFunction0<Return>(f);
template<class Object, class Return> CalleeMethod0<Object,Return>* callee_method( Object* o, Return (Object::*m)() )/*{{{*/
return new(CalleeAllocator::allocator) CalleeMethod0<Object,Return>(o,m);
template<class Return, class Arg1> class Callee1/*{{{*/
public:
    Callee1<Return,Arg1>() {}
    virtual ~Callee1() {}
    virtual Return call      ( Arg1 a1 ) = 0;
template<class Return, class Arg1> class CalleeFunction1 : public Callee1<Return,Arg1>/*{{{*/
public:
    typedef Return (*Function)( Arg1 );
    CalleeFunction1<Return,Arg1>( Function f ) : Callee1<Return,Arg1>(), function(f) {}
    Return call      ( Arg1 a1 ) { return (*function)(a1); }
protected:
    Function function;
template<class Object, class Return, class Arg1> class CalleeMethod1 : public Callee1<Return,Arg1>/*{{{*/
public:
    typedef Return (Object::*Method)( Arg1 );
    CalleeMethod1<Object,Return,Arg1>( Object* o, Method m ) : Callee1<Return,Arg1>(), object(o), method(m) {}
    Return call      ( Arg1 a1 ) { return (object->*method)(a1); }
protected:
    Object* object;
    Method method;
template<class Return, class Arg1> CalleeFunction1<Return,Arg1>* callee_function( Return (*f)(Arg1) )/*{{{*/
return new(CalleeAllocator::allocator) CalleeFunction1<Return,Arg1>(f);
template<class Object, class Return, class Arg1> CalleeMethod1<Object,Return,Arg1>* callee_method( Object* o, Return (Object::*m)(Arg1) )/*{{{*/
return new(CalleeAllocator::allocator) CalleeMethod1<Object,Return,Arg1>(o,m);
template<class Return, class Arg1, class Arg2> class Callee2/*{{{*/
public:
    Callee2<Return,Arg1,Arg2>() {}
    virtual ~Callee2() {}
    virtual Return call      ( Arg1 a1, Arg2 a2 ) = 0;
template<class Return, class Arg1, class Arg2> class CalleeFunction2 : public Callee2<Return,Arg1,Arg2>/*{{{*/
public:
    typedef Return (*Function)( Arg1, Arg2 );
    CalleeFunction2<Return,Arg1,Arg2>( Function f ) : Callee2<Return,Arg1,Arg2>(), function(f) {}
    Return call      ( Arg1 a1, Arg2 a2 ) { return (*function)(a1,a2); }
protected:
    Function function;
template<class Object, class Return, class Arg1, class Arg2> class CalleeMethod2 : public Callee2<Return,Arg1,Arg2>/*{{{*/
public:
    typedef Return (Object::*Method)( Arg1, Arg2 );
    CalleeMethod2<Object,Return,Arg1,Arg2>( Object* o, Method m ) : Callee2<Return,Arg1,Arg2>(), object(o), method(m) {}
    Return call      ( Arg1 a1, Arg2 a2 ) { return (object->*method)(a1,a2); }
protected:
    Object* object;
    Method method;
template<class Return, class Arg1, class Arg2> CalleeFunction2<Return,Arg1,Arg2>* callee_function( Return (*f)(Arg1,Arg2) )/*{{{*/
return new(CalleeAllocator::allocator) CalleeFunction2<Return,Arg1,Arg2>(f);
template<class Object, class Return, class Arg1, class Arg2> CalleeMethod2<Object,Return,Arg1,Arg2>* callee_method( Object* o, Return (Object::*m)(Arg1,Arg2) )/*{{{*/
return new(CalleeAllocator::allocator) CalleeMethod2<Object,Return,Arg1,Arg2>(o,m);
#endif
#endif

Dynamic physical architecture

Hello All,
I wonder if it is possible to have a physical architecture be dynamic....
I have a comprehensive ODI framework, which calls upon certain flat files and (mostly) reads/writes from/to these using a variety of interfaces. The names (and location (directories)) of the flat files are stored as variables (extracted from a table.) The information about file locations is, therefore found in two locations: 1) in the variables and 2) in the physical architecture.
I would like to have the location information stored in the variables only and assigned dynamically to the physical architecture, so that I can have applications and users change the location.
Is this possible? In other words, can the physical architecture pointer for a flat file be represented as a variable (#<PROJNAME>.<Directory>)? If so, when is the pointer resolved and what, if any, are the constraints?
Alternatively, can the physical architecture pointers be left blank, and can the entire file resolution be done in a variable (in the interface)? In other words, can the issue of physical architecture be postponed to a point where it is resolved by the interface execution.
Here is an example....
I want to access a file, X.JNK, stored in the directory C:\MYDIR on the host A.
Today the physical architecture points to C:\MYDIR, and the interface code identifies X.JNK (as a variable <PROJNAME>.<FILENAME>, e.g. #MYPROJ.JUNKFILE = X.JNK).
The directory is also stored in a variable (as <PROJNAME><DIRECTORY>, e.g. #MYPROJ.JUNKDIRECTORY = C:\MYDIR), and so the fully qualified "address" for the file is:
#<PROJENAME><DIRECTORY>\#<PROJNAME><DIRECTORY> =
#MYPROJ.JUNKDIRECTORY\#MYPROJ.JUNKDIRECTORY =
C:\MYDIR\X.JNK
Given that setup, can the physical architecture be left blank (except for host information) and the interface be executed with #MYPROJ.JUNKDIRECTORY\#MYPROJ.JUNKDIRECTORY?
Best,
pajacobsen

Dev,
Yes, it works, although, for reasons unknown, I had to completely redo all interfaces that drew upon the affected models (I attempted a variety of other changes (modifying, for instance, the alias), but, ultimately, nothing worked until I rebuilt all the interfaces.
So, in sum, this issue is closed with the proviso that it is necessary to redo the interfaces.
Best,
pajacobsen
P.S. I often end up having to redo interfaces (rather than edit them) once I introduce changes to the models. Although the interfaces, on the surface, looks fine after the modification of the model, they don't work (I suspect a pointer problem.) I guess there are limits to ODI's flexible nature.
Edited by: user11102735 on Nov 23, 2010 1:59 PM

Business object architecture data model

HI All,
Can anyone give the architectural data model for business object ?
i got few but my data base is sap BI and i need to design a document to show the data model
so anybody having such document or any link for that so please share.
thanks in advance.
regards,
DJ.

Hi DJ,
Best Practice says that if you have SAP BI in Back end and SAP BOBJ on front End then follow below mentioned path.
Create your SAP Query on the top of your InfoCube or ODS etc
Use calculated Key Figures and Restricted Key Figures in your Query.
Use most of the objects under Free Characteristics area for better performance and results
Create your Universe on the top of SAP Query. (we can create universe on the top of Cube and ODS but then we cannot use variable and performance also gets hit)
You can also create further variable / Filters at Universe level instead of WebI to improve performance
Create WebI report or Crystal Report etc (You can also create variables / Filters here).
Page 38 of following link gives a diagram for better understanding.
[http://help.sap.com/businessobject/product_guides/boexir31/en/xi3-1_bip_admin_en.pdf]
Bashir Awan

Difference between n-layer software architecture and MVVM design pattern?

hello everyone,
I am not clear with this concepts of Software architecture pattern and design pattern.
I am developing an wpf application using MVVM. Now, my question is, does MVVM come under n-layered architecture?
or n-layer architecture and MVVM both are different?
Regards,
Rakesh.N
Rakesh murthy

"
Now my question is, i want to process the data which i get from database. where should i write that processing logic after getting the data from database? in model classes? or in view model classes?
The model is however the data comes from wherever it comes from.
If there is any processing after you get it then that would be in the viewmodel.
The viewmodel adapts your data to the view.
If it needs any adapting then the viewmodel does that, not the model.
EG here
protected async override void GetData()
ThrobberVisible = Visibility.Visible;
ObservableCollection<CustomerVM> _customers = new ObservableCollection<CustomerVM>();
var customers = await (from c in db.Customers
orderby c.CustomerName
select c).ToListAsync();
foreach (Customer cust in customers)
_customers.Add(new CustomerVM { IsNew = false, TheEntity = cust });
Customers = _customers;
RaisePropertyChanged("Customers");
ThrobberVisible = Visibility.Collapsed;
That logic is in a viewmodel.
in this context , in which layer the viewmodel and model classes are put under in n-tier architecture?
They're in two of the n layers/tiers.
Or they're in one.
Depending on how someone decides to classify a layer or a tier.
There is no absolute definition.
Why would you care?
Hope that helps.
Technet articles: Uneventful MVVM;
All my Technet Articles

How to build the Logical cube and physical cube

Hi All,
I have to build the logical cube and physical cube ,i dont have idea about this ,that means i think for that we have to do the partition for the cube
may i correct , correct me if i wrong ,plz help me on this
Thanks

Hi,
1. Firsty, logical model and physical model are the terms ,which we generally use in the context of database modelling excercise.
2. Coming to essbase, I am not sure ,what exactly you are trying to co relate . but as you termed 'partitions'. There is one of the types in partitioning called 'Transparent Partition'. Where, you have one cube ( which has data in it) and you can have one mroe cube ( which actually has no data in it). But it can be connected to the former cube with the help of transparent partition. This way, you have 2 cubes , but only one cube has data in it.
Sandeep Reddy Enti
HCC
http://hyperionconsultancy.com/

How to reduce logical count and scan count for a select query

hi,
I have two tables one is master and other is history. i need to combine this two tables into one temporary table.
I am using the below query to create temp table.
Select * into temporders
from
(select * from orders
union
select * from ordershistory) b
where updateon= (select max(updateon)from (select updateon,name,units,subunits from orders
union
select updateon,name,units,subunits from ordershistory) a
where updateon <='11/08/2008 11:18 AM' and a.name=b.name and a.units=b.units and a.subunits=b.subunits group by name,units,subunits)
order by report,subunitsorder
the statistics for this query:
SQL Server parse and compile time:
CPU time = 47 ms, elapsed time = 62 ms.
Table 'Worktable'. Scan count 556, logical reads 1569, physical reads 0, read-ahead reads 0, lob logical reads 0, lob physical reads 0, lob read-ahead reads 0.
Table 'ORDERSHISTORY'. Scan count 116, logical reads 339, physical reads 0, read-ahead reads 0, lob logical reads 0, lob physical reads 0, lob read-ahead reads 0.
Table 'ORDERS'. Scan count 116, logical reads 285, physical reads 0, read-ahead reads 0, lob logical reads 0, lob physical reads 0, lob read-ahead reads 0.
SQL Server Execution Times:
CPU time = 32 ms, elapsed time = 63 ms.
(115 row(s) affected)
you see logical reads and scan count for worktable(temporary) is quite high.
So anyone can give a solution for reduce the scan count and logical reads.
NOTE: name,units, subunits,updateon columns have primarykey

SQL ServerAm i reading it properly? :(
This is Oracle Forum And not the SQL Server.
Regards.
Satyaki De.

Best architecture and design pattern to use

I am currently designing a moderately sized LabView application and cannot decide on the best architecture/design pattern or combinations thereof to implement.
The program basically polls an instrument connected to a serial port continuously at a 2-10Hz rate. When operator clicks a button to start a run, the polled data is then filtered, has math functions performed on the data, writes collected data to files, and produces reltime graphs and calculates point-by-point statistics. At the completion of a run, some additional data files are written. I pretty much know how to accomplish all these tasks.
What is also required is main-vi front panel interaction by the operator to access a database (via a C# dll with .Net) to query for specifications to apply in order to determine pass/fail status. Setup conditions also need to be changed from time to time by the operator and applied to the data in real time (ie- a measurement offset). I have prototyped the database portion successfully thus far.
For the main vi, I started off using the Top Level Application Using Events design pattern (Event structure within a while loop). Copious use of bundled clusters and shift registers keep the database data updated. I cannot figure out how to have the top level vi concurrently poll the serial device as outlined above. The Event structure is only active when defined control values change, and use of a timeout is no help since it prevent data from being collected while the user is accessing the database. All database and setup parameters must be applied to the data as it comes in from the serial port. Error trapping/recovery is a must.
I believe what I need is two parallel processes running under my main vi (one for database and setup, the other for polling and data processing/display, but what would be the preferred choice here?
Revert back to a polled loop in lieu of Events, use notifiers, occurrences, user-defined events, Producer-consumer loops?
It�s been about 3 years since I have had an application on this level (which used a state machine architecture), and a lot has changed in LabView (using 7.1 Prof Devel). I am currently having a mental block while trying to digest a lot of features I have never used before.
Suggestions Welcome!
Thanks.
~~~~~~~~~~~~~~~~~~~~~~~~~~
"It’s the questions that drive us.”
~~~~~~~~~~~~~~~~~~~~~~~~~~

I suggest a (3) state machine(s) architecture. The first is the user interface. Your main VI is a good start. Another state machine handles the instrument I/O (your serial polling). The third handles all data processing. The three loops run independently. Each has a wait to allow LV's scheduler to share CPU time among the loops. I like queues or functional globals for inter-loop communications.
This allows a lot of flexibility. Each portion can be tested alone. Each can have different timing and priority.
Spend some time thinking about what needs to be done and plan the structure carefully before you do any coding (except for little test programs to try new ideas).
I also like Conway and Watts "A Software Engineering Approach to LabVIEW", published
by Prentice Hall.
Lynn

Sample Oracle EBS R12 physical/architecture layout diagram

Hello!
Anyone can share sample Oracle EBS R12 Physical/architecture layout diagram?
Primarily I am looking for a sample diagram that shows mid-tier..concurrent managers/reporting nodes/load partitioning and database nodes

user10229350 wrote:
First you stop responding with unnecessary links which are of no help.
Hussein's comment in this thread was spot-on correct.
Multi-posting is poor forum etiquette at best and outright rudeness that exhibits arrogance at worst.
Your other thread has an appropriate response that directs you to the product's documentation.
That documentation exists to guide you how to use the product as designed.
This thread is locked.

Hyperion Planning - Physical Architecture

Hi Experts,
I'm checking through the connections in the physical architecture of ODI for ERPi. When I test the connection to Planning I get the following error:
Connection failed
java.lang.Exception
I have checked the ODI agent is working and the server reference and port are correct.
I'm hoping someone will be able to show me the light!? Also, would this impact drillthrough?
Thanks in advance.
Mark

Mark,
ODI has no bearing on DrillBack. All ODI is used for is to retrieve information out of Oracle EBS and provide it to ERPi. ERPi then at that point will load the data into the desired target; based on the target application settings.
For the error; it seems that either something is not valid .... or is not able to be 'tested'. Please follow the documentation noted in KM: Configure and use ERPi to load data into Financial Data Quality Management from EBS [ID 951369.1]
Thank you,

Best (Thrifty) physical architecture for medium-size environment?

What is the absolute best physical architecture you would come up with for this medium size environment?

Thrifty? The SharePoint CALs alone will run you at least $1.5 million unless you already own these or have a good EA. You said "basic collaboration" so I'm assuming you don't also need Enterprise CALs though note some of the features you listed
could require enterprise licensing depending on how you're using them.
The information you haven't provided isn't enough to make an appropriate recommendation. While you have 10,000 users it's not clear how many concurrent users you expect, or what sort of workloads these users will have.
Are the users all in one location? Spread out geographically? What types of network connections? Why types of networking devices (such as a load balancer for your second option)
Is this virtual or physical? What are the hardware specs of the servers?
How many documents do you expect to have? How large will they be? What sort of storage is backing this farm? How many site collections, sites, lists, libraries, items do you expect? Workflows, third party solutions, customizations, etc. The list goes on.
Neither of these options provide high availability. Is this a concern for you? I ask because in my experience a SharePoint farm used by over 10,000 people needs to be highly available. If you need HA then you'll need more servers.
Honestly this forum isn't the best place to get the information you're looking for (i.e. an architectural design). Instead I recommend asking specific questions about specific problems you have with your design.
My question(s) then for you are: 1. Why are these the two designs you have? (in another way: What are the decisions and requirements you have that led you to these options) and 2. What is the challenge you're having in picking one of them?
Jason Warren
@jaspnwarren
jasonwarren.ca
habaneroconsulting.com/Insights

Microsoft Excel Physical Architecture not possible to create.

Hello:
I´m using ODI 11.1.1.5 and I have problems to load a simple Excel file.
Following instructions of different blogs, I don't have in ODI the Microsoft Excel "Technology" under the "Physical Architecture Section" under "Technologies" folder.
I only have a "File" folder inside "Technology" folder.
When I try to create a new technology, I get a message saying: "Unable to save Microsoft Excel (ODI-17591: Name 'MICROSOFT_EXCEL' is already used)"
Can anyone help me with this?

Are you trying to create a dataserver under Excel or actually create a new technology?
I think you want to right click excel and add a dataserver, try a different name - It might be getting confused with the code derived from the name you are currently providing.

Application installation based on architecture and chassis

Hi,
Want to install application based on OS architecture and also whether the machine is laptop or desktop.
Let me know the WMI query that can be integrated in task sequence.
Regards, Shishir Kushawaha "If this thread answered your question, please click on "Mark as Answer"

Using requirements is probably the better way to go but it does depend upon your scenario.
Also note that using Win32_Battery can be problematic for a few different reasons. Generally, the ChassisType attribute of Win32_SystemEnclosure is the preferred method (it's used by MDT). DataWidth of Win32_processor also can be problematic if you have
any legacy/unsupported OSes in the environment also; e.g., XP.
Jason | http://blog.configmgrftw.com

Finding of the Logical and Physical filename,Logical and Physical Path

Hello All
Where and how can I find the below details in an SAP server
Logical filename:
Physical filename:
Logical path:
Physical path:
Regards
Kalyani

hi
Physical file is what you see from the OS level.
Logical file is what ABAP code can call certain functions to read/write.
Transaction FILE would link them together. Typically the logical path ends with "<FILENAME>", and the logical file refers to the logical path.
To extract the physical path from the logical path name
DATA: lf_mandt TYPE sy-mandt,
lf_opsys TYPE sy-opsys.
lf_mandt = sy-mandt.
lf_opsys = sy-opsys.
To extract the physical path from the logical path name
CALL FUNCTION 'FILE_GET_NAME'
EXPORTING
client = lf_mandt
logical_filename = p_unix
operating_system = lf_opsys
IMPORTING
file_name = gwa_input
EXCEPTIONS
file_not_found = 1
OTHERS = 2.
IF sy-subrc EQ 0.
Concatenating the physical path and the input unix file name
CONCATENATE gwa_input p_file INTO gf_file .
ENDIF.
You need to tak ehelp of ABAPer for this
Check the link
http://help.sap.com/saphelp_nw04/helpdata/en/fc/eb3deb358411d1829f0000e829fbfe/frameset.htm
Regards

Query on Physical Architecture,Logical Architecture and Model

Similar Messages

Maybe you are looking for